Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Survival jumps multiply by one minus the atomic hazard

Statement

Assume Countable Choice. Let T≥0 have CDF FT(t)=P(T≤t) and survival ST(t)=P(T>t). For any t≥0 with ST(t−)=P(T≥t)>0, define the atomic hazard qT(t):=P(T=t)P(T≥t). Then ST(t)=ST(t−)(1−qT(t)).

In particular, if m≥1 and the law is supported on a finite set of distinct times 0≤t1<⋯<tm and each listed point has positive mass, put qj:=qT(tj). Then ST(tj)=∏r=1j(1−qr),1≤j≤m. For laws with both continuous and atomic parts, the pointwise jump identity still holds at every atom; this finite-support product is not a formula for the continuous decrease between atoms.

Facts & Assumptions

Given: Countable Choice, a nonnegative event time T, and the stated finite support condition when the product formula is used.

[F1]

FT(t)=P(T≤t) and ST(t)=P(T>t)=1−FT(t) for t≥0; ST(t−):=P(T≥t). Cumulative distribution function of a real random variable, Parametric survival and reliability models

[F2]

Under Countable Choice, the law of T satisfies P(T=t)=FT(t)−FT(t−). Probability laws correspond to distribution functions, Interval formulas and atoms for a Lebesgue-Stieltjes measure

[A1]

Countable Choice is used by [F2] for the CDF/measure correspondence and atom formula. The Axiom of Countable Choice (ACω)

Proof

technique · direct
1.1A1F1F2algebra

By [F2], P(T=t)=FT(t)−FT(t−). Also P(T≥t)=P(T>t)+P(T=t), so [F1] gives ST(t−)=1−FT(t−),P(T=t)=ST(t−)−ST(t).

2.1step 1.1givenalgebra

Divide the identity in step 1.1 by the positive quantity ST(t−). Using the definition of qT(t) gives qT(t)=1−ST(t)ST(t−), which is equivalent to ST(t)=ST(t−)(1−qT(t)).

3.1step 2.1givenalgebra

In the finite-support case, ST(t1−)=1, since T≥t1. For j>1, no probability mass lies in (tj−1,tj), so ST(tj−)=P(T≥tj)=P(T>tj−1)=ST(tj−1). Applying step 2.1 successively yields ST(tj)=ST(tj−1)(1−qj)=∏r=1j(1−qr), where the initial factor is ST(t1−)=1.

4.1step 2.1step 3.1∎

Step 2.1 proves the jump identity for every atom with positive pre-jump survival, and step 3.1 proves the finite atomic product formula.

Depends on

Used by

Dependency tree · two levels

25 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