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.
Pointwise influence limit and Greenwood variance consistency
Statement
Assume the Axiom of Choice. Fix and, for each positive integer sample size , observe IID subject pairs , with almost surely, independent of , and having an absolutely continuous law on with density . Write , , and take a finite nonnegative Borel version of . Put for . Assume . In a common filtration, assume each is predictable and each , where , satisfies the finite-horizon square-integrable counting-process contract. This compensator is a model assumption; a displayed hazard alone is not an existence theorem. Put and . Then, with and , The terminal normal limit is . Let equal Greenwood's formula on its positive-denominator domain and elsewhere; then . The extension only defines the sequence on all samples for the convergence statement; it assigns no Greenwood variance interpretation outside the positive-denominator domain. These are fixed-time results; no process convergence or confidence-band conclusion is asserted. Greenwood is not an exact finite-sample variance identity.
Facts & Assumptions
Given: The hypotheses and definitions in the statement, the right-censoring observation scheme, the finite-horizon counting-process model contract, and the Nelson–Aalen, Kaplan–Meier, and Greenwood formulas. Prove the two influence expansions, the terminal normal limit, and Greenwood consistency.
Assume the Axiom of Choice (AC), inherited through the counting-process integration and IID terminal-limit suppliers. (The Axiom of Choice)
Right-censoring records and ; event ties are recorded as events. (Event-time observation, censoring, and truncation schemes)
, , , with the integrand set to zero when , , and Greenwood's formula is defined only when its event denominators are positive. Since almost surely, there is no event at zero under these hypotheses. (Nelson–Aalen, Kaplan–Meier, and Greenwood estimators)
The subject records are IID with a common law and mutual independence across subjects. (Identical distribution and IID families)
Under the counting-process contract, is continuous predictable with , and is a square-integrable martingale; an intensity display alone supplies no existence theorem. (Simple counting-process intensity and compensator contract)
For a compensated simple counting process, is a martingale and . (Brackets of a compensated simple counting process)
The L² counting-process integral is defined by completion for predictable with . (L² counting-process integral when the limit exists)
On this finite-energy domain the integral is a square-integrable martingale and satisfies . (L² extension of the predictable counting-process integral)
converges uniformly in probability to on , and its expected squared uniform error tends to zero. (Uniform convergence of the empirical right-censoring risk set)
If IID subjects have a centered square-integrable measurable influence function and an already-proved expansion remainder, the estimator has the corresponding terminal normal limit; the theorem assumes and does not prove the expansion. (IID terminal influence limit from a separately established expansion)
If and is differentiable at , then in the scalar case. (First- and second-order delta method for random vectors)
Predictability is measurability for the predictable sigma-algebra; Borel transformations of predictable processes and deterministic Borel time functions remain predictable. (Progressively measurable and predictable processes)
For a nonnegative product-measurable function on a sigma-finite product, Tonelli permits integration in either order. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)
Pointwise convergence under an integrable majorant gives convergence of integrals. (Dominated convergence)
Proof
Independence within a subject gives . On , . Since is absolutely continuous and almost everywhere, integration of gives . The assumed integral makes finite and also gives .
For each finite , event times have no ties in almost surely: for , subject independence and the absolutely continuous law on give , and there are finitely many pairs. Thus is a simple counting process. Set , , and . Finite sums preserve the martingale property and square integrability; [F4] gives . The process is predictable, and so is by [F11]; both meet [F4]'s domain, with . Hence the pooled process also satisfies the finite-horizon contract. By [F5], its predictable bracket is .
We will identify the completed integrals with pathwise finite-variation integrals for every bounded predictable integrand used below. The paths of and are left-continuous on , and is left-continuous there by continuity of probabilities along decreasing events. Consequently , the floored reciprocal , its difference , and the floored product reciprocal below all have bounded left-continuous paths, with a deterministic bound for each fixed . On deterministic partitions with mesh tending to zero, take the left-step approximants on and set their time-zero value to zero. They are elementary predictable integrands, converge pointwise to at every , and retain the bound. For any subject or pooled contract, [F13] for the finite compensator measure gives , and [F7] gives convergence of their elementary integrals to the completed integral in . The paths of have finite variation; [F13] applied pathwise to its finite variation measure gives convergence of the same elementary sums to . Uniqueness of limits in probability identifies these two limits almost surely at the fixed time. The time-zero convention is immaterial because and is continuous. This proves the pathwise identities needed below without assuming a general semimartingale integration theorem.
Write . By [F8], . Let and . These are bounded predictable processes: is predictable by [F4], and Borel transformations preserve predictability by [F11]. The reciprocal map with floor is -Lipschitz, so .
The energy of for is finite because is bounded and . Applying [F7] to the pooled contract gives . Thus this stochastic-integral remainder is . On the event , whose probability tends to one by [F8], throughout and . By the pathwise identification in step 2.1, gives there . For each bounded predictable step integrand, the finite-sum definition in [F6] makes the integral against equal to the sum of the subject integrals. Approximate in the pooled compensator energy by such steps; [F7] gives L² convergence, and lets the same approximants converge for each of the finitely many subjects. Since is a deterministic Borel time function, it is predictable by [F11]. Passing the finite-sum identity to these L² limits yields .
For one subject, step 2.1 identifies the integral in step 3.1 as , so it is a measurable function of . It has mean zero by the martingale property and, by [F7] and Tonelli [F12], variance . The integrand is nonnegative and product-measurable because is predictable and is a deterministic Borel function. Hence these influence variables are IID and square-integrable. The normalized IID sum is bounded in probability by its fixed second moment, so step 3.1 gives a separately established expansion with remainder. Applying [F9] proves .
On , for all sufficiently large , every event jump has size . For , the power series for gives . There are at most event jumps, so . Consequently . Step 4.1 also gives ; Taylor's formula for on then yields . Taking and derivative in [F10] transfers the terminal normal limit, giving .
For sufficiently large , define the bounded predictable . On , at event times and , so . The uniform convergence in [F8] implies uniformly in probability, while is uniformly bounded. Using step 2.1, decompose . The first term tends to by boundedness and ; by [F3]–[F4] the second has second moment at most , which tends to zero. Therefore the scaled Greenwood sum tends to , and by step 5.1. Since and Greenwood's formula is defined on for large , the zero extension agrees with the formula on an event whose probability tends to one. It follows that , which equals by step 4.1. This is a first-order variance estimate, not a finite-sample identity.
Depends on
- Nelson–Aalen, Kaplan–Meier, and Greenwood estimators
- Event-time observation, censoring, and truncation schemes
- Identical distribution and IID families
- Simple counting-process intensity and compensator contract
- Progressively measurable and predictable processes
- Brackets of a compensated simple counting process
- L² counting-process integral when the limit exists
- L² extension of the predictable counting-process integral
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Dominated convergence
- Uniform convergence of the empirical right-censoring risk set
- IID terminal influence limit from a separately established expansion
- First- and second-order delta method for random vectors
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
65 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
- Lu Tian, STAT331 Unit 12: 1-Sample Problem: General Asymptotic Results, PDF pp. 5–10 and 12–14 (standard reference, not scraped)
- Lu Tian, STAT331 Unit 3: Kaplan-Meier (KM) Estimator, PDF pp. 11–12 (standard reference, not scraped)
- Qiqing Yu, Survival Analysis (Lecture Notes), §4.2.2, PDF pp. 33–38 (standard reference, not scraped)