Alphabeta Math
Pipeline-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.

✓ 2 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 2 also cleared it.

Competing risks and cumulative incidence

1 · Prerequisites

2 · Summary

For finitely many causes, this page distinguishes the latent cause-specific times from the observed first time and cause. It defines the event subdistribution, all-cause survival, and cause-specific hazard measure, then proves the cumulative-incidence identity with its left-limit convention, including atoms. The Aalen–Johansen procedure is a finite-sample definition with grouped event times and an explicit event-at-censoring tie rule. Its fixed-time output is proved to be a statistic. Independent censoring and positive support are model conditions for population interpretation; the page makes no consistency, variance, or process-limit claim and assumes no independence among latent cause-specific times.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Competing-risk data, cause-specific hazard measures, and cumulative incidence

Definition

Fix a finite number K≥1 of causes on a probability space. Let T1,…,TK be measurable event times with values in [0,∞), and assume that the minimum is attained by a unique cause almost surely. The observed first failure time and its cause are T:=min⁡1≤j≤KTj,D:=min⁡{j:Tj=T}∈{1,…,K}, so D is the smallest label attaining the minimum. For each k, {D=k}=⋂j<k{Tk<Tj}∩⋂j>k{Tk≤Tj}, which is measurable; the assumed almost-sure uniqueness makes the tie-break irrelevant except on a null set. No independence among the latent times Tj is assumed. When an external right-censoring time C is present, the observation is (U,δ,Dobs), where U=min⁡(T,C) and δ=1{T≤C} as in Event-time observation, censoring, and truncation schemes, and Dobs=D when δ=1; the cause label is absent when δ=0. Thus an event tied with censoring is recorded as an event.

The all-cause survival function is S(t):=P(T>t) for t≥0. For u>0, write S(u−):=P(T≥u); this is the left limit of S by continuity from above for measures (Continuity from above when one set has finite measure). Set S(0−):=1.

