The slightly less bold conjecture on elementary entailment

About 5 years old · traced to

Let Φ\Phi and Ψ\Psi be linear data, and let γ\gamma be a partial matching map as in the paper. Write Φ⊢γ′kΨ\Phi\vdash'^k_\gamma\Psi for entailment using the additional elementary elimination rule, and Φ⊢γk′Ψ\Phi\vdash^{k'}_\gamma\Psi for entailment using only the original Cauchy–Schwarz rules. Slightly less bold conjecture. If Φ⊢γ′kΨ\Phi\vdash'^k_\gamma\Psi, then there exists some k′≥0k'\geq0 such that Φ⊢γk′Ψ\Phi\vdash^{k'}_\gamma\Psi. 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.

References

Primary source

Freddie Manners, “True complexity and iterated Cauchy–Schwarz”, arXiv:2109.05731 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.