Alphabeta Math
Pipeline-generated
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.

✓ 6 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Generalized linear models and Fisher scoring — Examples

1 · Prerequisites

2 · Summary

These finite examples calculate Bernoulli-logit and Poisson-log updates, show complete logistic separation without a finite maximizer, compare a mean-matched overdispersed count law with Poisson variance, and inspect identity-link and rank-deficient-information boundaries. Each calculation checks only its stated model and does not supply a generic convergence, inferential, or goodness-of-fit guarantee.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A one-observation Bernoulli-logit Fisher-scoring step

Example

Take n=p=1, x1=1, y1=1, and current value β=0. Use a Bernoulli response with canonical logit link, a(ϕ)=1, and b(η)=log⁡(1+eη).

Facts & Assumptions

Given: The scalar design X=[1], response y1=1, current β=0, and the Bernoulli-logit family and link in the Example.

[F1]

Generalized linear model with explicit conditioning: the canonical link is g=τ, equivalently θi=ηi.

[F2]

Canonical-link score and Hessian: under a common scale the score is XT(y−μ)/a(ϕ).

[F3]

General-link score and Fisher information: the expected score outer-product information has weights wi=μ˙i2/(a(ϕ)Vi).

[F4]

One minimum-norm IRLS step: the working response and weights are zi=ηi+(yi−μi)/μ˙i and wi=μ˙i2/(a(ϕ)Vi).

[F5]

IRLS equals the Fisher-scoring step when information is invertible: when information is invertible, βnew=β+I(β)−1U(β).

[F6]

The Bernoulli-logit component mass on {0,1} relative to counting measure is f(y;η)=exp⁡{yη−log⁡(1+eη)}. It sums to one; its support is fixed, its second moment is finite, and its first two η derivatives are bounded on the finite support. (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and (exp⁡)′=exp⁡, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)

Verification

1.1F1F2F3F6algebra

For the Bernoulli cumulant, b′(0)=1/2 and b′′(0)=1/4, so μ1=1/2, V1=1/4, and μ˙1=μ1(1−μ1)=1/4. By [F1] the natural and linear predictors are both zero; [F2] gives U=1−1/2=1/2, and [F3] gives I=w=1/4.

2.1F2F3F4F5F6step 1.1algebra∎

By [F4], z1=0+(1−1/2)/(1/4)=2. The weighted least-squares objective is (1/4)(2−γ)2, whose unique minimizer is γ=2. By [F5], the Fisher-scoring update is 0+(1/4)−1(1/2)=2, the same value.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A one-observation Poisson-log Fisher-scoring step

Example

Take n=p=1, x1=1, y1=2, and current value β=0. Use a Poisson response with canonical log link, a(ϕ)=1, b(η)=eη, and c(y,ϕ)=−log⁡(y!).

Facts & Assumptions

Given: The scalar design X=[1], response y1=2, current β=0, and the Poisson-log family and link in the Example.

[F1]

Generalized linear model with explicit conditioning: the canonical link is g=τ, equivalently θi=ηi.

[F2]

Mean and variance from the cumulant function: the response mean is b′(θi) and its variance is a(ϕ)b′′(θi).

[F3]

General-link score and Fisher information: the expected score outer-product information has weights wi=μ˙i2/(a(ϕ)Vi).

[F4]

One minimum-norm IRLS step: the working response and weights are zi=ηi+(yi−μi)/μ˙i and wi=μ˙i2/(a(ϕ)Vi).

[F5]

IRLS equals the Fisher-scoring step when information is invertible: when information is invertible, βnew=β+I(β)−1U(β).

[F6]

The Poisson response has support N0, counting base measure, and f(k;θ)=e−eθekθ/k!. The exponential series and addition formula normalize the masses. Its first two θ derivatives are f(k−eθ) and f{(k−eθ)2−eθ}. On any compact interval [u,v] these are bounded by the summable sequence evk{1+(k+ev)2+ev}/k!; the ratio test gives summability. Reindexing gives E[Y2]=λ2+λ<∞ for λ=eθ. Thus the fixed-support, finite-moment and derivative-envelope hypotheses hold, and the component score has finite second moment. (The real exponential function and the number e by a power series, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y), The factorial n! and the falling factorial nk‾, defined by recursion in N, The exponential function is smooth and (exp⁡)′=exp⁡)

Verification

1.1F1F2F3F6algebra

Here b′(0)=b′′(0)=1, so μ1=V1=μ˙1=1. By [F1] the natural parameter is θ1=0. The score is y1−μ1=1, and [F3] gives I=w1=1.

2.1F3F4F5F6step 1.1algebra∎

By [F4], z1=0+(2−1)/1=1. The weighted least-squares objective is (1−γ)2, minimized uniquely at γ=1. By [F5], the Fisher-scoring update is 0+1−1⋅1=1, agreeing with IRLS.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Complete separation prevents a finite logistic MLE

Example

Let n=2, p=1, x1=−1, x2=1, and responses (y1,y2)=(0,1). Use independent Bernoulli responses with canonical logit link and parameter domain Θ=R. The two observations are completely separated by the sign of xi. Here a finite maximum-likelihood estimate means a finite β attaining the supremum of the log likelihood.

Facts & Assumptions

Given: The design column X=(−1,1)T, responses (0,1), the Bernoulli cumulant b(η)=log⁡(1+eη), and β∈R.

[F1]

