Lusin–Novikov — a Borel set with countable sections is a countable disjoint union of Borel graphs
ProvedLusinNovikov.exists_disjoint_injOn_fst_iUnion_eq_of_countable_sectionsLet be a Borel set whose every vertical section is countable. Then is the union of a sequence of pairwise disjoint Borel sets, each of which is a graph: if and both lie in , then (the first projection is injective on ).
Here and are standard Borel spaces (StandardBorelSpace), “Borel” means measurable for their σ-algebras, and carries the product σ-algebra. "Countable" includes finite.
Kechris states the Lusin–Novikov theorem as Theorem 18.10 (p. 123): for a Borel all of whose sections are countable, has a Borel uniformization, its projection is Borel, and is a countable union of Borel graphs. This is the last of the three claims, with the graphs in addition pairwise disjoint. The proof here does not follow Kechris: it is Shinko's argument with σ-ideals (2024), which proves that a continuous map of Polish spaces with countable fibres is injective on each of countably many Borel sets covering its domain (LusinNovikov.exists_injOn_cover_of_countable_fibers), and applies it to the projection .
import Mathlib
namespace LusinNovikov
theorem exists_disjoint_injOn_fst_iUnion_eq_of_countable_sections {X Y : Type*} [MeasurableSpace X] [StandardBorelSpace X]
[MeasurableSpace Y] [StandardBorelSpace Y]
{P : Set (X × Y)} (hP : MeasurableSet P) (hcount : ∀ x, {y | (x, y) ∈ P}.Countable) :
∃ G : ℕ → Set (X × Y), (∀ n, MeasurableSet (G n)) ∧ (∀ n, Set.InjOn Prod.fst (G n)) ∧
Pairwise (Function.onFun Disjoint G) ∧ ⋃ n, G n = P := by
sorry
end LusinNovikov