Cslib.MachineLearning.PACLearning.map_graph_eq_one
theoremverifiedformalizationimported Lean
Under the pushforward of a probability measure P along the graph map x ↦ (x, c x), the graph of c has measure 1.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open MeasureTheory Set in open scoped ENNReal in variable {α : Type*} {β : Type*} in lemma Cslib.MachineLearning.PACLearning.map_graph_eq_one [MeasurableSpace α] [MeasurableSpace β] {c : α → β} (hcm : Measurable c) (P : Measure α) [IsProbabilityMeasure P] (hG : MeasurableSet {p : α × β | p.2 = c p.1}) : (P.map (fun x => (x, c x))) {p : α × β | p.2 = c p.1} = 1
- Formalizes
- CSLib, `Cslib.MachineLearning.PACLearning.map_graph_eq_one`
- Lean proof
- By Dhruv Gupta, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Dhruv Gupta. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.MachineLearning.PACLearning.map_graph_eq_one← Cslib.MachineLearning.PACLearning.map_graph_eq_one (Cslib/MachineLearning/PACLearning/VersionSpace.lean:235): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- Cslib.MachineLearning.PACLearning.pi_map_graph_eq_oneThe iid product of the realizable joint distribution assigns measure
1to the set of samples where every coordinate lies on the graph of…
- Cslib.MachineLearning.PACLearning.pi_map_graph_eq_oneThe iid product of the realizable joint distribution assigns measure
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen MeasureTheory Set inopen scoped ENNReal invariable {α : Type*} {β : Type*} in/-- Under the pushforward of a probability measure `P` along the graph map `x ↦ (x, c x)`, the graph of `c` has measure `1`. -/lemma Cslib.MachineLearning.PACLearning.map_graph_eq_one [MeasurableSpace α] [MeasurableSpace β] {c : α → β} (hcm : Measurable c) (P : Measure α) [IsProbabilityMeasure P] (hG : MeasurableSet {p : α × β | p.2 = c p.1}) : (P.map (fun x => (x, c x))) {p : α × β | p.2 = c p.1} = 1 := by have hφ : Measurable (fun x : α => (x, c x)) := by fun_prop rw [Measure.map_apply hφ hG] have hpre : (fun x : α => (x, c x)) ⁻¹' {p : α × β | p.2 = c p.1} = Set.univ := by ext x; simp rw [hpre, measure_univ]