Samplinglib
Lean gate not recorded for this source state main · ed709a7f320d
Registry leaf card · semigroup-decay.forced-dissipation-from-arbitrary-time

forced_exponential_decay_of_scaled_dissipation_from

compiled Samplinglib leaf Not mapped explicit smoke test

- A forced coercive inequality gives an exponentially weighted interpolation between the initial energy and the forcing floor. The hypothesis `rate * energy ≤ scale * dissipation + forcing`, together with `energy' = -scale * dissipation`, is exactly the scalar differential inequality `energy' ≤ -rate * energy + forcing`. This form is useful when a semigroup curvature estimate contains an additive error or when a dissipative flow is driven by a bounded source.

Plain-English statement

- A forced coercive inequality gives an exponentially weighted interpolation between the initial energy and the forcing floor. The hypothesis `rate * energy ≤ scale * dissipation + forcing`, together with `energy' = -scale * dissipation`, is exactly the scalar differential inequality `energy' ≤ -rate * energy + forcing`. This form is useful when a semigroup curvature estimate contains an additive error or when a dissipative flow is driven by a bounded source.

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 forced_exponential_decay_of_scaled_dissipation_from
    {scale rate forcing : ℝ} (hrate : 0 < rate)
    (curve : DissipationCurve scale)
    (hcoercive : ∀ u : ℝ,
      rate * curve.energy u ≤ scale * curve.dissipation u + forcing)
    {s t : ℝ} (hst : s ≤ t) :
    curve.energy t ≤
      curve.energy s * Real.exp (-rate * (t - s)) +
        (forcing / rate) * (1 - Real.exp (-rate * (t - s))) := by
  have hbound : ∀ x ∈ Ico s t,
      -scale * curve.dissipation x ≤
        (-rate) * curve.energy x + forcing := by
    intro x _hx
    have hneg := neg_le_neg (hcoercive x)
    linarith
  have hgronwall :=
    le_gronwallBound_of_liminf_deriv_right_le
      (f := curve.energy)
      (f' := fun x => -scale * curve.dissipation x)
      (δ := curve.energy s)
      (K := -rate)
      (ε := forcing)
      (a := s)
      (b := t)
      curve.energy_continuous.continuousOn
      (fun x _hx r hr => by
        simpa [slope] using
          (curve.energy_hasDerivWithinAt x).liminf_right_slope_le hr)
      le_rfl
      hbound
      t
      ⟨hst, le_rfl⟩
  rw [gronwallBound] at hgronwall
  simp only [if_neg (neg_ne_zero.mpr hrate.ne')] at hgronwall
  calc
    curve.energy t ≤
        curve.energy s * Real.exp (-rate * (t - s)) +
          forcing / -rate *
            (Real.exp (-rate * (t - s)) - 1) := hgronwall
    _ = curve.energy s * Real.exp (-rate * (t - s)) +
          (forcing / rate) *
            (1 - Real.exp (-rate * (t - s))) := by
      field_simp [hrate.ne']
      ring

end

end SemigroupDecay
end FunctionalInequalities
end TechnicalLemmas
end AutoSamplingTheory

Proof architecture

turn a forced coercive energy-dissipation inequality into the exact exponential interpolation between the initial energy and forcing floor

Lean proof walkthrough

  • Read the quantified variables and typeclass brackets as part of the mathematical statement; inferred arguments are not missing assumptions.
  • `intro` introduces quantified hypotheses into the local proof context.
  • `have` creates a named intermediate mathematical fact.
  • `calc` records an equality or inequality chain matching a paper calculation.
  • `rw` rewrites by an established identity.
  • `simp` normalizes through registered definitional and theorem rewrites.
  • `simpa` closes the goal after a controlled simplification of a typed result.

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

  • A formal generator display does not establish a closed operator domain.
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.