LeanMachineLearning

ProbabilityTheory.Kernel.instIsSFiniteKernelOfIsDeterministic_leanMachineLearning🔗

Instance

No docstring.

🔗theorem
ProbabilityTheory.Kernel.instIsSFiniteKernelOfIsDeterministic_leanMachineLearning.{u_1, u_2} {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] (κ : Kernel α β) [IsDeterministic κ] : IsSFiniteKernel κ
ProbabilityTheory.Kernel.instIsSFiniteKernelOfIsDeterministic_leanMachineLearning.{u_1, u_2} {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] (κ : Kernel α β) [IsDeterministic κ] : IsSFiniteKernel κ

Code

instance (κ : Kernel α β) [IsDeterministic κ] : IsSFiniteKernel κ
Proof
by
  by_contra
  have : ∀ C < ∞, ∃ a, C < (κ a) univ := by
    by_contra! h
    have : IsFiniteKernel κ := ⟨h⟩
    have : IsSFiniteKernel κ := inferInstance
    contradiction
  obtain ⟨a, ha⟩ := this 0 (by simp)
  have h := DFunLike.congr_fun κ.parallelComp_self_comp_copy a
  simp_all only [not_false_eq_true, parallelComp_of_not_isSFiniteKernel_left, zero_comp, zero_apply]
  replace h := DFunLike.congr_fun h Set.univ
  rw [comp_apply'] at h
  · simp_rw [copy_apply, Measure.dirac_apply' _ MeasurableSet.univ, indicator_univ] at h
    simp only [Measure.coe_zero, Pi.zero_apply, Pi.one_apply, MeasureTheory.lintegral_const,
      one_mul] at h
    exact ha.ne h
  exact MeasurableSet.univ

Actions: Source · Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23).

Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

Dependency graph

Nothing to draw. Its statement rests on no other declaration in this project, and names nothing from a package left unaudited — so the graph is this declaration alone. That is the answer, not a missing picture.

Audit surface: 0 project declarations, 89 external constants

✓ Proved: no sorry anywhere in its closure

This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.