OAI/GroupTheory/PolycyclicRecognition/Analysis/ConeProbeEndpoints.lean
6 declarations, 0 contain sorry, 0 declared as axioms
The three actual endpoints used in the cone offset comparison
- def
OAI.PolycyclicRecognition.coneProbeFirstline 16Source documentation
The endpoint carrying both the ideal probe and its quotient section.
def coneProbeFirst (S : MulAut N) (n i s : N) : N := n * S (i * s)
- def
OAI.PolycyclicRecognition.coneProbeSecondline 19Source documentation
The neighboring endpoint carrying the same ideal probe.
def coneProbeSecond (S : MulAut N) (n i k : N) : N := n * S i * S k
- theorem
OAI.PolycyclicRecognition.coneProbe_bridgeline 22Source documentation
The bridge is independent of the ideal probe.
theorem coneProbe_bridge (S : MulAut N) (n i s k : N) : (coneProbeFirst S n i s)⁻¹ * coneProbeSecond S n i k = S (s⁻¹ * k) := by …Mentions: OAI.PolycyclicRecognition.coneProbeFirst, OAI.PolycyclicRecognition.coneProbeSecond
- theorem
OAI.PolycyclicRecognition.coneProbe_anchor_incrementline 28Source documentation
The path from the neighboring sheet to a tile anchor is the reverse conjugate of that anchor.
theorem coneProbe_anchor_increment (S : MulAut N) (n a k : N) : (n * S k)⁻¹ * coneProbeSecond S n a k = S (k⁻¹ * a * k) := by … - theorem
OAI.PolycyclicRecognition.coneProbe_tile_incrementline 34Source documentation
Within one tile the second-sheet increment is exactly its conjugated ideal coordinate.
theorem coneProbe_tile_increment (S : MulAut N) (n a i k : N) : (coneProbeSecond S n a k)⁻¹ * coneProbeSecond S n i k = S (k⁻¹ * a⁻¹ * i * k) := by … - theorem
OAI.PolycyclicRecognition.coneProbe_tile_increment_memline 41Source documentation
The covering inclusion gives the required small ideal increment without a condition on the quotient-section coordinate.
theorem coneProbe_tile_increment_mem (S : MulAut N) (n a i k : N) (B : Set N) (hi : i ∈ (fun z => a * k * z * k⁻¹) '' B) : (coneProbeSecond S n a k)⁻¹ * coneProbeSecond S n i k ∈ S '' B := by …