Section 5 — ordinary unboundedness of the compact coset family
ProvedModNullUniversality.compact_coset_unboundednessThere are one compact metrizable abelian group , its normalized Haar probability, and a family of subgroups of such that every subgroup and coset graph is , every graph is a difference of two sets, and
where ranges over all Borel equivalence relations on standard Borel spaces. The group and entire family are fixed before the target. This is the existential form of the compact-family conclusion established in the manuscript's unnumbered Section 5 argument. It concerns the whole group, without discarding a null set.
import Definitions.Def_ModNullCompact20261109 set_option autoImplicit false
theorem ModNullUniversality.compact_coset_unboundedness :
∃ K : ModNullUniversality.CompactMetrizableHaarGroup,
ModNullUniversality.IsAbelian K ∧
∃ H : ModNullUniversality.WF → Subgroup K.Carrier,
ModNullUniversality.LowComplexityFamily K H ∧
∀ F : ModNullUniversality.StandardBorelEquivalence,
∃ T : ModNullUniversality.WF,
¬ ModNullUniversality.BorelReducible
(ModNullUniversality.CosetRelation K (H T)) F.rel := by sorry
Read-back
What the Lean code literally says, in plain math · Codex; exact runtime model identifier unavailable
Read-back author: Codex; the exact runtime model ID is unavailable. There exist a type in Lean's base type universe, a group structure on , a compact metrizable topology on for which multiplication and inversion are continuous, a measurable-space structure on equal to the Borel -algebra of that topology, and a measure on this measurable space such that , every compact subset has measure strictly less than , the pushforward of by equals for every , and every nonempty open set has nonzero measure; moreover, for every . For this single choice of all these data there exists a function assigning a subgroup of to every index in the following set : an index is a Boolean-valued function on finite lists of natural numbers, together with the property that implies for every finite list and every , and the property that there is no function for which for every . Here contains , the list at is the empty list, and both the empty tree (the constantly false predicate) and the tree consisting only of the empty list are among the indices. For every , define , using the product topology on ; both as a subset of and as a subset of are simultaneously a union indexed by of sets and an intersection indexed by of sets, where a set is an intersection of a countable family of open sets (the family may be empty, with intersection the entire ambient space) and an set is a union indexed by of closed sets. In addition, for every there are subsets such that ; no inclusion between and is stipulated, and these witnesses and all preceding complexity witnesses may depend on and on the set being represented. There is no requirement that the assignment be measurable or that different indices have different subgroups. Finally, for every type in Lean's base type universe equipped with a measurable-space structure admitting some compatible Polish topology (a second-countable topology induced by a complete metric whose Borel -algebra is the given measurable structure), and every relation on that is reflexive, symmetric, and transitive and whose graph is measurable for the product measurable structure, there exists an index such that there is no function which is measurable for the specified measurable structures and satisfies for every . The index may depend on this target space and relation, while , its structures and measure, and the whole family are chosen before the target; the equivalence condition concerns every pair of points, with no almost-everywhere qualification. The quantification over target spaces includes the empty space, for which the nonexistence of a function from the nonempty group already gives this no-reduction conclusion; all countable unions and intersections indexed by include the index and may use repeated or empty constituent sets whenever the stated open or closed conditions allow them.
Confirmed by the mission captain (proposal self-audit).