Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.4 — Baire measurable maps are continuous on a comeager GδG_\deltaGδ​ set

Proved
NoUniversalFSigma.lemma2_4

by username · Oct 23, 2026 · Mathlib c5ea003 (Lean v4.30.0)

arxiv-2610-31052descriptive-set-theoryequivalence-relationstopology

Let XXX be a Polish space, let YYY be a second-countable topological space, and let f:X→Yf:X\to Yf:X→Y be Baire measurable. Then there is a subset C⊆XC\subseteq XC⊆X such that

C is Gδ,X∖C is meager,f∣C:C→Y is continuous.C\text{ is }G_\delta,\qquad X\setminus C\text{ is meager},\qquad f|_C:C\to Y\text{ is continuous}.C is Gδ​,X∖C is meager,f∣C​:C→Y is continuous.

Continuity uses the subspace topology on CCC. Empty spaces are permitted. This is a preparatory category result for working with Baire measurable reductions.

Preamble
import Definitions.Def_NoUniversalFSigma261031052

set_option autoImplicit false

universe u v

/-- Lemma 2.4 of arXiv:2610.31052v1. -/
Formal statement
theorem NoUniversalFSigma.lemma2_4
    {X : Type u} {Y : Type v}
    [TopologicalSpace X] [PolishSpace X]
    [TopologicalSpace Y] [SecondCountableTopology Y]
    (f : X → Y) (hf : NoUniversalFSigma.IsBaireMeasurable f) :
    ∃ C : Set X, IsGδ C ∧ IsMeagre Cᶜ ∧ Continuous (fun x : C => f x) := by sorry
Source
Ruijun Wang, There is no universal F_sigma equivalence relation, arXiv:2610.31052v1 (22 October 2026), Lemma 2.4, Section 2.3, https://arxiv.org/html/2610.31052v1
Read-back

What the Lean code literally says, in plain math · GPT-6 (exact deployment identifier unavailable)

For any types XXX and YYY in arbitrary, possibly different universes, equip XXX with a Polish topology, meaning a separable and completely metrizable topology, and equip YYY with a second countable topology, meaning one having a countable base. For every function f:X→Yf:X\to Yf:X→Y such that for every open subset U⊆YU\subseteq YU⊆Y there is an open subset V⊆XV\subseteq XV⊆X with f−1(U)△Vf^{-1}(U)\mathbin{\triangle}Vf−1(U)△V meagre in XXX, there exists a subset C⊆XC\subseteq XC⊆X such that CCC is a GδG_\deltaGδ​ set, meaning a countable intersection of open subsets of XXX, the complement X∖CX\setminus CX∖C is meagre in XXX, and the restriction f∣C:C→Yf|_C:C\to Yf∣C​:C→Y is continuous when CCC has the subspace topology. Here △\triangle△ is symmetric difference, and a meagre set is a set contained in a countable union of nowhere dense sets. Neither XXX nor YYY is assumed nonempty, and no nonemptiness is explicitly required of CCC; if XXX is empty, C=∅C=\varnothingC=∅ meets the conclusion. The existence of the specified function excludes a nonempty XXX with an empty YYY.

Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by username · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me