Generalized linear model with explicit conditioning: the canonical link is the choice g=τ, equivalently θi=ηi.

[F2]

Canonical-link score and Hessian: the canonical score is XT(y−μ) when a(ϕ)=1.

[F3]

Strict concavity and uniqueness of a finite stationary maximizer: positive b′′ and full column rank imply strict concavity, but the conclusion does not assert existence of a finite maximizer.

[F4]

The Bernoulli-logit component mass on {0,1} relative to counting measure is f(y;η)=exp⁡{yη−log⁡(1+eη)}. It sums to one; the support is fixed, the response is bounded, and its first two η derivatives are locally bounded because f′=f(y−p) and f′′=f{(y−p)2−p(1−p)} with p=eη/(1+eη). (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and (exp⁡)′=exp⁡, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)

Verification

1.1F3F4givenalgebra

The column X=(−1,1)T has rank one, and b′′(η)=eη/(1+eη)2>0 for every finite η. Thus [F3] applies and the log likelihood is strictly concave on R.

1.2F1F2F4algebra

By [F1], ℓ(β)=−b(−β)+β−b(β)=−2log⁡(1+e−β). The score formula [F2] gives ℓ′(β)=2/(1+eβ)>0 at every finite β.

2.1step 1.2algebra∎

The log likelihood is strictly negative for every finite β, while ℓ(β)→0 as β→+∞. Hence its supremum is 0 and is not attained at any finite parameter: this separated logistic model has no finite MLE despite strict concavity.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A mean-matched count law can be overdispersed relative to Poisson

Example

Let a count response Y have mass 1/2 at 0 and mass 1/2 at 20. This law has the same mean as a Poisson response with mean 10, but a much larger variance.

Facts & Assumptions

Given: The two-point count law in the Example and a comparison Poisson GLM with a(ϕ)=1, b(θ)=eθ, and θ=log⁡10.

[F1]

Generalized linear model with explicit conditioning: a GLM pairs a response family with a link g(μi)=ηi=xiTβ and a natural parameter map satisfying b′(θi)=μi.

[F2]

Mean and variance from the cumulant function: for the stated family, mean is b′(θ) and variance is a(ϕ)b′′(θ).

[F3]

For the comparison Poisson response, the support is N0, the base measure is counting measure, and f(k;θ)=e−eθekθ/k!. The exponential series and addition formula normalize these masses. Its first two parameter derivatives are ∂θf(k;θ)=f(k;θ) (k−eθ) and ∂θ2f(k;θ)=f(k;θ) {(k−eθ)2−eθ}. On any compact interval [u,v] they are dominated by the summable sequence evk{1+(k+ev)2+ev}/k!; the ratio test gives summability. Reindexing the same exponential series gives E[Y2]=λ2+λ<∞ for λ=eθ, so the family satisfies the fixed-support, moment, and derivative-envelope hypotheses. (The real exponential function and the number e by a power series, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y), The factorial n! and the falling factorial nk‾, defined by recursion in N, The exponential function is smooth and (exp⁡)′=exp⁡)

Verification

1.1givenalgebra

For the two-point law, E[Y]=(0+20)/2=10 and E[Y2]=(02+202)/2=200, so Var⁡(Y)=200−102=100.

2.1F1F2F3step 1.1algebra∎

For the comparison Poisson model, θ=log⁡10 gives b′(θ)=b′′(θ)=10, so [F2] gives mean and variance both equal to 10. Since the constructed law has the same mean and variance 100>10, it is overdispersed relative to this Poisson variance specification and is not a Poisson response law.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Rank deficiency gives singular information and nonunique weighted least squares

Example

Use the Bernoulli-logit model with β=(0,0)T, design rows x1T=(1,1) and x2T=(2,2), and responses (y1,y2)=(0,1). The weights are positive, but the design columns are dependent.

Facts & Assumptions

Given: The two-row design and responses in the Example, the Bernoulli-logit family, current β=0, and a(ϕ)=1.

[F1]

General-link score and Fisher information: I=XTdiag⁡(wi)X and U=XT(μ˙i(yi−μi)/(aVi))i.

[F2]

One minimum-norm IRLS step: IRLS minimizes the weighted least-squares objective and applies the Moore-Penrose minimum-norm convention if minimizers are not unique.

[F3]

Each Bernoulli-logit response has the counting-measure mass f(y;η)=exp⁡{yη−log⁡(1+eη)} on {0,1}. It is normalized, has fixed support and finite moments, and its first two η derivatives are locally bounded on this finite support. (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials, The exponential function is smooth and (exp⁡)′=exp⁡, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t)

Verification

1.1F1F3givenalgebra

At β=0, both predictors are 0, both means are 1/2, and both logit derivatives are 1/4. Thus w1=w2=1/4 by [F1]. Direct multiplication gives I=XTWX=54(1111), which has rank one; the score is U=(1/2,1/2)T.

2.1F1F2step 1.1algebra∎

The working responses are z1=−2 and z2=2. For γ=(γ1,γ2)T, put s=γ1+γ2; the weighted objective is J(s)=14{(−2−s)2+(2−2s)2}. Differentiation gives J′(s)=(5s−2)/2, so every γ with s=2/5 is a minimizer. These minimizers form a line, while ∥γ∥22=s2/2+(γ1−γ2)2/2 shows the Moore-Penrose convention selects (1/5,1/5). The information inverse is undefined because I is singular.