Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

23 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