File size: 17,126 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 | import OAI.AlgebraicGeometry.CycleClass.Geometric.ControlledChainSupport
import OAI.AlgebraicGeometry.CycleClass.Geometric.IteratedSubdivisionHomotopy
/-! # Controlled Smallification -/
namespace OAI.AlgebraicGeometry.CycleClass.Geometric.ControlledSmallification.Cycles
noncomputable section
section
/-!
# Small-chain replacement with spatial support control
The replacement is constructed from the actual iterated barycentric
subdivision and its proved prism homotopy. The exponent may depend on the
finite chain; no uniform exponent for locally finite chains is asserted.
-/
open _root_.CategoryTheory _root_.CategoryTheory.Limits
open scoped Simplicial
set_option backward.defeqAttrib.useBackward true
set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
variable (X : TopCat.{0}) {J : Type} (U : J β Set X)
variable (hopen : β i, IsOpen (U i)) (hcover : β x : X, β i, x β U i)
include hopen hcover
/-- Every zero-chain is already small for an open cover. -/
theorem zeroChain_mem_smallImage (c : (LocalHomology.Cycles.integralSingularChains X).X 0) :
c β LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f 0).hom := by
obtain β¨N, b, hbβ© :=
SmallChainImage.Cycles.exists_subdivisionDegree_iterate_smallChain_preimage X U hopen hcover c
have hN : β M : β, (SubdivisionOperator.Cycles.subdivisionDegree X 0)^[M] c = c := by
intro M
induction M with
| zero => rfl
| succ M ih =>
simpa only [Function.iterate_succ_apply', SubdivisionNaturality.Cycles.subdivisionDegree_zero_dimension_apply] using ih
exact β¨b, hb.trans (hN N)β©
/-- A positive-degree chain with small boundary admits a small replacement
with the same boundary. The bounding correction and replacement remain in
every subspace in which the original chain is supported. -/
theorem exists_controlledSmallReplacement (n : β)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1))
(hc : (LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom) :
β (b : (SmallChainImage.Cycles.integralSmallSingularChains X U).X (n + 1))
(D : (LocalHomology.Cycles.integralSingularChains X).X (n + 2)),
c - (SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1) b =
(LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1) D β§
β A : Set X, c β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1) β
D β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 2) β§
(SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1) b β
ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1) := by
obtain β¨N, b, hbβ© :=
SmallSubdivision.Cycles.exists_subdivisionChainMap_iterate_small_preimage X U hopen hcover c
have hb' : (SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1) b =
(EventuallySmall.Cycles.iterateChainMap (SubdivisionBoundary.Cycles.subdivisionChainMap X) N).f (n + 1) c := by
rw [EventuallySmall.Cycles.iterateChainMap_apply]
exact hb
obtain β¨a, haβ© := IteratedSubdivisionHomotopy.Cycles.subdivisionPrism_preserves_smallChainImage X U N n hc
have hsum : (SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1) (b + a) =
(EventuallySmall.Cycles.iterateChainMap (SubdivisionBoundary.Cycles.subdivisionChainMap X) N).f (n + 1) c +
IteratedSubdivisionHomotopy.Cycles.subdivisionPrism X N n ((LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c) := by
rw [map_add, hb', ha]
have hbound : c - (SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1) (b + a) =
(LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1)
(IteratedSubdivisionHomotopy.Cycles.subdivisionPrism X N (n + 1) c) := by
rw [hsum]
exact IteratedSubdivisionHomotopy.Cycles.subdivisionPrism_boundary_correction X N n c
refine β¨b + a, IteratedSubdivisionHomotopy.Cycles.subdivisionPrism X N (n + 1) c, hbound, ?_β©
intro A hA
have hD := IteratedSubdivisionHomotopy.Cycles.subdivisionPrism_preserves_subspaceImage X A N (n + 1) hA
refine β¨hD, ?_β©
have hreplace : (SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1) (b + a) =
c - (LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1)
(IteratedSubdivisionHomotopy.Cycles.subdivisionPrism X N (n + 1) c) := by
rw [β hbound]
abel
rw [hreplace]
exact (ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1)).sub_mem hA
(ControlledChainSupport.Cycles.singularSubspaceImage_boundary X A (n + 2) (n + 1) hD)
/-- A useful equivalent form chooses only the support-controlled bounding
correction; the corrected chain lies in the actual small-chain image. -/
theorem exists_controlledSmallCorrection (n : β)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1))
(hc : (LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom) :
β D : (LocalHomology.Cycles.integralSingularChains X).X (n + 2),
c - (LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1) D β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1)).hom β§
β A : Set X, c β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1) β
D β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 2) := by
obtain β¨b, D, hb, hDβ© := exists_controlledSmallReplacement X U hopen hcover n c hc
refine β¨D, β¨b, ?_β©, fun A hA => (hD A hA).1β©
rw [β hb]
abel
/-- A chosen bounding correction with the proved simultaneous support control. -/
def controlledSmallCorrection (n : β)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1))
(hc : (LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom) :
(LocalHomology.Cycles.integralSingularChains X).X (n + 2) :=
Classical.choose (exists_controlledSmallCorrection X U hopen hcover n c hc)
theorem controlledSmallCorrection_small (n : β)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1))
(hc : (LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom) :
c - (LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1)
(controlledSmallCorrection X U hopen hcover n c hc) β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1)).hom :=
(Classical.choose_spec (exists_controlledSmallCorrection X U hopen hcover n c hc)).1
theorem controlledSmallCorrection_subspace (n : β)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1))
(hc : (LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom)
(A : Set X) (hA : c β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1)) :
controlledSmallCorrection X U hopen hcover n c hc β
ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 2) :=
(Classical.choose_spec (exists_controlledSmallCorrection X U hopen hcover n c hc)).2 A hA
end
/-!
# Recursive support-controlled corrections on singular chains
In each degree a separate finite subdivision is chosen for each singular
simplex. The resulting generator values extend linearly. The induction keeps
the boundary correction small and preserves every actual subspace image.
-/
open _root_.CategoryTheory _root_.CategoryTheory.Limits
open scoped Simplicial
set_option backward.defeqAttrib.useBackward true
set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
/-- The proved induction invariant for a degree-raising correction. -/
structure ControlledSmallificationStage (X : TopCat.{0}) {J : Type}
(U : J β Set X) (n : β) where
hom : (LocalHomology.Cycles.integralSingularChains X).X n ββ[β€] (LocalHomology.Cycles.integralSingularChains X).X (n + 1)
preserves_subspace : β (A : Set X) (c : (LocalHomology.Cycles.integralSingularChains X).X n),
c β ControlledChainSupport.Cycles.singularSubspaceImage X A n β hom c β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1)
boundary_small : β c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1),
(LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c -
(LocalHomology.Cycles.integralSingularChains X).d (n + 1) n
(hom ((LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c)) β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom
variable (X : TopCat.{0}) {J : Type} (U : J β Set X)
variable (hopen : β i, IsOpen (U i)) (hcover : β x : X, β i, x β U i)
/-- The zero-degree correction is zero because all zero-chains are small. -/
def controlledSmallificationBase : ControlledSmallificationStage X U 0 where
hom := 0
preserves_subspace A _ _ := (ControlledChainSupport.Cycles.singularSubspaceImage X A 1).zero_mem
boundary_small c := by
simpa only [LinearMap.zero_apply, map_zero, sub_zero] using
zeroChain_mem_smallImage X U hopen hcover ((LocalHomology.Cycles.integralSingularChains X).d 1 0 c)
/-- Remove the previously constructed correction to the boundary of a simplex. -/
def correctedSingularSimplex {n : β} (p : ControlledSmallificationStage X U n)
(Ο : (TopCat.toSSet.obj X).obj (.op β¦n + 1β¦)) :
(LocalHomology.Cycles.integralSingularChains X).X (n + 1) :=
let g : (LocalHomology.Cycles.integralSingularChains X).X (n + 1) :=
(TopCat.toSSet.obj X).ΞΉChainComplex (R := ModuleCat.of β€ β€) Ο 1
g - p.hom ((LocalHomology.Cycles.integralSingularChains X).d (n + 1) n g)
theorem correctedSingularSimplex_boundary_small {n : β}
(p : ControlledSmallificationStage X U n)
(Ο : (TopCat.toSSet.obj X).obj (.op β¦n + 1β¦)) :
(LocalHomology.Cycles.integralSingularChains X).d (n + 1) n (correctedSingularSimplex X U p Ο) β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f n).hom := by
unfold correctedSingularSimplex
rw [map_sub]
exact p.boundary_small _
theorem correctedSingularSimplex_subspace {n : β}
(p : ControlledSmallificationStage X U n)
(Ο : (TopCat.toSSet.obj X).obj (.op β¦n + 1β¦)) :
correctedSingularSimplex X U p Ο β ControlledChainSupport.Cycles.singularSubspaceImage X
(Set.range (X.toSSetObjEquiv (.op β¦n + 1β¦) Ο)) (n + 1) := by
let A := Set.range (X.toSSetObjEquiv (.op β¦n + 1β¦) Ο)
have hΟ := ControlledChainSupport.Cycles.singularSimplex_mem_subspaceImage X A (n + 1) Ο Set.Subset.rfl (1 : β€)
exact (ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1)).sub_mem hΟ
(p.preserves_subspace A _ (ControlledChainSupport.Cycles.singularSubspaceImage_boundary X A (n + 1) n hΟ))
/-- Choose the proved finite correction independently on each simplex. -/
def nextSmallificationGenerator {n : β} (p : ControlledSmallificationStage X U n)
(Ο : (TopCat.toSSet.obj X).obj (.op β¦n + 1β¦)) :
(LocalHomology.Cycles.integralSingularChains X).X (n + 2) :=
controlledSmallCorrection X U hopen hcover n (correctedSingularSimplex X U p Ο)
(correctedSingularSimplex_boundary_small X U p Ο)
theorem nextSmallificationGenerator_subspace {n : β}
(p : ControlledSmallificationStage X U n)
(Ο : (TopCat.toSSet.obj X).obj (.op β¦n + 1β¦)) :
nextSmallificationGenerator X U hopen hcover p Ο β ControlledChainSupport.Cycles.singularSubspaceImage X
(Set.range (X.toSSetObjEquiv (.op β¦n + 1β¦) Ο)) (n + 2) :=
controlledSmallCorrection_subspace X U hopen hcover n _ _ _
(correctedSingularSimplex_subspace X U p Ο)
/-- Linear extension of the independently chosen, support-controlled simplex corrections. -/
def nextSmallificationHom {n : β} (p : ControlledSmallificationStage X U n) :
(LocalHomology.Cycles.integralSingularChains X).X (n + 1) ββ[β€] (LocalHomology.Cycles.integralSingularChains X).X (n + 2) :=
ControlledChainSupport.Cycles.singularLinearExtension X (n + 1) ((LocalHomology.Cycles.integralSingularChains X).X (n + 2))
(nextSmallificationGenerator X U hopen hcover p)
/-- The new correction makes the entire residual small, by linear extension
of the proved correction identity on actual simplex generators. -/
theorem nextSmallificationHom_small {n : β} (p : ControlledSmallificationStage X U n)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1)) :
c - p.hom ((LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c) -
(LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1)
(nextSmallificationHom X U hopen hcover p c) β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1)).hom := by
let F : (LocalHomology.Cycles.integralSingularChains X).X (n + 1) ββ[β€]
(LocalHomology.Cycles.integralSingularChains X).X (n + 1) :=
LinearMap.id - p.hom.comp ((LocalHomology.Cycles.integralSingularChains X).d (n + 1) n).hom -
((LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1)).hom.comp
(nextSmallificationHom X U hopen hcover p)
apply ControlledChainSupport.Cycles.singularLinearMap_mem_one X (n + 1) ((LocalHomology.Cycles.integralSingularChains X).X (n + 1))
(LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1)).hom) F _ c
intro Ο
dsimp only [F, LinearMap.sub_apply, LinearMap.id_apply, LinearMap.comp_apply]
rw [nextSmallificationHom, ControlledChainSupport.Cycles.singularLinearExtension_simplex, one_zsmul]
exact controlledSmallCorrection_small X U hopen hcover n
(correctedSingularSimplex X U p Ο) (correctedSingularSimplex_boundary_small X U p Ο)
/-- The induction step proves, rather than assumes, the next invariant. -/
def controlledSmallificationStep {n : β} (p : ControlledSmallificationStage X U n) :
ControlledSmallificationStage X U (n + 1) where
hom := nextSmallificationHom X U hopen hcover p
preserves_subspace A c hc :=
ControlledChainSupport.Cycles.singularLinearExtension_subspace X (n + 1) (n + 2)
(nextSmallificationGenerator X U hopen hcover p)
(nextSmallificationGenerator_subspace X U hopen hcover p) A hc
boundary_small c := by
have h := nextSmallificationHom_small X U hopen hcover p
((LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1) c)
have hdd : (LocalHomology.Cycles.integralSingularChains X).d (n + 1) n
((LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1) c) = 0 :=
ConcreteCategory.congr_hom ((LocalHomology.Cycles.integralSingularChains X).d_comp_d (n + 2) (n + 1) n) c
simpa only [hdd, map_zero, sub_zero] using h
/-- The actual sequence of proved correction stages in all chain degrees. -/
def controlledSmallificationStages (n : β) : ControlledSmallificationStage X U n :=
Nat.rec (motive := fun k => ControlledSmallificationStage X U k)
(controlledSmallificationBase X U hopen hcover)
(fun _ p => controlledSmallificationStep X U hopen hcover p) n
/-- The degree-raising correction constructed on actual singular chains. -/
def smallificationHomotopyDegree (n : β) :
(LocalHomology.Cycles.integralSingularChains X).X n ββ[β€] (LocalHomology.Cycles.integralSingularChains X).X (n + 1) :=
(controlledSmallificationStages X U hopen hcover n).hom
theorem smallificationHomotopyDegree_subspace (n : β) (A : Set X)
(c : (LocalHomology.Cycles.integralSingularChains X).X n) (hc : c β ControlledChainSupport.Cycles.singularSubspaceImage X A n) :
smallificationHomotopyDegree X U hopen hcover n c β ControlledChainSupport.Cycles.singularSubspaceImage X A (n + 1) :=
(controlledSmallificationStages X U hopen hcover n).preserves_subspace A c hc
@[simp]
theorem smallificationHomotopyDegree_zero :
smallificationHomotopyDegree X U hopen hcover 0 = 0 := rfl
/-- In every positive degree the constructed homotopy leaves a small residual. -/
theorem smallificationHomotopyDegree_residual_small (n : β)
(c : (LocalHomology.Cycles.integralSingularChains X).X (n + 1)) :
c - smallificationHomotopyDegree X U hopen hcover n
((LocalHomology.Cycles.integralSingularChains X).d (n + 1) n c) -
(LocalHomology.Cycles.integralSingularChains X).d (n + 2) (n + 1)
(smallificationHomotopyDegree X U hopen hcover (n + 1) c) β
LinearMap.range ((SmallChainImage.Cycles.smallIntegralChainInclusion X U).f (n + 1)).hom :=
nextSmallificationHom_small X U hopen hcover
(controlledSmallificationStages X U hopen hcover n) c
end
end OAI.AlgebraicGeometry.CycleClass.Geometric.ControlledSmallification.Cycles
|