Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1, p. 14 — ker((d_{k−1})*) ⊆ C^k_0, and ψ ∈ C^{k−1}_0 ⇔ d_{k−1}ψ ∈ C^k_0

Proved
HighOrderWalks.TwoSided.lemma_5_1

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

cochainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1signless-differentialsimplicial-complex

Let XXX be a pure nnn-dimensional weighted simplicial complex and 0≤k≤n−10\le k\le n-10≤k≤n−1. Write C0j(X,R)={ϕ: ∑σ∈X(j)m(σ)ϕ(σ)=0}C^j_0(X,\mathbb R)=\{\phi:\ \sum_{\sigma\in X(j)}m(\sigma)\phi(\sigma)=0\}C0j​(X,R)={ϕ: ∑σ∈X(j)​m(σ)ϕ(σ)=0} for the jjj-cochains orthogonal to the constants. Then:

  1. every kkk-cochain ϕ\phiϕ with (dk−1)∗ϕ=0(d_{k-1})^*\phi=0(dk−1​)∗ϕ=0 on X(k−1)X(k-1)X(k−1) lies in C0k(X,R)C^k_0(X,\mathbb R)C0k​(X,R), i.e. ker⁡((dk−1)∗)⊆C0k(X,R)\ker((d_{k-1})^*)\subseteq C^k_0(X,\mathbb R)ker((dk−1​)∗)⊆C0k​(X,R);
  2. for every (k−1)(k-1)(k−1)-cochain ψ\psiψ,
ψ∈C0k−1(X,R)  ⟺  dk−1ψ∈C0k(X,R).\psi\in C^{k-1}_0(X,\mathbb R)\iff d_{k-1}\psi\in C^k_0(X,\mathbb R).ψ∈C0k−1​(X,R)⟺dk−1​ψ∈C0k​(X,R).

This lemma lets the Decomposition Theorem split a cochain orthogonal to the constants into pieces that stay orthogonal to the constants.

Formalization Note. Orthogonality is weighted by mmm. At k=0k=0k=0 the space C0−1C^{-1}_0C0−1​ (not defined on the page, which defines C0jC^j_0C0j​ for j≥0j\ge0j≥0) is read by the same formula: m(∅)ψ(∅)=0m(\emptyset)\psi(\emptyset)=0m(∅)ψ(∅)=0.

Preamble
import Mathlib
import Definitions.Def_HighOrderWalks_TwoSided_Setting
Formal statement
namespace HighOrderWalks.TwoSided

/-- Lemma 5.1, p. 14: for `0 ≤ k ≤ n - 1`, `ker((d_{k-1})*) ⊆ C^k_0(X, ℝ)`, and a
`(k-1)`-cochain `ψ` lies in `C^{k-1}_0(X, ℝ)` iff `d_{k-1}ψ ∈ C^k_0(X, ℝ)`. Membership in
`C^j_0` is weighted orthogonality to the constants. -/
theorem lemma_5_1 {V : Type*} [DecidableEq V] (X : Finset (Finset V)) (n : ℕ)
    (hX : HighOrderWalks.OneSided.IsPureComplex X n) (m : Finset V → ℝ) (hm : HighOrderWalks.OneSided.IsWeight X n m)
    (k : ℕ) (hk : k + 1 ≤ n) :
    (∀ φ : Finset V → ℝ, (∀ τ ∈ HighOrderWalks.OneSided.cells X k, HighOrderWalks.OneSided.dStar X m φ τ = 0) →
        HighOrderWalks.OneSided.ip X m (k + 1) φ (fun _ => 1) = 0) ∧
      ∀ ψ : Finset V → ℝ,
        HighOrderWalks.OneSided.ip X m k ψ (fun _ => 1) = 0 ↔ HighOrderWalks.OneSided.ip X m (k + 1) (HighOrderWalks.OneSided.dS X ψ) (fun _ => 1) = 0 := by sorry

end HighOrderWalks.TwoSided
Source
Kaufman–Oppenheim, High Order Random Walks: Beyond Spectral Gap, arXiv:1707.02799v3, p. 14, Lemma 5.1
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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