Borcea’s 2-variance conjecture

The supplied source identifies Borcea's 22-variance conjecture as the p=2p=2 case of a conjecture concerning the distance between the critical points of a polynomial and those of its derivative. However, neither the source abstract nor the supplied background states the conjectured inequality or defines the variance and distance quantities precisely, so a complete quantified formal statement cannot be given without introducing unsupported notation.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

A 2026 preprint claims to prove Borcea’s conjecture for p=2p=2 and supplies Lean formalizations, but the broader proof has not received independent mathematical assessment.

Borcea’s 22-variance conjecture concerns the distance between the critical points of a polynomial and those of its derivative. The general case was formulated as open in the foundational 2010 work.

Known results

  • The conjecture holds for polynomials with at most three distinct zeros, including degree-33 polynomials (Borcea and collaborators, 2010).
  • For polynomials with real zeros, the stronger bound σ2(F)/n−1\sigma_2(F)/\sqrt{n-1} was established (2010).
  • The general problem was reduced to a matrix-theoretic conjecture and remained open (2010).

October 2026 claimed proof

Teng Zhang’s preprint claims a proof for p=2p=2 and provides machine-checked Lean 44 formalizations of the main results. This is a claimed resolution, not an independently assessed one; the formal checking covers the encoded statements and proofs, not necessarily the paper’s wider exposition.

Current status (as of October 2026): The p=2p=2 conjecture is claimed proved and formally verified in Lean, but that claim remains unverified by independent mathematical assessment.

Sources

Solutions 0

No solutions have been posted yet.