TPA's equality
TPA's equality is an inequality discovered by AoPS user thepiercingarrow in 2017, said to have been inspired from doing calculus with snek.
Inequality
Let be any symmetric inequality. Let
be the parts of that inequality. Then in contest space,
achieves equality when
Proof
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.
Problems
Introductory
Prove the equality case of AM-GM using TPA's equality.
Intermediate
- Prove that for any
, we have the maximum of
is
.
Olympiad
- Let
be positive real numbers. Prove that the minimum of
is
(Source)