Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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 zero-gradient quadratic limit

Example

Let Ω={−2,0,2} with probabilities 1/4,1/2,1/4, let Z(ω)=ω, and set Tn=Z/n for n≥1. For g(t)=t2 at θ=0, the first derivative vanishes and the second derivative is 2. The second-order delta method gives nTn2⇒Z2, which equals 0 or 2 with probability 1/2 each.

Facts & Assumptions

Given: The finite three-point law and sequence in the example.

[A1]

Ω={−2,0,2} has full sigma-field and assigns probabilities 1/4,1/2,1/4 respectively; Z(ω)=ω.

[F1]

First- and second-order delta method for random vectors: if rn>0 is deterministic with rn→∞, rn(Tn−θ)⇒Z, the Borel map g has zero first derivative at θ, and g(θ+h)−g(θ)=12H[h,h]+o(∥h∥2) for a continuous symmetric bilinear map H, then rn2(g(Tn)−g(θ))⇒12H[Z,Z].

Verification

Given: The three-point law, rn=n, θ=0, and g(t)=t2.

1.1A1givenalgebra

By [A1], Z has the stated three-point law. We have n(Tn−0)=Z exactly and g(h)−g(0)=h2=12(2)h2 for every h, so the first derivative is zero, the second derivative is 2, and the second-order remainder vanishes.

2.1A1F1givenstep 1.1algebra∎

Apply [F1] to obtain nTn2⇒Z2. By [A1], Z2=0 at ω=0 and Z2=2 at ω=±2, so each value has probability 1/2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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