Samplinglib
Lean gate passed 2026-08-19T06:32:39.895922+00:00 · 7bcd37294df1
Reviewed teaching declaration · renyi-density.pointwise-derivative

hasDerivAt_renyiIntegrand

compiled Samplinglib leaf Partial explicit smoke test

The pointwise Renyi integrand p(t)^a q(t)^(1-a) has the expected product-rule derivative when p and q are differentiable and nonzero.

Plain-English statement

The pointwise Renyi integrand p(t)^a q(t)^(1-a) has the expected product-rule derivative when p and q are differentiable and nonzero.

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.

Mathematical statement

d/dt [p^a q^(1-a)] is the sum of the differentiated p-power and q-power terms shown in the Lean statement.

Intuition

This is only the pointwise calculus leaf. Differentiating a Renyi integral also needs positivity, measurability, integrability, and a dominating function.

Conditions

  • p and q have derivatives at t.
  • p(t) and q(t) are nonzero for the real-power derivative API.

Why these conditions cannot be dropped

  • Real powers have singular derivative behavior at zero for general exponents.
  • A pointwise derivative does not justify differentiation under the integral.

Proof route

  • Apply the constant real-power derivative rule to p.
  • Apply it to q with exponent 1-a.
  • Use the product derivative rule and normalize exponents.

Lean interface notes

  • HasDerivAt.rpow_const exposes the nonzero side condition.
  • The integral and ENNReal finiteness layers are separate declarations.
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 hasDerivAt_renyiIntegrand {a : ℝ} {p q : ℝ → ℝ} {t pdot qdot : ℝ}
    (hp : HasDerivAt p pdot t) (hq : HasDerivAt q qdot t)
    (hp0 : p t ≠ 0) (hq0 : q t ≠ 0) :
    HasDerivAt (fun s => renyiIntegrand a (p s) (q s))
      ((pdot * a * (p t) ^ (a - 1)) * (q t) ^ (1 - a) +
        (p t) ^ a * (qdot * (1 - a) * (q t) ^ (-a))) t := by
  have hpPow :
      HasDerivAt (fun s => p s ^ a) (pdot * a * (p t) ^ (a - 1)) t :=
    hp.rpow_const (p := a) (Or.inl hp0)
  have hqPow :
      HasDerivAt (fun s => q s ^ (1 - a))
        (qdot * (1 - a) * (q t) ^ ((1 - a) - 1)) t :=
    hq.rpow_const (p := 1 - a) (Or.inl hq0)
  change HasDerivAt ((fun s => p s ^ a) * fun s => q s ^ (1 - a))
    ((pdot * a * (p t) ^ (a - 1)) * (q t) ^ (1 - a) +
      (p t) ^ a * (qdot * (1 - a) * (q t) ^ (-a))) t
  have hexponent : (1 - a) - 1 = -a := by ring
  rw [hexponent] at hqPow
  exact hpPow.mul hqPow

end Renyi
end InformationTheory
end TechnicalLemmas
end AutoSamplingTheory
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.