OAI/AlgebraicTopology/Integral/Contraction.lean
18 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.FiniteIntegralContraction.rowEvalline 17 - def
OAI.FiniteIntegralContraction.rowsMapline 20 - theorem
OAI.FiniteIntegralContraction.rowsMap_applyline 23 - def
OAI.FiniteIntegralContraction.matrixMapline 30 - theorem
OAI.FiniteIntegralContraction.matrixMap_singleline 33 - theorem
OAI.FiniteIntegralContraction.map_eq_of_singleline 39 - theorem
OAI.FiniteIntegralContraction.exactnessline 47Source documentation
A checked integral contraction in degrees 0,1,2 gives both exactness and injectivity of the two-dimensional boundary.
theorem exactness [Fintype I] [Fintype J] [Fintype K] (d₁ : (J → ℤ) →ₗ[ℤ] (I → ℤ)) (d₂ : (K → ℤ) →ₗ[ℤ] (J → ℤ)) (h₀ : (I → ℤ) →ₗ[ℤ] (J → ℤ)) (h₁ : (J → ℤ) →ₗ[ℤ] (K → ℤ)) (hleft : ∀ i, h₁ (d₂ (Pi.single i 1)) = Pi.single i 1) (hmid : ∀ j, d₂ (h₁ (Pi.single j 1)) + h₀ (d₁ (Pi.single j 1)) = Pi.single j 1) : Function.Injective d₂ ∧ ∀ c, d₁ c = 0 → ∃ b, d₂ b = c := by … - theorem
OAI.FiniteIntegralContraction.rows_single_oneline 72 - theorem
OAI.FiniteIntegralContraction.rows_single_twoline 81 - theorem
OAI.FiniteIntegralContraction.certificate_bottomline 92 - theorem
OAI.FiniteIntegralContraction.certificate_leftline 100 - theorem
OAI.FiniteIntegralContraction.certificate_middleline 110 - def
OAI.FiniteIntegralContraction.sumCoordinatesline 127 - theorem
OAI.FiniteIntegralContraction.sumCoordinates_singleline 132 - def
OAI.FiniteIntegralContraction.rootCoordinatesline 135 - theorem
OAI.FiniteIntegralContraction.rootCoordinates_oneline 139 - def
OAI.FiniteIntegralContraction.correctedline 142 - theorem
OAI.FiniteIntegralContraction.middle_of_rankline 148Source documentation
A stable rank equality turns a checked split boundary and a checked bottom contraction into the full middle identity. This avoids a large redundant finite matrix certificate; no rational exactness is substituted for integer exactness.
theorem middle_of_rank (card : Fintype.card J + 1 = Fintype.card K + Fintype.card I) (root : I) (d₁ : (J → ℤ) →ₗ[ℤ] (I → ℤ)) (d₂ : (K → ℤ) →ₗ[ℤ] (J → ℤ)) (h₀ : (I → ℤ) →ₗ[ℤ] (J → ℤ)) (h₁ : (J → ℤ) →ₗ[ℤ] (K → ℤ)) (hd : ∀ t, d₁ (d₂ (Pi.single t 1)) = 0) (hb : ∀ i, d₁ (h₀ (Pi.single i 1)) = Pi.single i 1 - Pi.single root 1) (hl : ∀ t, h₁ (d₂ (Pi.single t 1)) = Pi.single t 1) : (∀ t, corrected d₁ h₀ h₁ (d₂ (Pi.single t 1)) = Pi.single t 1) ∧ (∀ j, d₂ (corrected d₁ h₀ h₁ (Pi.single j 1)) + h₀ (d₁ (Pi.single j 1)) = Pi.single j 1) := by …Mentions: OAI.FiniteIntegralContraction.corrected