Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 T with values in [0,∞). A covariate is a measurable map Z into a specified standard-Borel space (Z,B), where standard Borel means measurably isomorphic to a Polish space (Standard Borel spaces). A censoring or inspection time is a measurable real-valued map C with values in [0,∞). When conditional laws are used, they are probability kernels KT(z,⋅) and KC(z,⋅) 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 Z 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 T⊥ ⁣ ⁣ ⁣⊥C∣σ(Z) has the meaning in Conditional independence given a sigma-algebra: for bounded measurable a,b, E[a(T)b(C)∣σ(Z)]=E[a(T)∣σ(Z)]E[b(C)∣σ(Z)] almost surely. It is a model assumption about the conditional observation law, not a consequence of adjusting for Z and not an empirical conclusion.

Under right censoring, the recorded pair is U=min⁡(T,C) and δ=1{T≤C}. Thus δ=1 records an event at U=T, including a tie, while δ=0 records censoring at U=C and implies T>C. Left censoring at a known threshold L records only T≤L. Interval censoring at known endpoints L<R records L<T≤R. Current-status observation at an inspection time C records only δC=1{T≤C}.

Left truncation, also called delayed entry at L, selects a unit into the sample only when T>L; observation begins after that selection. Right truncation at R selects a unit only when T<R. 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 T conditional on the stated covariates under a parameter-distinct law; otherwise its joint observation law must be modeled.

Depends on

Used by

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