Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The L² link norm controls binary-regression likelihood distances

Statement

Let G be a probability measure on (X,A), let Ψ:R→(0,1) be differentiable, and suppose L:=sup⁡u∈R∣Ψ′(u)∣<∞,R:=sup⁡u∈R∣Ψ′(u)Ψ(u)(1−Ψ(u))∣<∞. For measurable real functions w,w0, define Bernoulli densities relative to G⊗#, where # is counting measure on {0,1}, by qw(x,y)=Ψ(w(x))y(1−Ψ(w(x)))1−y,qw0(x,y)=Ψ(w0(x))y(1−Ψ(w0(x)))1−y. If w−w0∈L2(G), then, with d2(qw,qw0)2=∫∣qw−qw0∣2 d(G⊗#), d2(qw,qw0)2≤2L2∥w−w0∥L2(G)2, KL(Qw0∥Qw)≤LR2∥w−w0∥L2(G)2,EQw0 ⁣[(log⁡qw(X,Y)qw0(X,Y))2]≤R2∥w−w0∥L2(G)2.

Facts & Assumptions

Given: A probability covariate law G, a differentiable link into (0,1) with the stated bounds, and the displayed Bernoulli joint densities.

[A1]

Assume AC for the directional Kullback–Leibler convention The Axiom of Choice.

Proof

1.1F1givenalgebra

For each x, [F1] gives ∣Ψ(w(x))−Ψ(w0(x))∣≤L∣w(x)−w0(x)∣. The two values of y contribute the same squared difference to d22, so integration gives d22=2∫∣Ψ(w)−Ψ(w0)∣2dG≤2L2∥w−w0∥22.

1.2A1F1F2givenalgebra

Fix x and write u0=w0(x). The Bernoulli directional divergence at x is kx(u)=Ψ(u0)log⁡Ψ(u0)Ψ(u)+(1−Ψ(u0))log⁡1−Ψ(u0)1−Ψ(u). By [F2] and the chain rule, kx′(u)=Ψ′(u)Ψ(u)(1−Ψ(u))(Ψ(u)−Ψ(u0)). Thus ∣kx′(u)∣≤RL∣u−u0∣ by [F1], and integration from u0 to w(x) yields ∣kx(w(x))∣≤(RL/2)∣w(x)−w0(x)∣2. Integrating over G and using KL(Qw0∥Qw)=∫kx(w(x)) G(dx) proves the stated upper bound.

2.1F1F2givenalgebra∎

The derivatives in [F2] have absolute values at most R: indeed Ψ′/Ψ=(Ψ′/[Ψ(1−Ψ)])(1−Ψ) and Ψ′/(1−Ψ)=(Ψ′/[Ψ(1−Ψ)])Ψ. The mean-value theorem therefore bounds both Bernoulli log-probability ratios at x by R∣w(x)−w0(x)∣. Their squared conditional average under Y∣X=x∼Bernoulli⁡(Ψ(w0(x))) is at most R2∣w(x)−w0(x)∣2; integrating over G proves the log-square bound.

Source notes

The source derives the same comparison through the function Ψ′/[Ψ(1−Ψ)]. The proof here supplies the pointwise derivative and integration bounds, and states the joint-density L2(G⊗#) convention explicitly.

Depends on

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