Samplinglib
Lean gate passed 2026-08-19T06:32:39.895922+00:00 · 7bcd37294df1
Registry leaf card · measure.gibbs-density.withDensity-integral-rewrite

integral_withDensity_inv_mul_gibbsDensityENNReal_eq_integral_inv_mul_exp_smul

compiled Samplinglib leaf Not mapped explicit smoke test

- Bochner integrals against a Gibbs `withDensity` measure rewrite to a base-measure integral weighted by the real Gibbs density. The only scalar hypothesis needed for this algebraic rewrite is `Z ≠ 0`, which keeps the `ℝ≥0∞` density `Z⁻¹ * exp(-V)` finite. Finiteness of the normalizing integral and probability-measure normalization are separate Gibbs leaves.

Plain-English statement

- Bochner integrals against a Gibbs `withDensity` measure rewrite to a base-measure integral weighted by the real Gibbs density. The only scalar hypothesis needed for this algebraic rewrite is `Z ≠ 0`, which keeps the `ℝ≥0∞` density `Z⁻¹ * exp(-V)` finite. Finiteness of the normalizing integral and probability-measure normalization are separate Gibbs leaves.

Scope guard. This card records a compiled local declaration. Its mathematical scope is exactly the Lean statement below; the Registry note and source correspondence may describe motivation but do not strengthen it.
Lean learning studio · mathematics → formal proof

Read the mathematics first, then descend into Lean

You do not need to know Lean before opening this panel. The page keeps the paper-level theorem, rigorous proof obligations, exact Lean declaration, and proof dependencies as separate layers so a first-time reader can move down one layer at a time.

BeginnerWhy this theorem exists → intuition → statement → one hand calculation. Hide proof-engineering detail.
RigorousExpose assumptions, hidden measure/limit/domain issues, proof route, and rigorous references.
Lean learnerOpen the exact declaration, proof tree/network, syntax glossary, and line-by-line explanation.

Proof architecture

Start with the tree when learning: prerequisites sit below the theorem and downstream results sit above it. Switch to the network when you want to understand where this declaration lives in the local formal library. Every mapped node is clickable.

Loading source-derived dependency evidence…

Graph rule: only dependencies found by the ASTIS source scan are drawn. Missing tactic indirection is treated as an under-approximation; the site never invents an edge just to make a prettier graph.

How to read the exact Lean declaration

Read a Lean theorem left-to-right exactly as you would unpack a mathematical sentence: name → ambient types → automatically inferred structures → explicit hypotheses → conclusion → proof. Then read the proof top-to-bottom as transformations of the current goal.

  1. NameWhat reusable mathematical fact is being created?
  2. ParametersWhich symbols are arbitrary, and which structures are inferred by typeclass search?
  3. PropositionAfter the colon, translate the Lean expression back into a paper statement.
  4. Proof actionsAfter by, ask what each tactic does to the mathematical goal—not only what syntax it uses.

Syntax used on this page

This glossary is filtered to syntax that actually occurs in the declaration above. Open a symbol only when you meet it, rather than memorizing Lean grammar in advance.

Source voice and ASTIS voice stay separate

When Samplinglib shows a short quotation from Chewi, it is labeled as a source excerpt and linked to the canonical book page. Intuition, expanded proof steps, hidden regularity assumptions, and Lean explanations are ASTIS-authored commentary. A quotation never substitutes for a formal proof, and an ASTIS explanation is never attributed to the textbook author.

Lean statement

theorem integral_withDensity_inv_mul_gibbsDensityENNReal_eq_integral_inv_mul_exp_smul
    (μ : Measure α) {V : α → ℝ} (hV : AEMeasurable V μ)
    {Z : ℝ≥0∞} (hZ0 : Z ≠ 0) (g : α → F) :
    ∫ x, g x ∂μ.withDensity (fun x => Z⁻¹ * Measure.Gibbs.gibbsDensityENNReal V x) =
      ∫ x, (Z.toReal⁻¹ * Real.exp (-V x)) • g x ∂μ := by
  let f : α → ℝ≥0∞ := fun x => Z⁻¹ * Measure.Gibbs.gibbsDensityENNReal V x
  have hf_meas : AEMeasurable f μ := by
    exact AEMeasurable.const_mul
      (Measure.Gibbs.aemeasurable_gibbsDensityENNReal μ hV) Z⁻¹
  have hf_top : ∀ᵐ x ∂μ, f x < ∞ := by
    filter_upwards with x
    have hZpos : 0 < Z := bot_lt_iff_ne_bot.mpr hZ0
    have hZinv_lt_top : Z⁻¹ < ∞ := ENNReal.inv_lt_top.mpr hZpos
    have hg_lt_top : Measure.Gibbs.gibbsDensityENNReal V x < ∞ :=
      Measure.Gibbs.gibbsDensityENNReal_lt_top V x
    exact ENNReal.mul_lt_top hZinv_lt_top hg_lt_top
  rw [integral_withDensity_eq_integral_toReal_smul₀ hf_meas hf_top]
  apply integral_congr_ae
  filter_upwards with x
  simp [f, Measure.Gibbs.gibbsDensityENNReal, ENNReal.toReal_mul, ENNReal.toReal_inv,
    ENNReal.toReal_ofReal (Real.exp_nonneg _)]

/-- Source-facing specialization of the Gibbs integral rewrite where the scalar
is the Gibbs lintegral.  The finite-normalizer proof, when needed to obtain a
probability measure, remains a separate input to the probability-measure leaf. -/

Proof architecture

Chewi MEAS/DENS/SDE root: rewrite Bochner integrals under a Gibbs withDensity measure as density-weighted base-measure integrals

Lean proof walkthrough

  • Read the quantified variables and typeclass brackets as part of the mathematical statement; inferred arguments are not missing assumptions.
  • `have` creates a named intermediate mathematical fact.
  • `rw` rewrites by an established identity.
  • `simp` normalizes through registered definitional and theorem rewrites.
  • `apply` reduces the goal to the hypotheses of a reusable theorem.
  • `exact` closes the current goal with an already typed term.
  • `filter_upwards` moves an almost-everywhere or eventual statement into a pointwise local context.

Why the statement has this shape

The declaration is kept at the reusable level recorded by its Registry tags and direct consumers. Explicit measures, spaces, wrappers, and regularity hypotheses expose interfaces that paper notation often infers. A theorem card explains those interfaces but never widens the compiled statement.

Hidden assumptions and non-claims

  • Measurability is represented explicitly or must be supplied by a dependency.
  • Almost-everywhere hypotheses depend on the stated measure and representative.
  • Density statements retain normalization and absolute-continuity prerequisites.
  • A Gibbs expression is not automatically a probability law or an invariant law.
Common pitfall. A wrapper or display identity is not a new analytic theorem merely because it has its own Lean name. Check the statement, hypotheses, and downstream consumers before interpreting its mathematical contribution.