Theorem 1.1 — no universal equivalence relation
ProvedNoUniversalFSigma.no_universal_fsigmaFor every Polish space , there is no equivalence relation on whose graph is and which is universal under Borel reducibility for all equivalence relations on Polish spaces. Explicitly,
where ranges over Polish spaces and equivalence relations on them. A Borel reduction is a Borel measurable map preserving and reflecting equivalence. This is the final assertion of Theorem 1.1.
Formalization Note Source and target spaces range over the ordinary Lean type universe; it includes real and the standard presentations of Polish spaces.
import Definitions.Def_NoUniversalFSigma261031052 set_option autoImplicit false /-- Theorem 1.1 of arXiv:2610.31052v1, final nonuniversality assertion. -/
theorem NoUniversalFSigma.no_universal_fsigma
{Y : Type} [TopologicalSpace Y] [PolishSpace Y] :
¬ ∃ F : Setoid Y,
NoUniversalFSigma.IsFSigmaRelation F.r ∧
NoUniversalFSigma.IsUniversalFSigma F.r := by sorry
Read-back
What the Lean code literally says, in plain math · GPT-6 (exact deployment identifier unavailable)
For every type in the base type universe, equipped with a Polish topology, meaning a separable and completely metrizable topology, there does not exist an equivalence relation on satisfying both of the following conditions: its graph is a countable union of closed subsets of in the product topology; and, for every type in the base type universe equipped with a Polish topology and every equivalence relation on whose graph in is a countable union of closed sets in the product topology, there exists a function such that the inverse image of every Borel subset of is Borel in and, for all , including , holds if and only if holds. All Borel sigma algebras are generated by the specified topologies, and all countable closed unions may include empty or repeated terms. Neither nor is required to be nonempty. In particular, the universal condition includes a one-point Polish domain, so an empty target cannot meet that condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.