Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

An integrable C² density with bounded Hessian is bounded

Statement

Let f:Rd→[0,∞) be a density version with all partial derivatives through order two existing and continuous, so ∫f dλd=1. If its Hessian satisfies H:=sup⁡x∥D2f(x)∥op<∞, then f is bounded.

Facts & Assumptions

Given: d≥1, a pointwise nonnegative C2 density version f on Rd, and a finite global Hessian bound H.

[A1]

The Axiom of Countable Choice, written ACω (The Axiom of Countable Choice (ACω)).

[F1]

A density version is Borel, nonnegative and has integral one (Density targets and the kernel density estimator).

[F2]

Assuming ACω, every box with side lengths ℓ1,…,ℓd has Lebesgue measure ∏jℓj (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included).

[F4]

The total-derivative chain rule differentiates a smooth function along an affine line (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

1.1givenF1F4F5choosealgebra

Set C=max⁡(1,H). For x∈Rd, write M=f(x) and g=∇f(x). For q(t)=f(x+ty), the chain rule [F4] gives q′(0)=g⋅y and q′′(t)=yTD2f(x+ty)y. Integration by parts and the second fundamental theorem [F5] give q(1)−q(0)−q′(0)=∫01(1−t)q′′(t)dt. Since ∣q′′(t)∣≤C∥y∥2 and ∫01(1−t)dt=1/2, this yields ∣f(x+y)−M−g⋅y∣≤C2∥y∥2, so both the upper and lower Taylor bounds with this remainder hold. Taking y=−g/C and using f≥0 yields 0≤f(x−g/C)≤M−∥g∥2/(2C); hence ∥g∥≤2CM.

2.1step 1.1A1F2algebra

If M>0, put r=18M/C. For every y with ∥y∥≤r, the corresponding lower Taylor bound and step 1.1 give f(x+y)≥M−∥g∥r−C2r2≥M(1−28−1128)≥12M. The cube Q=x+[−r/d,r/d]d lies in that ball and has measure λd(Q)=(2r/d)d=(M/(16Cd))d/2 by [A1] and [F2].

3.1step 2.1F1F3algebra∎

Monotonicity [F3] and ∫f=1 now imply 1≥∫Qf dλd≥12M(M16Cd)d/2. Thus M1+d/2≤2(16Cd)d/2 for every x with f(x)>0; points where f(x)=0 satisfy the same resulting finite bound. Therefore f is bounded.

Depends on

Used by

Dependency tree · two levels

56 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources