OAI/GroupTheory/PolycyclicRecognition/Geometry/RootIntervalSampling.lean
7 declarations, 0 contain sorry, 0 declared as axioms
The actual independent interval laws for the root increments
- def
OAI.PolycyclicRecognition.rootIntervalDirectionline 16Source documentation
Extend a fixed finite word by zero directions for the unused indices.
def rootIntervalDirection {m : ℕ} (letters : Fin m → I) (X : I → L) (s : I → ℝ) (r : ℝ) (j : ℕ) : L := … - def
OAI.PolycyclicRecognition.rootIntervalSampleline 20 - theorem
OAI.PolycyclicRecognition.rootIntervalSample_letterline 25 - theorem
OAI.PolycyclicRecognition.rootIntervalSample_subline 33Source documentation
Two independent interval samples differ by the single intended root increment. There is no need to retain a profile at their intermediate product.
theorem rootIntervalSample_sub (Exp : L → N) (hneg : ∀ v, Exp (-v) = (Exp v)⁻¹) (hadd : ∀ (v : L) (u t : ℝ), Exp ((u + t) • v) = Exp (u • v) * Exp (t • v)) {m : ℕ} (letters : Fin m → I) (X : I → L) (s : I → ℝ) (r : ℝ) (j : ℕ) (u t : ℝ) : rootIntervalSample Exp letters X s r j u * (rootIntervalSample Exp letters X s r j t)⁻¹ = rootIntervalSample Exp letters X s r j (u - t) := by … - def
OAI.PolycyclicRecognition.rootIntervalLawline 44 - theorem
OAI.PolycyclicRecognition.measurePreserving_rootIntervalSampleline 50Source documentation
These are pushforward laws of the original independent uniform samples.
theorem measurePreserving_rootIntervalSample [TopologicalSpace N] [BorelSpace N] (Exp : L → N) (hcont : ∀ v : L, Continuous (fun t : ℝ => Exp (t • v))) {m : ℕ} (letters : Fin m → I) (X : I → L) (s : I → ℝ) (r R : ℝ) (j : ℕ) : MeasurePreserving (rootIntervalSample Exp letters X s r j) (uniformIntervalLaw R) (rootIntervalLaw Exp letters X s r R j) := by …Mentions: OAI.PolycyclicRecognition.rootIntervalSample, OAI.PolycyclicRecognition.uniformIntervalLaw, OAI.PolycyclicRecognition.rootIntervalLaw
- theorem
OAI.PolycyclicRecognition.rootIntervalLaw_isProbabilityline 60