For each cause k, its event subdistribution measure and cause-specific cumulative-incidence function are νk(B):=P(T∈B,D=k),Fk(t):=νk([0,t])=P(T≤t,D=k). for Borel B⊆[0,∞) and t≥0. The cause-specific hazard measure is the measure with density w(u):={1/S(u−),S(u−)>0,0,S(u−)=0 relative to νk: Λk(B):=∫Bw(u) νk(du),dΛk(u)=w(u) νk(du). The extension of u↦S(u−) by the constant 1 for u<0 is nonincreasing on R and therefore Borel measurable (Every monotone real function is Borel measurable), so w is a nonnegative Borel function and this measure is defined by The measure with density f relative to μ. It may have infinite total mass; no finite-horizon integrability is assumed in this definition.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Cause-specific cumulative incidence as an integral against its hazard measure

Statement

For every cause k∈{1,…,K} and every t≥0, the cumulative incidence decomposes as Fk(t)=∫[0,t]S(u−) dΛk(u). If νk has a Lebesgue density fk and S(u)>0 for every u∈(0,t], then dΛk(u)=λk(u) du for Lebesgue-a.e. u∈(0,t] with λk(u):=fk(u)/S(u), and Fk(t)=∫0tS(u)λk(u) du.

Facts & Assumptions

Given: A finite-cause competing-risk model as in Competing-risk data, cause-specific hazard measures, and cumulative incidence, its event subdistribution νk, survival function S, and cause-specific hazard measure Λk.

[F1]

Competing-risk data, cause-specific hazard measures, and cumulative incidence: Fk(t)=νk([0,t]), S(u−)=P(T≥u), and Λk=w νk with w(u)=1/S(u−) when S(u−)>0 and w(u)=0 otherwise.

[F2]

The measure with density f relative to μ: if w is nonnegative and measurable, then w νk is the measure defined by (w νk)(B)=∫Bw dνk.

[F3]

Integrating against a density agrees with integrating the product: for nonnegative measurable f,g, ∫g d(f dμ)=∫gf dμ.

[F4]

Every monotone real function is Borel measurable: every monotone real function is Borel measurable.

Proof

1.1F1givenalgebra

The set function νk(B)=P(T∈B,D=k) is a finite measure: it is the restriction of the law of (T,D) to the measurable cause slice D=k, so disjoint Borel sets have disjoint preimages and probability countable additivity applies.

2.1F1F4step 1.1

The function s(u):=S(u−)=P(T≥u) is nonincreasing, hence Borel by [F4]. Thus R:={u:s(u)>0} is Borel and w=s−11R is nonnegative Borel.

3.1F1step 2.1given

The set Rc is an upper interval. If Rc=[a,∞), then νk(Rc)≤P(T≥a)=s(a)=0. If Rc=(a,∞), then {T>a}=⋃m≥1{T≥a+1/m} and each event on the right has probability s(a+1/m)=0; hence again νk(Rc)=0. The empty case is immediate.

3.2F2step 2.1

By [F2], Λk=w νk is a measure.

4.1F1F3step 3.1step 3.2algebra

Applying [F3] with g(u)=1[0,t](u)s(u) gives ∫[0,t]s(u) dΛk(u)=∫[0,t]s(u)w(u) dνk(u)=∫[0,t]1R(u) dνk(u)=νk([0,t])=Fk(t). The penultimate equality uses step 3.1, so this proves the measure-valued identity, including atoms and t=0.

5.1F1F3givenstep 4.1algebra∎

Suppose νk(du)=fk(u) du and S(u)>0 for every u∈(0,t]. For each integer m≥1, the set Am:={u∈(0,t]:P(T=u)≥1/m} has at most m points, since distinct singleton events are disjoint and their probabilities sum to at most 1. Every positive atom belongs to some Am, so A:=⋃m≥1Am is countable and therefore Lebesgue-null. For 0<u≤t, the definitions s(u)=P(T≥u) and S(u)=P(T>u) give s(u)−S(u)=P(T=u); hence s(u)=S(u) outside A. Also s(u)≥S(u)>0, so w(u)=1/s(u) on (0,t]. Since dνk=fk du, [F1, F3] give dΛk=wfk du, whose density agrees with fk/S=λk Lebesgue-a.e. on (0,t]. Finally, νk({0})=0 because νk has a Lebesgue density, so the point 0 contributes nothing to either side of step 4.1; substituting the density on (0,t] into that identity gives the stated formula, including t=0.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicableOpen item page →

Aalen–Johansen cumulative-incidence estimator

Definition

Input: A finite sample of n≥1 right-censored records (Ui,δi,Diobs) for K causes, using Ui=min⁡(Ti,Ci) and δi=1{Ti≤Ci} from Event-time observation, censoring, and truncation schemes. The observed cause label Diobs∈{1,…,K} is present only when δi=1. Fix a horizon t≥0.

The pointwise population target is ψt:=(S(t),F1(t),…,FK(t))∈RK+1; the algorithm returns its finite-sample estimate.

For each event time u∈[0,t], define the risk count and cause-specific event counts by Y(u):=∑i=1n1{Ui≥u},ΔNk(u):=∑i=1n1{Ui=u,δi=1,Diobs=k},ΔN(u):=∑k=1KΔNk(u). All subjects with an event at u are included in Y(u), so tied observed failures are grouped before updating and Y(u)≥ΔN(u)>0 at every event time. Censorings at u do not contribute to ΔN(u); a subject with Ti=Ci=u is an event by the stated Ti≤Ci convention.

Procedure:

  1. List the distinct observed event times u≤t in increasing order, with all causes at a common time grouped into the same counts ΔNk(u).
  2. Initialize S^(0−)=1 and F^k(0−)=0 for each cause.
  3. At each listed u, set F^k(u)=F^k(u−)+S^(u−)ΔNk(u)Y(u),S^(u)=S^(u−)(1−ΔN(u)Y(u)).
  4. Keep the estimates constant between event times and return (S^(t),F^1(t),…,F^K(t)).

Equivalently, S^(t)=∏0≤u≤t: ΔN(u)>0(1−ΔN(u)Y(u)),F^k(t)=∑0≤u≤t: ΔN(u)>0S^(u−)ΔNk(u)Y(u). The convention at u=0 allows a baseline event; when there is none, these formulas agree with the (0,t] product-limit convention in Nelson–Aalen, Kaplan–Meier, and Greenwood estimators.

This procedure is a finite-sample definition, not a consistency or variance theorem. A common sampling setup for interpreting it as an estimator of a population law has IID subject records (Identical distribution and IID families), independent censoring C⊥(T,D) (Independent random elements), and P(C≥t)>0, a positive censoring-support condition through t. These are model assumptions, not consequences of the formula. This item does not invoke a counting-process compensator, martingale bracket, or process-limit result.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Fixed-time Aalen–Johansen outputs are well-defined statistics

Statement

Fix n≥1, finite K, and t≥0, and let X=([0,∞)×{0,1,…,K})n carry its Borel sigma-algebra as a Euclidean subspace, where status 0 denotes censoring and status k denotes an observed cause-k event. Let E be any statistical experiment with sample space (X,B(X)). Equip RK+1 with its Borel sigma-algebra. The output vector of Aalen–Johansen cumulative-incidence estimator at horizon t is a measurable map X→RK+1 and hence a statistic in E. Every event-time denominator Y(u) is positive.

Facts & Assumptions

Given: The statistical experiment, sample space, and fixed horizon in the Statement, with the procedure of Aalen–Johansen cumulative-incidence estimator.

[F1]

Aalen–Johansen cumulative-incidence estimator: Y(u)=∑i1{Ui≥u}, and ΔNk(u)=∑i1{Ui=u,δi=1,Diobs=k}; updates use only event times with ΔN(u)>0.

[F2]

Statistics and estimators: a statistic is a measurable map from the observation space to a measurable target space; an estimator is a statistic with the estimand's target space.

[F3]

A measurable function between measurable spaces: measurability means that the preimage of every target measurable set is measurable.

[F4]

Arithmetic and lattice operations preserve measurability whenever they are defined: finite sums and products of real measurable functions are measurable wherever defined.

Proof

1.1F1F3F4given

For every i,j, the predicates Ui≤t, Ui≤Uj, Ui=Uj, and each finite-valued cause-status predicate define Borel subsets of X: the coordinate-comparison sets are closed in the Euclidean sample space, and status slices are Borel in the finite status space. Hence Y(Ui) and ΔNk(Ui) are finite sums of measurable indicators by [F1] and [F4]. If i is an event at u=Ui, then its indicator is included in Y(u) and in ΔN(u), so Y(u)≥ΔN(u)≥1.

2.1F1F2F3F4step 1.1algebra∎

For each event record the ratio ΔNk(Ui)/Y(Ui) has finite range, since both counts lie in {0,…,n} and the denominator is in {1,…,n}; each level set is a finite union of Borel count-level sets, so the ratio is measurable. The indicator selecting the first record at each distinct event time and the ordering of the at most n event times are also determined by finitely many Borel equalities and inequalities. The updates in [F1] therefore form finite sums and products of measurable functions; [F4] makes every coordinate of the output vector measurable. By [F2] and [F3], this vector is a statistic, and step 1.1 proves its denominators are positive.

5 · Examples, counterexamples and false statements

None yet.

Sources