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.
The L² link norm controls binary-regression likelihood distances
Statement
Let be a probability measure on , let be differentiable, and suppose For measurable real functions , define Bernoulli densities relative to , where is counting measure on , by If , then, with ,
Facts & Assumptions
Given: A probability covariate law , a differentiable link into with the stated bounds, and the displayed Bernoulli joint densities.
Assume AC for the directional Kullback–Leibler convention The Axiom of Choice.
A function differentiable at is continuous at and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : differentiability gives continuity on each closed interval, and the mean-value theorem bounds increments by an intermediate derivative.
Proof
For each , [F1] gives . The two values of contribute the same squared difference to , so integration gives .
Fix and write . The Bernoulli directional divergence at is By [F2] and the chain rule, . Thus by [F1], and integration from to yields . Integrating over and using proves the stated upper bound.
The derivatives in [F2] have absolute values at most : indeed and . The mean-value theorem therefore bounds both Bernoulli log-probability ratios at by . Their squared conditional average under is at most ; integrating over proves the log-square bound.
Source notes
The source derives the same comparison through the function . The proof here supplies the pointwise derivative and integration bounds, and states the joint-density convention explicitly.
Depends on
- Kullback–Leibler divergence
- The Axiom of Choice
- The natural logarithm as the inverse of the exponential function
- Probability measures and probability spaces
- The measure with density $f$ relative to $\mu$
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- A function differentiable at $c$ is continuous at $c$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
Used by
Dependency tree · two levels
43 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
- A. W. van der Vaart and J. H. van Zanten, Rates of contraction of posterior distributions based on Gaussian process priors, §3.2, Theorem 3.2 and Lemma 3.2 (standard reference, not scraped)
- Bas J. K. Kleijn, Aad W. van der Vaart and Harry van Zanten, Lectures on Nonparametric Bayesian Statistics, Chapter 9 and §12.2 (standard reference, not scraped)