Lemma 5.1, p. 14 — ker((d_{k−1})*) ⊆ C^k_0, and ψ ∈ C^{k−1}_0 ⇔ d_{k−1}ψ ∈ C^k_0
ProvedHighOrderWalks.TwoSided.lemma_5_1cochainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1signless-differentialsimplicial-complex
Let be a pure -dimensional weighted simplicial complex and . Write for the -cochains orthogonal to the constants. Then:
- every -cochain with on lies in , i.e. ;
- for every -cochain ,
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 . At the space (not defined on the page, which defines for ) is read by the same formula: .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.