Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.24 — change of presentation: DehnS,R(m)≤C2 DehnS′,R′(C1m)+C3m\mathrm{Dehn}_{S,R}(m)\le C_2\,\mathrm{Dehn}_{S',R'}(C_1m)+C_3mDehnS,R​(m)≤C2​DehnS′,R′​(C1​m)+C3​m

Proved
PolySwap.KMS.proposition_2_24

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

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

Let GGG be a group with two finite presentations G=⟨S∣R⟩=⟨S′∣R′⟩G=\langle S\mid R\rangle=\langle S'\mid R'\rangleG=⟨S∣R⟩=⟨S′∣R′⟩ (S,S′S,S'S,S′ finite symmetric generating sets, R,R′R,R'R,R′ finite). Choose ϕ:Free(S)→Free(S′)\phi:\mathrm{Free}(S)\to\mathrm{Free}(S')ϕ:Free(S)→Free(S′) sending each s∈Ss\in Ss∈S to a word wsw_sws​ with s=wss=w_ss=ws​ in GGG and ∣ws∣S′|w_s|_{S'}∣ws​∣S′​ minimal, and ϕ′:Free(S′)→Free(S)\phi':\mathrm{Free}(S')\to\mathrm{Free}(S)ϕ′:Free(S′)→Free(S) likewise. Put C1=max⁡s∈S∣ϕ(s)∣S′C_1=\max_{s\in S}|\phi(s)|_{S'}C1​=maxs∈S​∣ϕ(s)∣S′​, C2=max⁡ρ′∈R′AreaR(ϕ′(ρ′))C_2=\max_{\rho'\in R'}\mathrm{Area}_R(\phi'(\rho'))C2​=maxρ′∈R′​AreaR​(ϕ′(ρ′)) and C3=max⁡s∈SAreaR(s (ϕ′(ϕ(s)))−1)C_3=\max_{s\in S}\mathrm{Area}_R\big(s\,(\phi'(\phi(s)))^{-1}\big)C3​=maxs∈S​AreaR​(s(ϕ′(ϕ(s)))−1). Then for every m∈Nm\in\mathbb Nm∈N

DehnS,R(m)≤C2 DehnS′,R′(C1m)+C3m.\mathrm{Dehn}_{S,R}(m)\le C_2\,\mathrm{Dehn}_{S',R'}(C_1m)+C_3m.DehnS,R​(m)≤C2​DehnS′,R′​(C1​m)+C3​m.

Differences from the source:

  • encoding: the maxima C₁, C₂, C₃ and the Dehn functions in ℕ → C₁ = ⨆ s, wordLength (φ s) in ℕ (S finite); C₂, C₃ and the Dehn functions in ℕ∞ via iSup; reason: finite maxima; every area involved is finite because both are presentations, so no ⊤ or 0·⊤ occurs
  • encoding: for every m ∈ ℕ (ℕ positive) → ∀ m : ℕ, including m = 0; reason: at m = 0 both sides are trivially 0 ≤ …; no instance changes
Preamble
import Mathlib
import Definitions.Def_PolySwap_KMS_Dehn
Formal statement
namespace PolySwap.KMS

/-- **Proposition 2.24** (change of presentation), p. 17. Let `G = ⟨S | R⟩ = ⟨S' | R'⟩` be two
finite presentations (§2.5: `S`, `S'` finite symmetric generating sets, `R`, `R'` finite). Let
`ϕ : Free(S) → Free(S')` send every `s ∈ S` to a shortest word `ϕ(s)` in `S'` equal to `s` in `G`,
and `ϕ' : Free(S') → Free(S)` likewise. With `C₁ = max_s |ϕ(s)|_{S'}`,
`C₂ = max_{ρ' ∈ R'} Area_R(ϕ'(ρ'))` and `C₃ = max_s Area_R(s (ϕ'(ϕ(s)))⁻¹)`, for every `m`,
`Dehn_{S,R}(m) ≤ C₂ · Dehn_{S',R'}(C₁ m) + C₃ m`. -/
theorem proposition_2_24 {G : Type*} [Group G] {S S' : Type*} [Finite S] [Finite S']
    (ι : S → G) (R : Set (FreeGroup S)) (ι' : S' → G) (R' : Set (FreeGroup S'))
    (hP : IsPresentation ι R) (hP' : IsPresentation ι' R') (hR : R.Finite) (hR' : R'.Finite)
    (hS : ∀ s, ∃ t, ι t = (ι s)⁻¹) (hS' : ∀ s', ∃ t', ι' t' = (ι' s')⁻¹)
    (φ : S → FreeGroup S') (φ' : S' → FreeGroup S)
    (hφ : ∀ s, FreeGroup.lift ι' (φ s) = ι s ∧
      ∀ w, FreeGroup.lift ι' w = ι s → wordLength (φ s) ≤ wordLength w)
    (hφ' : ∀ s', FreeGroup.lift ι (φ' s') = ι' s' ∧
      ∀ w, FreeGroup.lift ι w = ι' s' → wordLength (φ' s') ≤ wordLength w) :
    ∀ m : ℕ, dehn ι R m ≤
      (⨆ ρ' ∈ R', area R (FreeGroup.lift φ' ρ')) *
          dehn ι' R' ((⨆ s, wordLength (φ s)) * m) +
        (⨆ s, area R (FreeGroup.of s * (FreeGroup.lift φ' (φ s))⁻¹)) * (m : ℕ∞) := 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 2.24, p. 17
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