Theorem 1 — no Borel upper bound for all equivalence relations
ProvedNoBorelUpperBoundFSigma.theorem1For every Polish space Y, there is no equivalence relation F on Y such that its graph is Borel and every equivalence relation E with an F-sigma graph on every Polish space X Borel reduces to F. Explicitly, there is no such F for which every pair admits a Borel map satisfying for all source pairs. The target graph may have arbitrary Borel complexity; no F-sigma hypothesis is imposed on it. The source spaces are not required to be compact or sigma-compact.
Formalization note. Polish sources range over the ordinary Lean type universe, containing the standard presentations of all Polish spaces; the target universe is arbitrary. Empty spaces are permitted. Borel measurability and graph Borelness use the specified topologies.
import Definitions.Def_NoBorelUpperBound20261101 set_option autoImplicit false universe u
theorem NoBorelUpperBoundFSigma.theorem1
{Y : Type u} [TopologicalSpace Y] [PolishSpace Y] :
¬ ∃ F : Setoid Y,
NoBorelUpperBoundFSigma.IsBorelRelation F.r ∧
NoBorelUpperBoundFSigma.IsFSigmaUpperBound F.r := by sorry
Read-back
What the Lean code literally says, in plain math · GPT-6 (Codex; exact runtime model identifier unavailable)
For every universe level and every type at that level, equipped with a topology for which is a Polish space, there does not exist an equivalence relation on (a binary relation that is reflexive, symmetric, and transitive) satisfying both of the following properties: its graph is a Borel subset of with the product topology; and, for every type in universe level , every topology on for which is Polish, and every equivalence relation on , if there is a sequence of closed subsets of such that , then there exists a function such that the inverse image under of every Borel subset of is a Borel subset of , using the Borel sigma algebras generated by their specified topologies, and such that for all , holds if and only if holds. Neither nor is assumed nonempty, so the quantifiers include empty Polish spaces; the closed-set sequence is indexed by all natural numbers, including , and its members may be empty or repeated. The reduction function is not required to be injective or surjective.
Confirmed by the mission captain (proposal self-audit).