Theorem 1.1 — an linear-subspace obstruction for every target
ProvedNoUniversalFSigma.theorem1_1Let be any Polish space and let be any equivalence relation on whose graph is . There is a real linear subspace such that is , its coset equivalence relation has an graph, and
The norm topology is used on real . The subspace is not required to be closed or Polish. Empty target spaces are included, and the target space may lie in any Lean universe. This is the full existence assertion of Theorem 1.1; the separate nonuniversality target records its concluding consequence.
import Definitions.Def_NoUniversalFSigma261031052 set_option autoImplicit false universe u /-- Theorem 1.1 of arXiv:2610.31052v1, main existence assertion. -/
theorem NoUniversalFSigma.theorem1_1
{Y : Type u} [TopologicalSpace Y] [PolishSpace Y]
(F : Setoid Y) (hF : NoUniversalFSigma.IsFSigmaRelation F.r) :
∃ H : Submodule ℝ NoUniversalFSigma.RealL2,
NoUniversalFSigma.IsFSigma (H : Set NoUniversalFSigma.RealL2) ∧
NoUniversalFSigma.IsFSigmaRelation (NoUniversalFSigma.CosetRelation H) ∧
¬ ∃ f : NoUniversalFSigma.RealL2 → Y,
NoUniversalFSigma.IsBaireMeasurable f ∧
NoUniversalFSigma.IsReduction f (NoUniversalFSigma.CosetRelation H) F.r := by sorry
Read-back
What the Lean code literally says, in plain math · GPT-6 (exact deployment identifier unavailable)
For any type in an arbitrary universe, equipped with a Polish topology, meaning a separable and completely metrizable topology, and any specified equivalence relation on , assume that the graph is a countable union of closed subsets of with its product topology. Then there exists a real linear subspace of , the space of real sequences indexed by the natural numbers including whose squares have finite sum, such that is a countable union of closed subsets of in its usual norm topology, the graph is a countable union of closed subsets of in the product topology, and there is no function satisfying both of the following conditions: for every open subset , there is an open subset whose symmetric difference with is meagre in the norm topology; and for every , including , holds if and only if holds. A meagre set here means a set contained in a countable union of nowhere dense sets. The subspace quantifier imposes no additional topological closedness or dimension condition on . The hypotheses permit an empty ; in that case the nonexistence clause holds because contains the zero sequence and no function from it to the empty set exists.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.