OAI/NumberTheory/DukePrimeDegree/Entropy/FirstReturnPartition.lean
12 declarations, 0 contain sorry, 0 declared as axioms
The actual measurable first-return partition
The positive return levels cover almost every point of the section. The exceptional nonreturning set is included with the complement of the section in the zero label, so the resulting partition is defined everywhere.
- lemma
OAI.DukePrimeDegree.exists_firstReturnLevel_of_returnline 18 - theorem
OAI.DukePrimeDegree.ae_section_mem_firstReturnLevelline 29 - def
OAI.DukePrimeDegree.firstReturnPartitionAtomline 40 - lemma
OAI.DukePrimeDegree.firstReturnPartition_coversline 44 - def
OAI.DukePrimeDegree.firstReturnPartitionCodeline 52 - lemma
OAI.DukePrimeDegree.firstReturnPartitionCode_memline 55 - lemma
OAI.DukePrimeDegree.firstReturnPartitionAtom_uniqueline 59 - lemma
OAI.DukePrimeDegree.firstReturnPartitionCode_eq_iffline 72 - lemma
OAI.DukePrimeDegree.measurable_firstReturnPartitionCodeline 80 - lemma
OAI.DukePrimeDegree.firstReturnPartitionCode_eq_of_future_sectionline 91Source documentation
Passing from section membership to the first-return code does not change equality of future itineraries (EL, paragraph 7.49).
lemma firstReturnPartitionCode_eq_of_future_section {Y : Type*} (T : Y → Y) (S : Set Y) (x y : Y) (hxy : ∀ k : ℕ, T^[k] x ∈ S ↔ T^[k] y ∈ S) : firstReturnPartitionCode T S x=firstReturnPartitionCode T S y := by … - lemma
OAI.DukePrimeDegree.firstReturnPartitionCode_future_eq_of_future_sectionline 119 - theorem
OAI.DukePrimeDegree.firstReturnPartitionCode_information_summableline 130Source documentation
The everywhere-defined return code has finite Shannon entropy.
theorem firstReturnPartitionCode_information_summable {Y : Type*} [MeasurableSpace Y] (μ : Measure Y) [IsProbabilityMeasure μ] {T : Y → Y} (hT : MeasurePreserving T μ μ) (hE : MeasurableEmbedding T) {S : Set Y} (hS : MeasurableSet S) : Summable (fun n => Real.negMulLog (μ.real {x | firstReturnPartitionCode T S x=n})) := by …