Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Homology bound for distinct split regions

Proved
Smooth4Algebra.region_homology_budget

by ryanshin · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

homologicalalgebralinearalgebra

Let d:V→Vd:V\to Vd:V→V satisfy d2=0d^2=0d2=0 in finite dimension over a field. For a finite family of vector spaces WiW_iWi​, suppose inclusions ιi:Wi→V\iota_i:W_i\to Vιi​:Wi​→V and projections pi:V→Wip_i:V\to W_ipi​:V→Wi​ satisfy piιi=idp_i\iota_i=\mathrm{id}pi​ιi​=id and piιj=0p_i\iota_j=0pi​ιj​=0 for i≠ji\ne ji=j. No spanning assumption is needed. If oio_ioi​ bounds rank⁡(dιi)\operatorname{rank}(d\iota_i)rank(dιi​) and uiu_iui​ bounds rank⁡(pid)\operatorname{rank}(p_i d)rank(pi​d), then

dim⁡H(V,d)≥∑imax⁡(0,dim⁡Wi−oi−ui).\dim H(V,d)\ge\sum_i\max(0,\dim W_i-o_i-u_i).dimH(V,d)≥i∑​max(0,dimWi​−oi​−ui​).

Regions may have internal differential entries and need not be subcomplexes. The joint estimate allows their boundary projections and homology images to be dependent.

Preamble
import Definitions.Def_Smooth4AlgebraHomology
set_option autoImplicit false
open scoped BigOperators
Formal statement
theorem Smooth4Algebra.region_homology_budget
    {K V ι : Type*} [Field K] [AddCommGroup V] [Module K V]
    [FiniteDimensional K V] [Fintype ι]
    (W : ι → Type*) [∀ i, AddCommGroup (W i)] [∀ i, Module K (W i)]
    [∀ i, FiniteDimensional K (W i)]
    (d : V →ₗ[K] V) (h_square : d.comp d = 0)
    (inc : ∀ i, W i →ₗ[K] V) (proj : ∀ i, V →ₗ[K] W i)
    (h_retract : ∀ i, (proj i).comp (inc i) = LinearMap.id)
    (h_distinct : ∀ i j, i ≠ j → (proj i).comp (inc j) = 0)
    (outgoing incoming : ι → ℕ)
    (h_outgoing : ∀ i, Module.finrank K (LinearMap.range (d.comp (inc i))) ≤ outgoing i)
    (h_incoming : ∀ i, Module.finrank K (LinearMap.range ((proj i).comp d)) ≤ incoming i) :
    (∑ i, (Module.finrank K (W i) - outgoing i - incoming i)) ≤
      Module.finrank K (Smooth4Algebra.Homology d) := by sorry
Source
Newly authored from cycle21_corner_budget_independent.md, §1 joint cycle-subspace argument; SHA-256 89aa667aee6440fe989e7664eec02f5a7a60010d1d86a77dd094bdf95ba8bdba. This is a new Lean formalization, not an existing source-project theorem split.
Read-back

What the Lean code literally says, in plain math · Codex independent blind auditor; exact model identifier unavailable

For every field KKK, every finite-dimensional KKK-vector space VVV, every finite index type ι\iotaι with a finite enumeration, and every family of finite-dimensional KKK-vector spaces (Wi)i∈ι(W_i)_{i\in\iota}(Wi​)i∈ι​, with each vector space given by an additive commutative group and a KKK-module structure, let d:V→Vd:V\to Vd:V→V be KKK-linear with d∘d=0d\circ d=0d∘d=0, and let ui:Wi→Vu_i:W_i\to Vui​:Wi​→V and pi:V→Wip_i:V\to W_ipi​:V→Wi​ be KKK-linear maps such that pi∘ui=id⁡Wip_i\circ u_i=\operatorname{id}_{W_i}pi​∘ui​=idWi​​ for every iii and pi∘uj=0p_i\circ u_j=0pi​∘uj​=0 whenever i≠ji\ne ji=j. For any functions o,t:ι→No,t:\iota\to\mathbb No,t:ι→N such that dim⁡Kim⁡(d∘ui)≤oi\dim_K\operatorname{im}(d\circ u_i)\leq o_idimK​im(d∘ui​)≤oi​ and dim⁡Kim⁡(pi∘d)≤ti\dim_K\operatorname{im}(p_i\circ d)\leq t_idimK​im(pi​∘d)≤ti​ for every iii, the inequality ∑i∈ι((dim⁡KWi−oi)−ti)≤dim⁡K(ker⁡d/(ker⁡d∩im⁡d))\sum_{i\in\iota}\bigl((\dim_K W_i-o_i)-t_i\bigr)\leq\dim_K\bigl(\ker d/(\ker d\cap\operatorname{im}d)\bigr)∑i∈ι​((dimK​Wi​−oi​)−ti​)≤dimK​(kerd/(kerd∩imd)) holds. The intersection in the quotient is viewed inside ker⁡d\ker dkerd and equals im⁡d\operatorname{im}dimd because d2=0d^2=0d2=0. Both subtractions in each summand are successive natural-number subtractions, each truncated at zero, so that summand is max⁡{dim⁡KWi−oi−ti,0}\max\{\dim_K W_i-o_i-t_i,0\}max{dimK​Wi​−oi​−ti​,0} when the expression inside the maximum is read in the integers. The spaces and the bounds may be zero, and ι\iotaι may be empty; in the empty case all indexed hypotheses are vacuous and the sum is zero.

Human review
  • Endorsed by Shuze Chen · Sep 6, 2026

  • Endorsed by ryanshin · Sep 6, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me