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

Immigration-death chain projected onto two states

Example

Consider immigration at rate 1 and death at rate n from state n∈N0, starting at 0. For F={0,1}, the cemetery lift on {0,1,†} is

Q~F=(−1101−20010).

Writing the lifted law as (p0(t),p1(t),cF(t))T, the exact cemetery mass is

cF(t)=15(er+t−1r+−er−t−1r−),r±=−3±52.

It equals the probability of having exited F by time t and therefore is the exact embedded killed-vector ℓ1 error. A path can exit and return: 0→1→2→1 has positive probability for every t>0, so the full marginal at state 1 can exceed the killed projection there.

Facts & Assumptions

Given: State space E=N0, immigration rate 1, death rate n at state n, initial state 0, and finite projection F={0,1}.

[F1]

Finite-channel reaction propensity systems and their generator: a finite-channel reaction system has a countable state set, integer increments, finite propensities, and generator QV(x)=∑jaj(x)(V(x+νj)−V(x)) when that finite sum is defined.

[F2]

A proper Lyapunov bound prevents reaction-network explosion: under Countable Choice and Dependent Choice, a proper V≥1 with QV≤cV for finite c≥0 implies that the constructed reaction process is nonexplosive.

[F3]

Given countable nonexplosive pure-jump chain with finite rates: the countable chain used by the projection is already given and nonexplosive; the definition does not prove this from rates alone.

[F4]

Killed finite-state projection and cemetery lift: the killed projection stays at † after the first exit, and its finite lift adds the aggregate exit rate into the cemetery row.

[F5]

Finite master equation and uniformization formula: a finite column generator evolves the initial column law by the unique solution of p′=Qp.

[F6]

Finite-state killed projection has an exact lost-mass certificate: the cemetery mass equals the first-exit probability and the embedded killed-vector ℓ1 error.

Verification

technique · verify nonexplosion under the reaction-network Lyapunov hypotheses, then solve the finite cemetery lift
1.1givenF1algebra

The system has two channels, increments +1 and −1, and propensities a+(n)=1 and a−(n)=n; the death channel is inactive at n=0, so every positive-propensity poststate remains in N0 and the total rate 1+n is finite. Thus [F1] applies.

1.2givenF1F2F3A1algebra

Let V(n)=1+n. Its sublevel set {n:V(n)≤m} is finite for each integer m≥1, so V is proper. For n≥1, QV(n)=1(V(n+1)−V(n))+n(V(n−1)−V(n))=1−n≤1+n=V(n); at n=0 the same value QV(0)=1 satisfies this bound. Hence [F2] with c=1 and [A1] proves the immigration-death chain is nonexplosive, as required by [F3].

1.3F1F4givenalgebra

On F={0,1}, state 0 jumps to 1 at rate 1; state 1 jumps to 0 at rate 1 and exits to 2∉F at rate 1. These off-diagonal rates are nonnegative, and the cemetery construction [F4] gives the displayed Q~F with zero column sums. Multiplying by the lifted probability vector gives p0′=−p0+p1, p1′=p0−2p1, and cF′=p1, with initial vector (1,0,0)T.

2.1F5step 1.3algebra

From p1′=p0−2p1 we have p0=p1′+2p1; differentiating and using p0′=−p0+p1 yields p1′′+3p1′+p1=0, with p1(0)=0 and p1′(0)=1. The characteristic roots are r±=(−3±5)/2 and r+−r−=5, so the unique solution is p1(t)=(er+t−er−t)/5.

3.1step 2.1F6algebra

Since cF′=p1 and cF(0)=0, integrating the expression in step 2.1 gives the displayed formula for cF(t). By [F6], this coordinate is P(τF≤t) and equals the embedded killed-vector ℓ1 error.

4.1F1F3F4givenconstruct∎

Fix t>0 and choose ordered times 0<s1<s2<s3<t. The joint density for jumps 0→1 at s1, 1→2 at s2, and 2→1 at s3, followed by no further jump through t, is e−s1⋅1⋅e−2(s2−s1)⋅1⋅e−3(s3−s2)⋅2⋅e−2(t−s3), which is strictly positive; integrating this positive density over the nonempty ordered-time simplex gives positive probability. Such paths contribute to the full marginal at state 1 but have already been killed at their first exit from F.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

47 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