Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.14 — every g∈Unipn(R)g\in\mathrm{Unip}_n(R)g∈Unipn​(R) is a product of at most 6 elements of H1∪H2H_1\cup H_2H1​∪H2​

Proved
PolySwap.KMS.proposition_5_14

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

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

Let RRR be a commutative unital ring, n≥5n\ge5n≥5, and let H1,H2<Unipn(R)H_1,H_2<\mathrm{Unip}_n(R)H1​,H2​<Unipn​(R) be

H1=⟨Ei,j(A):1≤i≤j≤4, A (i,j)-admissible⟩,H2=⟨Ei,5(A):2≤i≤5, A (i,5)-admissible⟩.H_1=\langle E_{i,j}(A):1\le i\le j\le4,\ A\ (i,j)\text{-admissible}\rangle,\qquad H_2=\langle E_{i,5}(A):2\le i\le5,\ A\ (i,5)\text{-admissible}\rangle.H1​=⟨Ei,j​(A):1≤i≤j≤4, A (i,j)-admissible⟩,H2​=⟨Ei,5​(A):2≤i≤5, A (i,5)-admissible⟩.

Then every element g∈Unipn(R)g\in\mathrm{Unip}_n(R)g∈Unipn​(R) can be written as a product of at most 6 elements of H1∪H2H_1\cup H_2H1​∪H2​.

Differences from the source:

  • reading: H₂ = ⟨E_{i,5}(A) : 2 ≤ i ≤ 5, A is (i, j)-admissible⟩ → A is (i, 5)-admissible; reason: the only j in the generator E_{i,5}(A) is 5
  • encoding: (i, j)-admissible block matrices and E_{i,j}(A); the subgroups H₁, H₂ → the embedded n × n encoding of the Unip definition; H₁, H₂ as hypotheses hH₁, hH₂ fixing them to the subgroup closures; reason: same groups
  • encoding: n ≥ 5 (standing for the 5-block form, p. 37) → hypothesis 5 ≤ n; reason: the section's standing assumption
Preamble
import Mathlib
import Definitions.Def_PolySwap_KMS_Unip
Formal statement
namespace PolySwap.KMS

/-- **Proposition 5.14**, p. 46. Let `n ≥ 5` and let `H₁, H₂ < Unip_n(R)` be
`H₁ = ⟨E_{i,j}(A) : 1 ≤ i ≤ j ≤ 4, A (i, j)-admissible⟩` and
`H₂ = ⟨E_{i,5}(A) : 2 ≤ i ≤ 5, A (i, 5)-admissible⟩`. Then every `g ∈ Unip_n(R)` is a product
of at most 6 elements of `H₁ ∪ H₂`. -/
theorem proposition_5_14 (n : ℕ) (R : Type*) [CommRing R] (hn : 5 ≤ n)
    (H₁ H₂ : Subgroup (Unip n R))
    (hH₁ : H₁ = Subgroup.closure {g | ∃ i j A, 1 ≤ i ∧ i ≤ j ∧ j ≤ 4 ∧ Admissible n R i j A ∧
      umat n R g = E n R i j A})
    (hH₂ : H₂ = Subgroup.closure {g | ∃ i A, 2 ≤ i ∧ i ≤ 5 ∧ Admissible n R i 5 A ∧
      umat n R g = E n R i 5 A}) :
    ∀ g : Unip n R, ∃ l : List (Unip n R), l.length ≤ 6 ∧ (∀ x ∈ l, x ∈ H₁ ∨ x ∈ H₂) ∧
      l.prod = g := 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…), Proposition 5.14, p. 46
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