Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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.