Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.1 — stable finite-dimensional calibration

Proved
InfoLossLAR.WorstCase.theorem_7_1

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-analysisneumann-seriesp2o-gran-per-chapterp2o-plan-bookp2o-v1

Let VVV be a finite-dimensional real normed space, (Ω,μ)(\Omega,\mu)(Ω,μ) a probability space, YYY a real vector space, and Ψ:V→L1(μ)\Psi:V\to L^1(\mu)Ψ:V→L1(μ), M:L1(μ)→YM:L^1(\mu)\to YM:L1(μ)→Y, E:V→YE:V\to YE:V→Y linear. Suppose a linear operator A:V→VA:V\to VA:V→V satisfies

MΨ=EA,∥A−I∥V→V≤κ<1.M\Psi=EA,\qquad\|A-I\|_{V\to V}\le\kappa<1 .MΨ=EA,∥A−I∥V→V​≤κ<1.

For every τ∈V\tau\in Vτ∈V there is a unique zzz with Az=τAz=\tauAz=τ, and w=Ψzw=\Psi zw=Ψz satisfies M(w)=EτM(w)=E\tauM(w)=Eτ. For every reference z0∈Vz_0\in Vz0​∈V, ∥z−z0∥V≤∥τ−Az0∥V/(1−κ)\|z-z_0\|_V\le\|\tau-Az_0\|_V/(1-\kappa)∥z−z0​∥V​≤∥τ−Az0​∥V​/(1−κ). If the constraints include total mass and the target mass is one, then Eμw=1\mathbb E_\mu w=1Eμ​w=1.

The principle is applied twice in §§8–9 (local and joint calibration) to construct the transport of Theorem 9.9.

Differences from the source:

  • reading: "the constraints include total mass and the target mass is one" → for every linear functional mmm on YYY with m(M(w′))=Eμw′m(M(w'))=\mathbb E_\mu w'm(M(w′))=Eμ​w′ for all w′∈L1(μ)w'\in L^1(\mu)w′∈L1(μ) and m(Eτ)=1m(E\tau)=1m(Eτ)=1; reason: makes the informal phrase precise
  • encoding: AAA linear → a continuous linear map with the operator norm; reason: every linear map of a finite-dimensional normed space is continuous
Preamble
import Mathlib

set_option autoImplicit false

open MeasureTheory
Formal statement
namespace InfoLossLAR.WorstCase

/-- Theorem 7.1 (Stable finite-dimensional calibration), p. 30. `V` is a finite-dimensional real
normed space, `(Ω, μ)` a probability space, `Ψ : V → L¹(μ)` (synthesis), `M : L¹(μ) → Y`
(constraints, `Y` a real vector space) and `E : V → Y` (reference response) linear, and
`A : V → V` linear with `MΨ = EA` and `‖A − I‖ ≤ κ < 1` (operator norm). For every `τ ∈ V` there
is a unique `z` with `Az = τ`; `w = Ψz` satisfies `M(w) = Eτ`; `‖z − z_0‖ ≤ ‖τ − Az_0‖/(1 − κ)`
for every `z_0`; and if the constraints include total mass (a linear functional `m` of `Y` with
`m(M(w')) = E_μ w'` for every weight `w'`) and the target mass is one (`m(Eτ) = 1`), then
`E_μ w = 1`. -/
theorem theorem_7_1 {V Y Ω : Type*} [NormedAddCommGroup V] [NormedSpace ℝ V]
    [FiniteDimensional ℝ V] [AddCommGroup Y] [Module ℝ Y] [MeasurableSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ]
    (Ψ : V →ₗ[ℝ] Lp ℝ 1 μ) (M : Lp ℝ 1 μ →ₗ[ℝ] Y) (E : V →ₗ[ℝ] Y) (A : V →L[ℝ] V) (κ : ℝ)
    (hfac : M ∘ₗ Ψ = E ∘ₗ (A : V →ₗ[ℝ] V)) (hA : ‖A - ContinuousLinearMap.id ℝ V‖ ≤ κ)
    (hκ : κ < 1) (τ : V) :
    ∃ z : V, (A z = τ ∧ ∀ z' : V, A z' = τ → z' = z) ∧
      M (Ψ z) = E τ ∧
      (∀ z₀ : V, ‖z - z₀‖ ≤ ‖τ - A z₀‖ / (1 - κ)) ∧
      (∀ m : Y →ₗ[ℝ] ℝ, (∀ w' : Lp ℝ 1 μ, m (M w') = ∫ ω, w' ω ∂μ) → m (E τ) = 1 →
        ∫ ω, (Ψ z) ω ∂μ = 1) := by sorry

end InfoLossLAR.WorstCase
Source
Chen Qian, Information Loss Is All You Need: TC⁰ Pseudorandomness from Worst-Case Lattices, arXiv:2611.05136 (held version, sha256 2ebdfbf3…), p. 30, Theorem 7.1
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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