Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Geometry_ToricCode_Homology

Definition
Geometry_ToricCode_Homology

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

aether-cataloggeometry

Definition bundle for the Aether Catalog module Geometry.ToricCode.Homology, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.

Definition code
-- Def bundle generated from Geometry/ToricCode/Homology.lean by skeleton subtraction
import Mathlib
import Definitions.Def_Geometry_ToricCode_Basic
/-!
# First homology of the square torus: rank exactly two

We compute `dim_{𝔽₂} H₁ = dim ker d₁ - dim im d₂ = 2` for the `M × N` square
torus, for *every* `M, N ≥ 1`.

The computation avoids any explicit basis of the cycle space.  Instead:

* the kernel of the coboundary `d₁ᵀ` is the line of constant `0`-cochains
  (`ker_d1T`), because the vertex graph of the torus is connected;
* the kernel of `d₂` is the line of constant `2`-chains (`ker_d2`), because the
  dual graph is connected;
* hence `rank d₁ᵀ = MN - 1`, and `rank d₁ = rank d₁ᵀ` by the row-rank/column-rank
  theorem, so `dim ker d₁ = 2MN - (MN - 1) = MN + 1`;
* and `dim im d₂ = MN - 1`;
* subtracting gives `2`.
-/

open Matrix

namespace ToricCode

variable (M N : ℕ) [NeZero M] [NeZero N]

/-- The `𝔽₂`-space of cellular one-cycles. -/
noncomputable def cycles : Submodule F2 (Edge M N → F2) := LinearMap.ker (d1 M N).mulVecLin

/-- The `𝔽₂`-space of cellular one-boundaries. -/
noncomputable def boundaries : Submodule F2 (Edge M N → F2) := LinearMap.range (d2 M N).mulVecLin


/-- First Betti number over `𝔽₂`. -/
noncomputable def homologyRank : ℕ :=
  Module.finrank F2 (cycles M N) - Module.finrank F2 (boundaries M N)

/-! ### The two connectivity lemmas -/



/-! ### Rank computations -/










end ToricCode

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