Alphabeta Math
DefinitionDefinition: 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.

Nelson–Aalen, Kaplan–Meier, and Greenwood estimators

Definition

For a positive integer sample size n, let (Ti,Ci), 1≤i≤n, be event and censoring times with right-censored observations (Ui,δi) as in Event-time observation, censoring, and truncation schemes, so Ui=min⁡(Ti,Ci) and δi=1{Ti≤Ci}. The subject counting process and at-risk process are Ni(t)=1{Ui≤t, δi=1} and Yi(t)=1{Ui≥t}. The endpoint convention makes Yi left-continuous at Ui: a subject is still at risk at the observed time, including a tied event and censoring time. Set Nn=∑i=1nNi and Yn=∑i=1nYi. Let dNn be the finite counting measure of observed events on [0,∞), with atom ΔNn(u):=∑i=1n1{Ui=u, δi=1} at each u≥0; in particular, ΔNn(0)=Nn(0). Tied failures at u contribute their full count and censorings at u do not contribute to dNn(u).

For t≥0, the Nelson–Aalen estimator is Λ^n(t)=∫[0,t]1{Yn(u)>0}Yn(u) dNn(u), where the integrand is defined to be zero when Yn(u)=0. The Kaplan–Meier estimator is S^n(t)=∏0≤u≤t:ΔNn(u)>0(1−ΔNn(u)Yn(u)). Each product is finite and a factor is zero if every subject at risk fails at that time. The target survival function is S(t)=P(T>t). If T has density f, S is positive on the horizon, and λ=f/S, the continuous cumulative hazard is Λ(t)=∫0tλ(u) du=−log⁡S(t).

These inclusive endpoint formulas reduce to the usual (0,t] formulas whenever ΔNn(0)=0. If T has finite support 0≤a1<⋯<am, write qj=P(T=aj∣T≥aj); the corresponding discrete cumulative hazard is Λd(t)=∑aj≤tqj. Under IID sampling, independent censoring, and positive risk probability at the support points, the Nelson–Aalen increments estimate these qj; in general this discrete cumulative hazard is not −log⁡S(t).

A baseline event is included at u=0; if it occurs then Ni(0)=1, so a model contract requiring Ni(0)=0 must exclude this case.

An empty event product is 1, and an empty Greenwood event sum is 0.

On a horizon where every event contribution has Yn(u)−ΔNn(u)>0, the Greenwood variance estimate is V^G(t)=S^n(t)2∑0≤u≤t: ΔNn(u)>0ΔNn(u)Yn(u){Yn(u)−ΔNn(u)}. Greenwood's formula is used as a first-order asymptotic variance estimate when the sampling and censoring assumptions justify that approximation; the formula alone asserts no asymptotic result and is not an exact finite-sample variance identity. It is undefined when a contributing denominator is zero.

For each fixed t, Λ^n(t) and S^n(t) are statistics of the observed sample in the sense of Statistics and estimators. Greenwood's formula is a measurable function on the measurable subset Dn(t) of the observed sample space ([0,∞)×{0,1})n where every contributing denominator is positive. Its zero extension V^G∘(t), equal to V^G(t) on Dn(t) and 0 elsewhere, is a statistic on the whole observed sample space. This extension assigns no Greenwood variance interpretation outside Dn(t).

To verify measurability, scan indices i=1,…,n and include only the first event observation at each distinct time in [0,t]; each inclusion condition uses finitely many Borel equalities and inequalities among the observed Ui and δi. Risk and event counts are finite Borel sums. The finitely many positive-denominator tests make Dn(t) measurable; evaluating divisions only on their positive-denominator branches makes the sums, products, and zero extension Borel measurable.

Depends on

Used by

Dependency tree · two levels

12 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