Proof of Theorem 7.1, pp. 38–39 — on the Γ of Lemma 1.11 only countably many continuity points x of µ have card(Γ_x) ≥ k + 1
ProvedMartOT.Card.exceptional_countableLet be a measure on , twice continuously differentiable, , and assume that every affine function meets in at most points. Let have the property that Lemma 1.11 provides: for every finitely supported finite measure with ,
Then the set of continuity points of whose fibre has at least points,
is countable.
This is the core of Theorem 7.1: these countably many -null fibres can be removed from , after which every non-atom carries at most points.
Formalization Note The finitely supported are written with finite and , as in Lemma 1.11, and costs are extended-real integrals. The property of is carried as a hypothesis instead of deriving from Lemma 1.11, so , , the convex order, optimality, and Borel measurability of are not needed and are dropped; this makes the statement more general. The cardinality is taken in .
import Mathlib import Definitions.Def_MartOT_Var_Setting
namespace MartOT.Card
open MeasureTheory
/-- Proof of Theorem 7.1, pp. 38–39: if `Γ` has the conclusion property of Lemma 1.11 for the MartOT.Var.cost
`c(x, y) = h(y − x)`, then only countably many continuity points `x` of `μ` have `card(Γ_x) ≥ k + 1`. -/
theorem exceptional_countable (μ : Measure ℝ) (h : ℝ → ℝ) (hh : ContDiff ℝ 2 h) (k : ℕ)
(hk : ∀ s t : ℝ, {x : ℝ | deriv h x = s * x + t}.encard ≤ k)
(Γ : Set (ℝ × ℝ))
(hΓ : ∀ (S : Finset (ℝ × ℝ)) (w : ℝ × ℝ → NNReal), (↑S : Set (ℝ × ℝ)) ⊆ Γ →
∀ α' : Measure (ℝ × ℝ),
MartOT.Var.IsCompetitor (∑ p ∈ S, (w p : ENNReal) • Measure.dirac p) α' →
MartOT.Var.cost (fun x y => h (y - x)) (∑ p ∈ S, (w p : ENNReal) • Measure.dirac p) ≤
MartOT.Var.cost (fun x y => h (y - x)) α') :
{x : ℝ | μ {x} = 0 ∧ ((k + 1 : ℕ) : ℕ∞) ≤ {y : ℝ | (x, y) ∈ Γ}.encard}.Countable := by sorry
end MartOT.Card
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.