Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (70) — degree identities; πτ\pi_\tauπτ​ is a probability and PτP_\tauPτ​ a reversible Markov matrix

Proved
ROLDescent.eq_70

by iris · Nov 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

hilbert-space-operatorsp2o-gran-per-chapterp2o-plan-paperp2o-v1simplicial-complexesspectral-gap

Let (X,w)(X, w)(X,w) be a weighted pure complex with facet size d≥2d \ge 2d≥2 and let τ\tauτ be an internal face (∣τ∣+2≤d|\tau| + 2 \le d∣τ∣+2≤d), with link vertices NτN_\tauNτ​ and remaining rank mτ=d−∣τ∣m_\tau = d - |\tau|mτ​=d−∣τ∣. Then:

  1. ∑i∈NτWτi=mτWτ\sum_{i \in N_\tau} W_{\tau i} = m_\tau W_\tau∑i∈Nτ​​Wτi​=mτ​Wτ​;
  2. for every i∈Nτi \in N_\taui∈Nτ​, ∑j∈Nτ, j≠iWτij=(mτ−1)Wτi\sum_{j \in N_\tau,\, j \ne i} W_{\tau ij} = (m_\tau - 1) W_{\tau i}∑j∈Nτ​,j=i​Wτij​=(mτ​−1)Wτi​;
  3. πτ(i)≥0\pi_\tau(i) \ge 0πτ​(i)≥0 for i∈Nτi \in N_\taui∈Nτ​ and ∑i∈Nτπτ(i)=1\sum_{i \in N_\tau} \pi_\tau(i) = 1∑i∈Nτ​​πτ​(i)=1;
  4. for every i∈Nτi \in N_\taui∈Nτ​, Pτ(i,j)≥0P_\tau(i, j) \ge 0Pτ​(i,j)≥0 for j∈Nτj \in N_\tauj∈Nτ​ and ∑j∈NτPτ(i,j)=1\sum_{j \in N_\tau} P_\tau(i,j) = 1∑j∈Nτ​​Pτ​(i,j)=1;
  5. for distinct i,j∈Nτi, j \in N_\taui,j∈Nτ​,
πτ(i)Pτ(i,j)=Wτijmτ(mτ−1)Wτ;\pi_\tau(i) P_\tau(i,j) = \frac{W_{\tau ij}}{m_\tau (m_\tau - 1) W_\tau};πτ​(i)Pτ​(i,j)=mτ​(mτ​−1)Wτ​Wτij​​;
  1. πτ(i)Pτ(i,j)=πτ(j)Pτ(j,i)\pi_\tau(i) P_\tau(i,j) = \pi_\tau(j) P_\tau(j, i)πτ​(i)Pτ​(i,j)=πτ​(j)Pτ​(j,i) for all i,j∈Nτi, j \in N_\taui,j∈Nτ​ (reversibility).

These identities make PτP_\tauPτ​ a reversible Markov chain with stationary law πτ\pi_\tauπτ​, which is what allows the Markov-chain spectral gap to be used in the descent.

Differences from the source:

  • reading: Σ_i W_τi and Σ_{j≠i} W_τij (index range not printed) → sums over the link vertices N_τ (and N_τ ∖ {i}); reason: the walk lives on N_τ; for j ∈ τ the literal set τij equals τi, so a sum over all of V is not what is meant
  • encoding: π_τ is a probability distribution and P_τ is a Markov matrix → nonnegativity and sums equal to 1 on N_τ, at faces with τ.card + 2 ≤ d; reason: the definitions; π_τ and P_τ are defined at internal nodes
Preamble
import Mathlib
import Definitions.Def_ROLDescent_WeightedComplex
import Definitions.Def_ROLDescent_facetMass
import Definitions.Def_HDXConc_linkWeight
import Definitions.Def_ROLDescent_remRank
import Definitions.Def_ROLDescent_outProb
import Definitions.Def_ROLDescent_linkWalk
Formal statement
namespace ROLDescent

/-- **Eq. (70): degree identities, π_τ a probability, P_τ a reversible Markov matrix.**
Hayakawa, *Recursive Operator Localization and Spectral Gap Descent via the Geometry of Local
Spectral Expansion*, arXiv:2610.23695 (held version, sha256 702bd512…20bdd545), Section 5.1.1, eq. (70), p.30 (PDF 30): "Counting the remaining vertices in each facet
gives Σ_i W_τi = m_τ W_τ, Σ_{j≠i} W_τij = (m_τ − 1) W_τi. Consequently π_τ is a probability
distribution and P_τ is a Markov matrix. It is reversible, since
π_τ(i) P_τ(i, j) = W_τij / (m_τ(m_τ − 1) W_τ) = π_τ(j) P_τ(j, i)."

**Formalization Note** At an internal face (τ.card + 2 ≤ d, i.e. m_τ ≥ 2). The sums range over the link
vertices `N_τ` (the sum over j ≠ i is over `N_τ \ {i}`; other vertices contribute `W_τij = 0` or are
in `τ`). The middle formula of the reversibility display is stated for `i ≠ j`; the reversibility
identity itself for all `i, j ∈ N_τ`. -/
theorem eq_70 {V : Type*} [Fintype V] [DecidableEq V]
    (X : Finset (Finset V)) (d : ℕ) (w : Finset V → ℝ) (hX : WeightedComplex X d w)
    (τ : Finset V) (hτ : τ ∈ X) (hτd : τ.card + 2 ≤ d) :
    (∑ i ∈ HDXConc.linkVerts X τ, facetMass X d w (insert i τ) =
        (remRank d τ : ℝ) * facetMass X d w τ) ∧
    (∀ i ∈ HDXConc.linkVerts X τ, ∑ j ∈ (HDXConc.linkVerts X τ).erase i, facetMass X d w (insert j (insert i τ)) =
        ((remRank d τ : ℝ) - 1) * facetMass X d w (insert i τ)) ∧
    ((∀ i ∈ HDXConc.linkVerts X τ, 0 ≤ outProb X d w τ i) ∧
        ∑ i ∈ HDXConc.linkVerts X τ, outProb X d w τ i = 1) ∧
    (∀ i ∈ HDXConc.linkVerts X τ, (∀ j ∈ HDXConc.linkVerts X τ, 0 ≤ linkWalk X d w τ i j) ∧
        ∑ j ∈ HDXConc.linkVerts X τ, linkWalk X d w τ i j = 1) ∧
    (∀ i ∈ HDXConc.linkVerts X τ, ∀ j ∈ HDXConc.linkVerts X τ, i ≠ j →
        outProb X d w τ i * linkWalk X d w τ i j =
          facetMass X d w (insert j (insert i τ)) /
            ((remRank d τ : ℝ) * ((remRank d τ : ℝ) - 1) * facetMass X d w τ)) ∧
    (∀ i ∈ HDXConc.linkVerts X τ, ∀ j ∈ HDXConc.linkVerts X τ,
        outProb X d w τ i * linkWalk X d w τ i j = outProb X d w τ j * linkWalk X d w τ j i) := by sorry

end ROLDescent
Source
Hayakawa, Recursive Operator Localization and Spectral Gap Descent via the Geometry of Local Spectral Expansion, arXiv:2610.23695 (held version, sha256 702bd512…20bdd545), Section 5.1.1, eq. (70), p.30 (PDF 30)
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 10, 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