OAI/NumberTheory/DukePrimeDegree/Geometry/QuotientSeparatingCuts.lean
8 declarations, 0 contain sorry, 0 declared as axioms
Countable separating distance cuts on the lattice quotient
Distance cuts can be chosen in every rational interval. Together with a countable dense set of centers they separate points. Their finite prefixes therefore generate the Borel sigma algebra, while the good-cut construction keeps every finite future itinerary locally constant along upper roots.
- abbrev
OAI.DukePrimeDegree.RationalCutIntervalline 20 - abbrev
OAI.DukePrimeDegree.QuotientCutIndexline 21 - instance
OAI.DukePrimeDegree.(instance at line 23)line 23 - def
OAI.DukePrimeDegree.quotientCutBitline 25 - lemma
OAI.DukePrimeDegree.quotientCutBit_measurableline 29 - theorem
OAI.DukePrimeDegree.quotientCutBit_injectiveline 39 - theorem
OAI.DukePrimeDegree.quotientCutBit_measurableEmbeddingline 74 - theorem
OAI.DukePrimeDegree.exists_good_quotient_cutsline 80