Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (71) — Pτ(i,j)=πτi(j)P_\tau(i,j)=\pi_{\tau i}(j)Pτ​(i,j)=πτi​(j) for mτ≥3m_\tau\ge 3mτ​≥3

Proved
ROLDescent.eq_71

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

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

Let (X,w)(X, w)(X,w) be a weighted pure complex with facet size ddd, let τ\tauτ be a face with remaining rank mτ≥3m_\tau \ge 3mτ​≥3 (that is, ∣τ∣+3≤d|\tau| + 3 \le d∣τ∣+3≤d), and let i,j∈Nτi, j \in N_\taui,j∈Nτ​ be distinct. Then

Pτ(i,j)=πτi(j).P_\tau(i, j) = \pi_{\tau i}(j).Pτ​(i,j)=πτi​(j).

The transition distribution from iii in the parent's link agrees with the outgoing distribution at the child τi\tau iτi. This consistency is what lets one set of facet weights serve every level of the hierarchy, and it identifies the child Gram norms inside the one-step Gram estimate.

Differences from the source:

  • generalization: on each legal edge (τ ∪ {i, j} ∈ X) → for all distinct i, j ∈ N_τ; reason: for non-edges both sides are 0; the statement specializes to legal edges
Preamble
import Mathlib
import Definitions.Def_ROLDescent_WeightedComplex
import Definitions.Def_HDXConc_linkWeight
import Definitions.Def_ROLDescent_outProb
import Definitions.Def_ROLDescent_linkWalk
Formal statement
namespace ROLDescent

/-- **Eq. (71): the link walk from i is the outgoing distribution at the child τi.**
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. (71), p.30 (PDF 30): "Moreover, on each legal edge, the transition
distribution from i in the parent's link agrees with the outgoing distribution at the child τi:
P_τ(i, j) = π_τi(j) (m_τ ≥ 3)."

**Formalization Note** m_τ ≥ 3 is `τ.card + 3 ≤ d`; the identity is stated for all `i, j ∈ N_τ` with
`j ≠ i` (this includes every legal edge; for a non-edge both sides are `0`). -/
theorem eq_71 {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 + 3 ≤ d)
    (i j : V) (hi : i ∈ HDXConc.linkVerts X τ) (hj : j ∈ HDXConc.linkVerts X τ) (hij : j ≠ i) :
    linkWalk X d w τ i j = outProb X d w (insert i τ) j := 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. (71), 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