Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.17 — the links CC(U[d]∖J;(U[d]∖(J∪I)))CC(U_{[d]\setminus J};(U_{[d]\setminus(J\cup I)}))CC(U[d]∖J​;(U[d]∖(J∪I)​)) are connected for ∣I∣≥3|\mathcal I|\ge3∣I∣≥3 and 1-connected for ∣I∣≥4|\mathcal I|\ge4∣I∣≥4

Proved
PolySwap.KMS.lemma_3_17

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

high-dimensional-expandersp2o-gran-per-chapterp2o-plan-paperp2o-v1swap-coboundary-expansion

Assume the field size satisfies q≥5q\ge5q≥5. Let I\mathcal II be a set of disjoint colour sets of size r+1r+1r+1 in [d][d][d] and J∈IJ\in\mathcal IJ∈I. The complex

CC(U[d]∖J;(U[d]∖(J∪I))I∈I∖{J})CC\big(U_{[d]\setminus J};(U_{[d]\setminus(J\cup I)})_{I\in\mathcal I\setminus\{J\}}\big)CC(U[d]∖J​;(U[d]∖(J∪I)​)I∈I∖{J}​)

is connected if ∣I∣≥3|\mathcal I|\ge3∣I∣≥3 and 1-connected if ∣I∣≥4|\mathcal I|\ge4∣I∣≥4. Thus in particular, if ∣I∣≥4|\mathcal I|\ge4∣I∣≥4, then H1((FIX)gHJ,Λ)=1H^1\big((F^{\mathcal I}X)_{gH_J},\Lambda\big)=1H1((FIX)gHJ​​,Λ)=1 for X=X(Ad,Fq,f)X=X(A_d,\mathbb F_q,f)X=X(Ad​,Fq​,f) (fff irreducible of degree ≥2\ge2≥2), every vertex gHJgH_JgHJ​ of FIXF^{\mathcal I}XFIX of colour JJJ and every group Λ\LambdaΛ.

Differences from the source:

  • encoding: a prime power q = p^m and the field F_q → a finite field F (Fintype F) with q = Fintype.card F and p = ringChar F; reason: every finite field has prime-power order q and prime characteristic p; same instances
  • encoding: d ≥ 2 and 1 ≤ r ≤ d (§2.3 and Definition 2.14 standing assumptions); I a set of T disjoint colour sets (the §3.3 setting) → hypotheses 2 ≤ d, 1 ≤ r and I ∈ disjointColorSets d r T; |I| = I.card; reason: the standing assumptions as binders
  • reading: the vertex link (F^I X){gH_J} ≅ CC(U{[d]∖J}; (U_{[d]∖(J∪I)}){I∈I∖{J}}) in the upper-triangular model of §3.3, with the colours cyclically relabelled so that a chosen j₀ ∈ J becomes 0 (Definition 3.6) → linkY / binY: subgroups UL d F B = ⟨e{i,i+1}(λ) : i ∈ B⟩ of SL_{d+1}(F_q) with the relabelling j₀ = min J (base J); reason: Definition 3.6 lets j₀ ∈ J be chosen and states the conditions do not depend on the choice; the least element is one such choice
  • encoding: X(A_d, F_q, f) = CC(SL_{d+1}(F_q[t]/(f)); (π_f(U_{[d]∖{i}}))_{i∈[d]}) with the uniform top-level distribution → kmsX d F f: cosetComplex over SL (Fin (d+1)) (AdjoinRoot f) of Hf d F f i = (U d F ([d]∖{i})).map (SpecialLinearGroup.map (AdjoinRoot.mk f)), vertices ⟨i, gH^f_i⟩ : Σ i, G ⧸ H^f_i, colour i; reason: Lean convention (0-based matrix indices, F_q[t]/(f) as AdjoinRoot f); the same complex and weights
  • encoding: 1-connected (Definition 2.28) → IsOneConnected (combinatorial edge-path form, Remark 2.29); reason: the two notions coincide
  • encoding: H¹(Y, Λ) = 1 (every orbit of a cocycle is that of the trivial cocycle, equivalently B¹ = Z¹) → H1Trivial: every 1-cocycle equals d₀g on every ordered edge for some 0-cochain g; reason: the paper's equivalence (p. 12); cochains are total functions and only their values on the complex count
  • encoding: the coset complex CC(G; (H_i)) with vertex set ⊔_i G/H_i (Definition 2.4) → cosetComplex G H : WComplex (Σ i, G ⧸ H i), maximal faces the chambers {gH_i : i}, uniform top weight; reason: Lean convention for ⊔_i G/H_i; same faces and weights
Preamble
import Mathlib
import Definitions.Def_PolySwap_KMS_Complex
import Definitions.Def_PolySwap_KMS_Cohomology
import Definitions.Def_PolySwap_KMS_Cone
import Definitions.Def_PolySwap_KMS_Dehn
import Definitions.Def_PolySwap_KMS_KMSComplex

open Polynomial
Formal statement
namespace PolySwap.KMS

/-- **Lemma 3.17**, p. 27. Let `q ≥ 5`, let `I` be a set of disjoint colour sets of size `r + 1`
and `J ∈ I`. The complex `Y = CC(U_{[d]\J}; (U_{[d]\(J ∪ I)})_{I ∈ I \ {J}})` is connected if
`|I| ≥ 3` and 1-connected if `|I| ≥ 4`. Thus in particular, if `|I| ≥ 4`, then
`H¹((F^I X)_{gH_J}, Λ) = 1` for `X = X(A_d, F_q, f)`, every vertex `gH_J` of colour `J` and every
group `Λ`. -/
theorem lemma_3_17 (d r T : ℕ) (hd : 2 ≤ d) (hr : 1 ≤ r) (F : Type*) [Field F] [Fintype F]
    (hq : 5 ≤ Fintype.card F) (I : Finset (Finset ℕ)) (hI : I ∈ disjointColorSets d r T)
    (J : Finset ℕ) (hJ : J ∈ I) :
    (3 ≤ I.card → (linkY d F I J).IsConnected) ∧
    (4 ≤ I.card → (linkY d F I J).IsOneConnected) ∧
    (4 ≤ I.card → ∀ f : F[X], Irreducible f → 2 ≤ f.natDegree →
      ∀ v ∈ (kmsFI d F f I).vertices, v.image (kmsCol d F f) = J →
        ∀ (Λ : Type*) [Group Λ], ((kmsFI d F f I).link {v}).H1Trivial Λ) := by sorry

end PolySwap.KMS
Source
Dikstein, Oppenheim, Valentiner-Branth, Polynomial Swap Coboundary Expansion with Applications to LTCs and PCPs, STOC 2027 submission (manuscript sha256 b9cb2095…), Lemma 3.17, p. 27
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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