The slightly less bold conjecture on elementary entailment
The slightly less bold conjecture on elementary entailment
Let and be linear data, and let be a partial matching map as in the paper. Write for entailment using the additional elementary elimination rule, and for entailment using only the original Cauchy–Schwarz rules. Slightly less bold conjecture. If , then there exists some such that . This asks whether every entailment obtained from an elementary functional-equation argument can be simulated by repeated Cauchy–Schwarz applications; the source gives no resolution and notes possible difficulties with eliminating non-trivial subexpressions.
Sources & referencesView supporting material
Primary source
Freddie Manners, “True complexity and iterated Cauchy–Schwarz”, arXiv:2109.05731 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.