Theorem 4.1 — Polishable coset relations above every countable level
ProvedFSCofinality.coset_cofinalityFor every countable ordinal a, there are a closed subgroup G of the full permutation group of the natural numbers and a continuous injective homomorphism pi from G to that permutation group such that the product-limit Friedman--Stanley relation J_a Borel reduces to the coset relation of the image pi[G]. The image is Borel. Its Polishability is represented by the closed Polish source group and continuous injective homomorphism data; the transported group topology need not equal the ambient subspace topology. The subgroup and homomorphism may depend separately on a.
For every there are closed and continuous injective with Borel image and
import Definitions.Def_FSCofinalityHierarchy20261102 import Definitions.Def_FSCofinalityCosets20261102 set_option autoImplicit false
theorem FSCofinality.coset_cofinality
(a : Ordinal.{0}) (ha_countable : a < Ordinal.omega 1) :
∃ G : Subgroup FSCofinality.PermutationGroup,
IsClosed (G : Set FSCofinality.PermutationGroup) ∧
∃ π : G →* FSCofinality.PermutationGroup,
Continuous π ∧ Function.Injective π ∧
MeasurableSet (π.range : Set FSCofinality.PermutationGroup) ∧
(FSCofinality.fsTower a).Reduces (FSCofinality.imageCosetRelation π) := by sorry
Read-back
What the Lean code literally says, in plain math · Codex (GPT-6 family; exact runtime model identifier not exposed to auditor)
Read-back: FSCofinality.coset_cofinality
Model: Codex; exact model identifier unavailable to this agent.
For every ordinal in Lean's universe-zero ordinal type, under the sole hypothesis (where is the first uncountable ordinal), there exist a subgroup of the group of all bijections , closed as a subset of , and then a group homomorphism which is continuous and injective, whose actual algebraic image is a Borel subset of , and then a measurable function such that, for every ordered pair , holds if and only if . Here permutation multiplication is composition in the order ; carries the topology induced by into , with each copy of discrete and both function spaces given their product topologies, and its measurable sets are exactly the Borel sets of that topology; carries the inherited subspace topology. The pair , including its measurable space, is the following fixed recursive construction, rather than an unspecified relation of the same complexity: at , with its product measurable space of discrete Boolean factors and is literal equality; at a successor , consists of a distinguished code and all codes for sequences , with the measurable space pulled back along the tagging bijection to the disjoint union of a one-point measurable space and the countable product measurable space , and the relation is given by being true, being equivalent to , and the two mixed cases being false; at each nonzero limit ordinal , the definition uses one fixed classical choice of a strictly increasing sequence satisfying , sets with the dependent countable product measurable space, and declares to mean . Thus the target relation is the relation of belonging to the same left coset , with the precise convention ; it is defined on all of , not merely on , on a quotient, or on the closure of the image. The quantifier order permits , , and to depend on ; it requires no common or common for different , and makes no assertion at or above. The range condition is Borel measurability of , not closedness of ; no normality condition on or , no requirement that be the inclusion of , and no continuity or injectivity requirement on are included. There are no additional free measurable-space or topological-space parameters and no hypotheses that the graphs of the recursive relations are Borel. The allowed ordinals include , every finite ordinal, and countable nonzero limit ordinals: positivity is not assumed. The distinguished successor code supplies a separate empty code, while each sequence code has entries at every natural-number index; repetitions and reordering affect the relation only through the displayed mutual matching conditions, and a sequence code is never related to the empty code. The base space and all recursively constructed code spaces are nonempty, all pairs in them are covered by the equivalence for , and a subgroup always contains the identity; the declaration imposes no separate nontriviality or properness condition on either subgroup.
Confirmed by the mission captain (proposal self-audit).