OAI/CategoryTheory/Thomason/Gray/StrictAbelianization.lean
75 declarations, 0 contain sorry, 0 declared as axioms
Identifying the strict globe with its positive chain realization
The canonical globe map is injective as well as surjective: the highest nonzero chain records the dimension and sign of its unique generator.
- abbrev
OAI.Thomason.Construction.DirectedGlobeComplex.globeDimensionline 25 - def
OAI.Thomason.Construction.DirectedGlobeComplex.globeBasisline 28 - theorem
OAI.Thomason.Construction.DirectedGlobeComplex.fromGlobe_top_tableline 34 - theorem
OAI.Thomason.Construction.DirectedGlobeComplex.fromGlobe_dimension_iffline 44 - theorem
OAI.Thomason.Construction.DirectedGlobeComplex.fromGlobe_injectiveline 62Source documentation
Distinct signed globe cells remain distinct after positive realization.
theorem fromGlobe_injective (n : ℕ) : Function.Injective (fromGlobe n).toFun := by …
Mentions: OAI.Thomason.Construction.DirectedGlobeComplex.fromGlobe
- def
OAI.Thomason.Construction.DirectedGlobeComplex.globeIsoline 93Source documentation
The strict globe and its positive-table realization are isomorphic.
def globeIso (n : ℕ) : StrictOmegaCategory.Globe.category n ≅ (complex n).realization := …
Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Globe.category, OAI.Thomason.Construction.DirectedGlobeComplex.complex
- theorem
OAI.Thomason.Construction.DirectedGlobeComplex.globeIso_homline 97 - def
OAI.Thomason.Construction.DirectedGlobeComplex.realizationHomEquivline 101Source documentation
On the free globes, taking strict realization is a full and faithful bijection of positive chain maps with actual strict functors.
def realizationHomEquiv (n : ℕ) (K : DirectedComplex.{0}) : Hom (complex n) K ≃ ((complex n).realization ⟶ K.realization) where …Mentions: OAI.Thomason.Construction.DirectedGlobeComplex.complex
- structure
OAI.Thomason.Construction.StrictOmegaCategory.Globe.Shapesline 134Source documentation
The small category of strict globe parameters and all strict maps.
structure Shapes where …
- instance
OAI.Thomason.Construction.StrictOmegaCategory.Globe.(instance at line 137)line 137 - def
OAI.Thomason.Construction.StrictOmegaCategory.Globe.inclusionline 145 - def
OAI.Thomason.Construction.DirectedGlobeComplex.chainMapline 158Source documentation
The unique positive map presenting an arbitrary strict globe map.
def chainMap {m n : ℕ} (f : StrictOmegaCategory.Globe.category m ⟶ StrictOmegaCategory.Globe.category n) : Hom (complex m) (complex n) := …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Globe.category, OAI.Thomason.Construction.DirectedGlobeComplex.complex
- theorem
OAI.Thomason.Construction.DirectedGlobeComplex.chainMap_realizationline 163 - def
OAI.Thomason.Construction.DirectedGlobeComplex.chainFunctorline 168 - def
OAI.Thomason.Construction.DirectedGlobeComplex.chainRealizationIsoline 192Source documentation
The comparison is natural for every strict map between globes.
def chainRealizationIso : chainFunctor ⋙ realizationFunctor ≅ StrictOmegaCategory.Globe.inclusion := …Mentions: OAI.Thomason.Construction.DirectedGlobeComplex.chainFunctor, OAI.Thomason.Construction.StrictOmegaCategory.Globe.inclusion
- def
OAI.Thomason.Construction.DirectedGlobeComplex.rightGlobeCylinderline 202Source documentation
The concrete signed right-cylinder functor on all strict globe maps.
def rightGlobeCylinder : StrictOmegaCategory.Globe.Shapes ⥤ StrictOmegaCategory.{0} := …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Globe.Shapes
- def
OAI.Thomason.Construction.DirectedGlobeComplex.rightGlobeEndpointline 206Source documentation
The two endpoint inclusions in the concrete globe cylinders.
def rightGlobeEndpoint (a : Bool) : StrictOmegaCategory.Globe.inclusion ⟶ rightGlobeCylinder where …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Globe.inclusion, OAI.Thomason.Construction.DirectedGlobeComplex.rightGlobeCylinder
- def
OAI.Thomason.Construction.DirectedGlobeComplex.rightGlobeProjectionline 238Source documentation
The natural collapse returns the actual strict globe.
def rightGlobeProjection : rightGlobeCylinder ⟶ StrictOmegaCategory.Globe.inclusion where …
Mentions: OAI.Thomason.Construction.DirectedGlobeComplex.rightGlobeCylinder, OAI.Thomason.Construction.StrictOmegaCategory.Globe.inclusion
- theorem
OAI.Thomason.Construction.DirectedGlobeComplex.rightGlobeEndpoint_projectionline 266 - abbrev
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.CylinderIndexline 307 - def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.zeroIndexEquivline 309 - def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.succIndexEquivline 319 - def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderCoordinatesline 337Source documentation
Coordinates are formed by the actual endpoint and mixed direct sums.
noncomputable def cylinderCoordinates : (p : ℕ) → (rightCylinder K).group p ≃+ (B.CylinderIndex p →₀ ℤ) | 0 => (AddEquiv.prodCongr (B.coordinates 0) (B.coordinates 0)).trans (Finsupp.sumFinsuppAddEquivProdFinsupp.symm.trans (Finsupp.domCongr B.zeroIndexEquiv.symm)) | p+1 => (AddEquiv.prodCongr (B.coordinates (p+1)) (AddEquiv.prodCongr (B.coordinates (p+1)) (B.coordinates p))).trans ((AddEquiv.prodCongr (AddEquiv.refl _) Finsupp.sumFinsuppAddEquivProdFinsupp.symm).trans (Finsupp.sumFinsuppAddEquivProdFinsupp.symm.trans …Mentions: OAI.Thomason.Construction.DirectedComplex.rightCylinder
- def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderCoefficientline 351 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderCoordinates_applyline 358 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinder_positive_iffline 367Source documentation
These exact coordinates characterize the actual positive tensor cone.
theorem cylinder_positive_iff (p : ℕ) (x : (rightCylinder K).group p) : x ∈ (rightCylinder K).positive p ↔ ∀ b, 0 ≤ B.cylinderCoordinates p x b := by …Mentions: OAI.Thomason.Construction.DirectedComplex.rightCylinder
- theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinder_augmentationline 397Source documentation
The ordinary tensor augmentation is the sum of all degree-zero coordinates, with neither endpoint omitted.
theorem cylinder_augmentation (x : (rightCylinder K).group 0) : (rightCylinder K).augmentation x = (B.cylinderCoordinates 0 x).sum (fun _ z => z) := by …Mentions: OAI.Thomason.Construction.DirectedComplex.rightCylinder
- def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderVectorline 407Source documentation
The basis vectors in the actual tensor coordinates.
noncomputable def cylinderVector {p : ℕ} (b : B.CylinderIndex p) : (rightCylinder K).group p := …Mentions: OAI.Thomason.Construction.DirectedComplex.rightCylinder
- theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderVector_coordinatesline 410 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.atom_dimensionline 430 - def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderAtomline 434 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderAtom_dimensionline 438 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderAtom_aboveline 444 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderAtom_topline 448 - def
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.SideHeightline 499Source documentation
The stronger side-height information used when tensoring the basis. It is supplied by the already proved signed simplex boundary order.
def SideHeight : Prop := ∀ p (b : B.Index p) q, q < p → ∀ (side : Bool) (c : B.Index q), …
- theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.atom_side_height_leline 503 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.prismSide_sourceEndpointline 517 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.prismSide_targetEndpointline 523 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.prism_endpoint_heightline 530Source documentation
The shifted rank of the endpoint selected by the prism has the exact sign of that prism side.
theorem prism_endpoint_height (p : ℕ) (b : B.Index p) (side : Bool) : RightCylinderBasis.height B.height (.endpoint (RightCylinder.prismSide p side) b) = 3 * B.height p b + if side then 1 else -1 := by …Mentions: OAI.Thomason.Construction.RightCylinderBasis.height, OAI.Thomason.Construction.DirectedComplex.RightCylinder.prismSide
- theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.endpointAtom_endpointCoefficientline 537 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.endpointAtom_mixedCoefficientline 546 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.mixedAtom_mixedCoefficientline 553 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.mixedAtom_endpointCoefficientline 560 - theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinderAtom_side_heightline 577Source documentation
Every strict lower face of an actual endpoint or prism atom has the required strict signed-height bound.
theorem cylinderAtom_side_height (hs : B.SideHeight) {p : ℕ} (b : B.CylinderIndex p) (side : Bool) (q : ℕ) (hqp : q < p) (c : B.CylinderIndex q) (hc : B.cylinderCoefficient c ((B.cylinderAtom b).table side q) ≠ 0) : if side then RightCylinderBasis.height B.height b < RightCylinderBasis.height B.height c else RightCylinderBasis.height B.height c < RightCylinderBasis.height B.height b := by …Mentions: OAI.Thomason.Construction.RightCylinderBasis.height
- theorem
OAI.Thomason.Construction.DirectedComplex.OrderedAtomBasis.cylinder_atoms_disjointline 622Source documentation
The concrete tensor atoms therefore have disjoint ordered boundaries.
theorem cylinder_atoms_disjoint (hs : B.SideHeight) {p q r : ℕ} (b : B.CylinderIndex p) (c : B.CylinderIndex q) (hrp : r < p) (hrq : r < q) (hbc : RightCylinderBasis.height B.height b ≤ RightCylinderBasis.height B.height c) (e : B.CylinderIndex r) : B.cylinderCoordinates r ((B.cylinderAtom b).table false r) e = 0 ∨ B.cylinderCoordinates r ((B.cylinderAtom c).table true r) e = 0 := by …Mentions: OAI.Thomason.Construction.RightCylinderBasis.height
- theorem
OAI.Thomason.Construction.DirectedComplex.rightCylinderMap_agree_belowline 659Source documentation
Agreement below a bound survives right tensoring with the interval.
theorem rightCylinderMap_agree_below (f g : Hom K L) {n : ℕ} (hfg : ∀ k, k < n → f.app k = g.app k) : ∀ k, k < n → (RightCylinder.map f).app k = (RightCylinder.map g).app k := by …Mentions: OAI.Thomason.Construction.DirectedComplex.Hom, OAI.Thomason.Construction.DirectedComplex.RightCylinder.map
- theorem
OAI.Thomason.Construction.DirectedComplex.rightCylinderMap_positive_degree_bridgeline 668Source documentation
The positive degree bridge transports through the actual signed right-cylinder differential.
theorem rightCylinderMap_positive_degree_bridge (f g : Hom K L) {n : ℕ} (hfg : ∀ k, k < n → f.app k = g.app k) (hbridge : ∀ v : K.group n, v ∈ K.positive n → ∃ z : L.group (n+1), z ∈ L.positive (n+1) ∧ L.differential n z = g.app n v - f.app n v) : ∀ v : (rightCylinder K).group n, v ∈ (rightCylinder K).positive n → ∃ z : (rightCylinder L).group (n+1), z ∈ (rightCylinder L).positive (n+1) ∧ (rightCylinder L).differential n z = (RightCylinder.map g).app n v - (RightCylinder.map f).app n v := by …Mentions: OAI.Thomason.Construction.DirectedComplex.Hom, OAI.Thomason.Construction.DirectedComplex.rightCylinder, OAI.Thomason.Construction.DirectedComplex.RightCylinder.map
- theorem
OAI.Thomason.Construction.DirectedComplex.rightCylinder_realization_comp_eq_of_positive_degree_bridgeline 701Source documentation
Positive bridges in the original complexes force exact equality after mapping the right-cylinder realizations into a truncated target.
theorem rightCylinder_realization_comp_eq_of_positive_degree_bridge (f g : Hom K L) {n : ℕ} (hfg : ∀ k, k < n → f.app k = g.app k) (hbridge : ∀ v : K.group n, v ∈ K.positive n → ∃ z : L.group (n+1), z ∈ L.positive (n+1) ∧ L.differential n z = g.app n v - f.app n v) {Y : StrictOmegaCategory.{u}} (hY : Y.IsTruncated n) (H : (rightCylinder L).realization ⟶ Y) : (RightCylinder.map f).realization ≫ H = (RightCylinder.map g).realization ≫ H := …Mentions: OAI.Thomason.Construction.DirectedComplex.Hom, OAI.Thomason.Construction.DirectedComplex.rightCylinder, OAI.Thomason.Construction.DirectedComplex.realization, OAI.Thomason.Construction.DirectedComplex.RightCylinder.map
- abbrev
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Boundedline 735 - abbrev
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Freeline 736 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.compositeline 738 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Relationsline 743Source documentation
The defining additive relation for one actual strict composition.
def Relations (n : ℕ) : Set (Free C n) := …
Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Free
- def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.relationsline 749 - abbrev
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Chainsline 751 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.generatorline 753 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.generator_compositeline 757Source documentation
Strict composition is addition in the constructed chain group.
theorem generator_composite {n : ℕ} (k : ℕ) (hk : k < n) (x y : Bounded C n) (h : C.target k x.val = C.source k y.val) : generator C n (composite C k hk x y h) = generator C n x + generator C n y := by …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Bounded, OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.generator, OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.composite
- theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.generator_identityline 772Source documentation
Identity extensions have zero positive-dimensional chain.
theorem generator_identity (n : ℕ) (x : C) (hx : C.DimensionLE n x) : generator C (n + 1) ⟨x, C.dimensionLE_mono (Nat.le_succ n) hx⟩ = 0 := by …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.generator
- def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.liftline 786Source documentation
The degreewise universal property, retaining every composition relation.
def lift {A : Type*} [AddCommGroup A] (n : ℕ) (f : Bounded C n → A) (hf : ∀ (k : ℕ) (hk : k < n) (x y : Bounded C n) (h : C.target k x.val = C.source k y.val), f (composite C k hk x y h) = f x + f y) : Chains C n →+ A := …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Bounded, OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.composite, OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Chains
- theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.lift_generatorline 797 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.hom_extline 802 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.faceGeneratorline 809Source documentation
A face generator is defined with its canonical dimension witness.
def faceGenerator (a : Bool) (n : ℕ) (x : C) : Chains C n := …
Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Chains
- theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.faceGenerator_compositeline 812 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.boundary_compositeline 827Source documentation
The signed boundary respects each relation in degree n+1.
theorem boundary_composite (n k : ℕ) (hk : k < n + 1) (x y : Bounded C (n + 1)) (h : C.target k x.val = C.source k y.val) : (faceGenerator C true n (composite C k hk x y h).val - faceGenerator C false n (composite C k hk x y h).val) = (faceGenerator C true n x.val - faceGenerator C false n x.val) + (faceGenerator C true n y.val - faceGenerator C false n y.val) := by …Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Bounded, OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.faceGenerator, OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.composite
- def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.differentialline 851Source documentation
Differential of lambda, defined on the quotient rather than postulated.
def differential (n : ℕ) : Chains C (n + 1) →+ Chains C n := …
Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Chains
- theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.differential_generatorline 855 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.differential_faceGeneratorline 860 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.faceGenerator_faceline 866 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.differential_squaredline 872 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.augmentationline 882 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.augmentation_generatorline 885 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.augmentation_faceGeneratorline 888 - theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.augmentation_differentialline 891 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.positiveline 901Source documentation
The positive monoid consists of sums of actual cell generators.
def positive (n : ℕ) : AddSubmonoid (Chains C n) := …
Mentions: OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.Chains
- theorem
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.generator_positiveline 904 - def
OAI.Thomason.Construction.StrictOmegaCategory.Abelianization.complexline 908Source documentation
The actual augmented directed complex associated to a strict category.
def complex : DirectedComplex.{0} where …