Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — Schläfli: det⁡(Sym2A)=(det⁡A)k+1\det(\mathrm{Sym}^2A)=(\det A)^{k+1}det(Sym2A)=(detA)k+1

Proved
KServerConj.lemma_3_1

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

competitive-analysisk-serveronline-algorithmsp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1valuationswork-function-algorithm

For every k×kk\times kk×k matrix AAA over a commutative ring, the matrix of the induced map Sym2A\mathrm{Sym}^2ASym2A on quadratic forms, in the monomial basis (eiej)i≤j(e_ie_j)_{i\le j}(ei​ej​)i≤j​, satisfies

det⁡(Sym2A)=(det⁡A)k+1.\det(\mathrm{Sym}^2A)=(\det A)^{k+1}.det(Sym2A)=(detA)k+1.

The exponent k+1k+1k+1 counts how often a basis vector occurs among the products eieje_ie_jei​ej​: twice in its square and once in each of its k−1k-1k−1 mixed products. It is the source of the factor k+1k+1k+1 in the terminal bound of the potential (Lemma 5.1), and it shows that Ψ\PsiΨ is unchanged by a normalization with det⁡B=1\det B=1detB=1.

Differences from the source:

  • generalization: every invertible k × k matrix A over K → every k × k matrix over every commutative ring; reason: the identity is a polynomial identity with integer coefficients in the entries of A; the invertible case over K is a special case
  • encoding: the monomial basis (e_ie_j)_{1≤i≤j≤k} in lexicographic order → rows and columns indexed by Sym2 (Fin k); reason: a determinant is unchanged by the same reordering of rows and columns
Preamble
import Mathlib
import Definitions.Def_KServerConj_symProd
Formal statement
namespace KServerConj

/-- **Lemma 3.1 (Schläfli).** Coester, Koutsoupias, Zbysiński, *The k-server conjecture is true*,
arXiv:2609.15979 (version of 2026-11-03, sha256 7ca0380a…), printed p.9 (PDF p.10): "For every
invertible k × k matrix A, det(Sym² A) = (det A)^{k+1}. (15)"

**Formalization Note.** `sym2Mat A` is the matrix of `Sym² A` in the monomial basis
`(e_ie_j)_{i≤j}`, indexed by `Sym2 (Fin k)`. The identity is stated for every square matrix over
every commutative ring: it is a polynomial identity in the entries of `A`, so the invertible case
over the paper's field `K` is a special case. -/
theorem lemma_3_1 {R : Type*} [CommRing R] {k : ℕ} (A : Matrix (Fin k) (Fin k) R) :
    (sym2Mat A).det = A.det ^ (k + 1) := by sorry

end KServerConj
Source
Coester, Koutsoupias, Zbysiński, The k-server conjecture is true, arXiv:2609.15979 (version of 2026-11-03, sha256 7ca0380a…), Lemma 3.1, p.9 (pdf p.10)
Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me