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.
Event-time observation, censoring, and truncation schemes
Definition
An event time is a measurable real-valued map with values in . A covariate is a measurable map into a specified standard-Borel space , where standard Borel means measurably isomorphic to a Polish space (Standard Borel spaces). A censoring or inspection time is a measurable real-valued map with values in . When conditional laws are used, they are probability kernels and in the sense of Conditional law given a random element and Measure kernel and probability kernel. They are part of the specified model; their existence for real-valued targets and factorization through standard-Borel follow under The Axiom of Choice from Existence of regular conditional distributions for standard borel targets and Regular conditional kernels factor through a standard borel conditioning variable.
The notation has the meaning in Conditional independence given a sigma-algebra: for bounded measurable , almost surely. It is a model assumption about the conditional observation law, not a consequence of adjusting for and not an empirical conclusion.
Under right censoring, the recorded pair is and . Thus records an event at , including a tie, while records censoring at and implies . Left censoring at a known threshold records only . Interval censoring at known endpoints records . Current-status observation at an inspection time records only .
Left truncation, also called delayed entry at , selects a unit into the sample only when ; observation begins after that selection. Right truncation at selects a unit only when . These are selection rules before the observed sample is formed, whereas censoring coarsens an event time after sampling. The strict and weak inequalities in these definitions fix the endpoint conventions. A random observation endpoint is called noninformative here only when it is fixed by design or is generated independently of conditional on the stated covariates under a parameter-distinct law; otherwise its joint observation law must be modeled.
Depends on
- Standard Borel spaces
- Measure kernel and probability kernel
- Conditional law given a random element
- Existence of regular conditional distributions for standard borel targets
- Regular conditional kernels factor through a standard borel conditioning variable
- Conditional independence given a sigma-algebra
- The Axiom of Choice
Used by
- Aalen–Johansen cumulative-incidence estimator Algorithm
- Informative censoring can hide distinct event-time laws Counterexample
- Competing-risk data, cause-specific hazard measures, and cumulative incidence Definition
- Cox proportional-hazards model and partial likelihood Definition
- Nelson–Aalen, Kaplan–Meier, and Greenwood estimators Definition
- Parametric survival and reliability models Definition
- A hand Kaplan–Meier calculation and loss of tail support Example
- Exponential and Weibull hazards with right-censored exposure Example
- Exponential event-time observations with censoring and delayed entry Example
- Higher competing mortality lowers incidence in a two-time table Example
- No observed failures with positive versus zero exposure Example
- Finite-support risk-set proportion limits Lemma
- Finite-support consistency of Nelson–Aalen and Kaplan–Meier Theorem
- Likelihood contributions under censoring, truncation, and delayed entry Theorem
- Pointwise influence limit and Greenwood variance consistency Theorem
- Right-censored exponential likelihood and its boundary maximum Theorem
Dependency tree · two levels
35 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
- Qiqing Yu, Survival Analysis (Lecture Notes), §§1.1–1.3, 1.5, 1.7–1.8 and 2.1–2.2, PDF pp. 1–11 (standard reference, not scraped)
- Lu Tian, STAT331 Unit 2: Likelihood Construction, Inference for Parametric Survival Distributions, §§2.1–2.2, PDF pp. 1–17 (standard reference, not scraped)
- Jeff Lin, NTPU, Chapter 2: Survival Function, Censoring and Truncation, likelihood construction slides 92–110 (standard reference, not scraped)