TPA's equality, also known as the TPA-snek equality, is an equality discovered by AoPS user thepiercingarrow in 2017, said to have been inspired from doing calculus with snek.
DISCLAIMER: THIS IS FAKE
Let be any symmetric inequality involving positive numbers. Let be the parts of that inequality. In contest space, if achieves the equality then it is for
The proof of TPA's equality is very complicated. It requires using quantum computing to search all inequalities over contest space and checking the verity of the TPA equality for each one. A program was developed by alifenix- in TPA-Snek Labs in Equestria, and ran on the TPA-Snek quantum computer. This program is now open-sourced and available for anyone to run. It can be found on the TPA-Snek Labs main website.
Prove the equality case of AM-GM using TPA's equality.
- Prove that for any , we have the maximum of is .
- Let be positive real numbers. Prove that the minimum of is (Source)
Extention to all reals
- Consider . When x is set equal to y then there is no solution for x and y that satisfies the equality. However when taking the equality does hold. This leads us to think that given a 2 var inequality for all reals, we find the equality case when the variables are additive inverses.
Clarification of Domain of TPA's equality
- Consider . When x is set equal to y then there is no solution for x and y that satisfies the equality. However when taking the equality does hold so it is a strict equality. This is because is not positive, and thus this does not count as an inequality involving positive parts.
The minimum of the polynomial cannot exceed 0 by trivial inequality. It is a symmetrical polynomial where each part is positive by trivial inequality. It is also achieved at or , where the polynomial has a value of 0. For more information about this topic, read: https://www.maa.org/sites/default/files/pdf/upload_library/22/Ford/Waterhouse378-387.pdf