Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2a (Trichotomy).

Proved
HigherQuantumLDPC.critical_simplex_homology_jump

by raver1975 · Sep 16, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogbridges

Theorem 2a (Trichotomy). Each filtration step falls into exactly one of three cases: (1) birth creating β_d, (2) death killing β_{d-1}, or (3) degenerate dim-0 non-birth with no homological effect.

theorem HigherQuantumLDPC.critical_simplex_homology_jump(s : FiltStep) :
    (s.isBirth = true ∧
      bettiDelta s s.dim = 1 ∧
      ∀ m, m ≠ s.dim → bettiDelta s m = 0)
    ∨
    (s.isBirth = false ∧ s.dim ≠ 0 ∧
      bettiDelta s (s.dim - 1) = -1 ∧
      ∀ m, m ≠ s.dim - 1 → bettiDelta s m = 0)
    ∨
    (s.isBirth = false ∧ s.dim = 0 ∧
      ∀ m, bettiDelta s m = 0) := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Bridges/NeuralCoding/HigherQuantumLDPC.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Bridges/NeuralCoding/HigherQuantumLDPC.lean
import Mathlib
import Definitions.Def_Bridges_NeuralCoding_HigherQuantumLDPC
/-
Copyright (c) 2025 Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.

# Higher-Dimensional Tropical Morse Theory for Quantum LDPC Codes

This file establishes a mathematically precise bridge between **tropical Morse
filtrations on higher-dimensional cell complexes** and the **homological parameters
of CSS quantum LDPC codes**.

## Cross-Domain Connections

1. **Tropical geometry ↔ Homological algebra**: Filtration spectra encode
   chain-complex invariants via the Euler-Poincaré consistency theorem.
2. **Homological algebra ↔ Quantum information**: Betti numbers and boundary
   maps determine CSS logical qubits.
3. **Expander theory ↔ Quantum LDPC**: Coboundary expansion constrains
   low-weight logical operators and interacts with tropical barrier bounds.
4. **Persistent homology ↔ Fault tolerance**: Long-lived homology classes
   correspond to robust encoded information.

## Main Definitions

* `FiltStep` — A single simplex attachment event with dimension and type
* `TropicalMorseRegularFiltration` — Filtration satisfying the higher Morse
  regularity condition (non-births have positive dimension)
* `CriticalSimplexStep` — A filtration step attaching exactly one critical n-simplex
* `HomologyJumpProfile` — Signed Betti number change at each filtration step
* `CSSParams` — CSS code model derived from a 2-dimensional simplicial complex
* `TropicalBarrier` — Weight threshold forcing minimum support for nontrivial cycles
* `CoboundaryExpansionModel` — Expansion condition constraining tropical births

## Main Theorems

* `euler_poincare_single_step` — Each step's Betti contribution matches Euler
* `euler_char_eq_alternating_face_sum` — Full Euler-Poincaré by induction
* `strict_dichotomy` — Under regularity, exactly one Betti number changes
* `css_logical_dim_eq_spectrum` — CSS logical dimension from tropical spectrum
* `css_distance_lower_bound` — Tropical barrier distance bound
* `expander_birth_concentration` — Expansion constrains low-weight births
* `betti_telescoping` — Betti numbers telescope over filtration steps

## Application Keywords

tropical Morse theory, simplicial homology, CSS codes, quantum LDPC,
hypergraph product codes, balanced product codes, toric code, persistent homology,
expander complexes, fault-tolerant quantum computing, homological distance bounds,
tropical filtration spectrum
-/


open Finset BigOperators

open HigherQuantumLDPC

/-! ## Section 1: Core Definitions

We model a tropical Morse filtration of a simplicial complex as a sequence
of simplex attachments. Each attachment has a weight (tropical value), a
dimension, and a type indicating whether it creates a new homology class
(birth) or kills an existing one (death). -/


/-! ## Section 2: Homological Effect of a Single Step

The central local invariant: the change in Betti number `β_n` caused by
attaching a single simplex. A birth in dimension `d` increases `β_d` by 1;
a death in dimension `d` (via a `(d+1)`-simplex) decreases `β_d` by 1. -/



/-! ## Section 3: Higher Tropical Morse Regularity

The regularity condition formalizes the requirement that filtration steps
are well-behaved: a non-birth step (death event) must involve a simplex
of positive dimension, since killing a class in `H_{d-1}` requires `d ≥ 1`.

This is the higher-dimensional analogue of the graph-level condition that
merge events involve edges (dimension 1), not vertices. -/








/-! ## Section 4: Theorem 1 — Euler-Poincaré Consistency (Single Step)

**The first key theorem.** For a regular filtration step (where non-births
have positive dimension), the alternating sum of its Betti contributions
equals its Euler contribution. This is the local version of the
Euler-Poincaré theorem.

The proof uses `rcases` on the birth/death classification and careful
arithmetic with alternating signs. -/



/-
**Theorem 1a (Euler-Poincaré single step).**
    For any regular filtration step `s` and any bound `D ≥ s.dim`, the
    alternating sum of `bettiDelta` over degrees `0..D` equals `eulerDelta s`.

    The regularity hypothesis `hreg` ensures that non-birth steps have
    positive dimension, so the death contribution `(-1)^{d-1} · (-1)`
    correctly equals `(-1)^d`.

    The proof uses `rcases` on `s.isBirth` and evaluates the sum at the
    unique nonzero term using `Finset.sum_eq_single_of_mem`.
-/

/-! ## Section 5: Theorem 1b — Euler-Poincaré (Full Filtration)

**The second key theorem.** By induction on the filtration step list,
the Euler characteristic equals the alternating sum of face counts. -/

/-
**Birth-death decomposition of face counts.**
    The number of `n`-dimensional faces equals births at `n` plus
    deaths from `n` (steps of dim `n` that are non-births).
-/

/-
**Theorem 1b (Euler-Poincaré full filtration).**
    The total Euler characteristic equals the alternating sum of face counts.

    Proof by induction on the step list. Each step contributes `(-1)^dim`
    to the Euler characteristic, and by summing over all steps grouped by
    dimension, we recover `∑_d (-1)^d · f_d`.
-/

/-! ## Section 6: Theorem 2 — Higher-Dimensional Exclusive Jump Dichotomy

**The central structural theorem.** Under the tropical Morse regularity
condition, each filtration step produces exactly one of two effects:

1. **Birth**: `β_d` increases by 1, all other Betti numbers unchanged.
2. **Death**: `β_{d-1}` decreases by 1, all other Betti numbers unchanged.

Without regularity, there is a third degenerate case (dim-0 non-birth)
where no Betti number changes. Regularity excludes this case.

This is the higher-dimensional analogue of the graph-level exclusive
dichotomy between merge and cycle events. -/
Formal statement
theorem HigherQuantumLDPC.critical_simplex_homology_jump(s : FiltStep) :
    (s.isBirth = true ∧
      bettiDelta s s.dim = 1 ∧
      ∀ m, m ≠ s.dim → bettiDelta s m = 0)
    ∨
    (s.isBirth = false ∧ s.dim ≠ 0 ∧
      bettiDelta s (s.dim - 1) = -1 ∧
      ∀ m, m ≠ s.dim - 1 → bettiDelta s m = 0)
    ∨
    (s.isBirth = false ∧ s.dim = 0 ∧
      ∀ m, bettiDelta s m = 0) := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Bridges/NeuralCoding/HigherQuantumLDPC.lean#L225

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