OAI/Geometry/HyperbolicGroups/WalkCell.lean
14 declarations, 0 contain sorry, 0 declared as axioms
- structure
OAI.HyperbolicObstruction.PictureSwitch.WalkCellTargetline 23Source documentation
Indexed oriented steps in polygonal cells, with selected cells permitted to have arbitrary closed template walks. In the cone target these are precisely top-cone walks; all fan triangles and decoration disks are frozen. Template vertices retain their occurrence index, while
vertexis their actual image in the target one-skeleton. These are incidence definitions, not diagram or normal-form hypotheses.structure WalkCellTarget (S : Type v) (C : Type w) (W : Type z) (L : Type k) (V : Type t) (A : Type r) [AddCommMonoid A] where … - structure
OAI.HyperbolicObstruction.PictureSwitch.WalkPictureline 50 - def
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.chainline 65 - def
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.Simpleline 66 - def
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.NoBigonline 68 - def
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.Reducedline 70 - structure
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.Retainsline 76Source documentation
Retain every individual surviving step and EVERY frozen face. Only free cone steps may disappear; on frozen faces the original cyclic indexing is retained exactly, not just up to a word or a chain class.
structure Retains (Q : WalkPicture.{u} T) where … - def
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.Retains.reflline 84 - def
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.Retains.transline 87 - lemma
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.respectsline 100 - lemma
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.nonmonogonline 110 - lemma
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.free_faceline 118 - lemma
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.bigon_oppositeline 123 - theorem
OAI.HyperbolicObstruction.PictureSwitch.WalkPicture.makeSimpleline 136Source documentation
The finite splitting producer acts on template vertices, NOT quotient letter vertices. Consequently a top can never acquire a false repeated visit merely because several numerical generator labels coincide.
theorem makeSimple : ∃ Q : WalkPicture.{u} T, Nonempty (P.Retains Q) ∧ Q.Simple ∧ Q.chain = P.chain := by …