Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Recovering an exponential law from its tail

Example

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Fix λ>0 and suppose a nonnegative random variable X satisfies P(X>t)=e−λt(t≥0). Then FX(x)={0,x<0,1−e−λx,x≥0, its law on R is the exponential law with parameter λ, and E[X]=1λ.

Facts & Assumptions

Given: The Axiom of Countable Choice and a nonnegative random variable X with P(X>t)=e−λt for all t≥0.

[L1]

The cumulative distribution function is FX(x)=P(X≤x) (Cumulative distribution function of a real random variable).

[L2]

Assuming the Axiom of Countable Choice, distribution functions determine probability laws (Probability laws correspond to distribution functions).

[L3]

For nonnegative random variables, E[X]=∫0∞P(X>t) dt (Layer-cake formulas for random variables).

Verification

technique · direct
1.1L1given

Because X≥0, one has FX(x)=0 for x<0. For x≥0, FX(x)=1−P(X>x)=1−e−λx. So the displayed formula is the CDF of X.

1.2L3algebra

The tail integral from [L3] gives E[X]=∫0∞e−λt dt=1λ.

2.1step 1.1L2

By [L2], that distribution function determines the law uniquely, and its interval increments are those of the exponential distribution with parameter λ.

3.1step 1.1step 1.2step 2.1∎

Steps 1.1, 1.2, and 2.1 recover the law and its expectation from the tail.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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