Alphabeta Math
Pipeline-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.

✓ 7 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Logrank and weighted logrank

1 · Prerequisites

2 · Summary

This page defines the two-group risk-set logrank score, its conventional hypergeometric plug-in variance, weighted scores, and the normal-calibrated statistic. It proves the finite conditional risk-set moments under the explicit uniform-subset model; the sequential result specifies a finite filtration, zero-risk convention, and finite expected weighted variance. The uniform risk-set limits assume within-group IID observed times, deterministic allocation fractions, and positive pooled limiting risk. The page separates these design-based and sampling premises, establishes the terminal common-hazard Gaussian limit under an explicit square-integrable counting-process contract, and gives an exact Fisher randomization result when each allowed assignment induces a binary group map and the full-record sharp null holds. The terminal theorem proves the subject-influence expansion and scale replacement and makes no process limit claim. It does not infer the martingale contract from the event-time or censoring model. Weights may be predictable and bounded; the terminal result assumes they converge uniformly in probability to a deterministic bounded limit.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Two-group logrank and weighted logrank scores

Definition

Fix a follow-up horizon τ>0 and a finite set of subjects I={1,…,n}. A right-censored record for subject i is a pair (Ui,δi)∈[0,τ]×{0,1}, where Ui=min⁡(Ti,Ci) is the observed time and δi=1{Ti≤Ci} records an event, including an event-censoring tie; δi=0 records right censoring. A two-group assignment is a map z:I→{0,1}. These conventions are the right-censoring observation scheme; the score below uses the observed record and does not infer event or censoring laws from it.

Let t1<⋯<tK be the distinct observed failure times in [0,τ]. For g∈{0,1} define the risk count and event count at tj by Ygj(z):=#{i:zi=g, Ui≥tj},dgj(z):=#{i:zi=g, Ui=tj, δi=1}. Write Yj=Y0j+Y1j, dj=d0j+d1j>0, and Oj=d1j. Since tj is an observed failure time, 1≤dj≤Yj. The expected group-1 count under the conditional hypergeometric model is Ej:=djY1jYj. Under that model the dj failing subjects are a uniform dj-subset of the Yj subjects at risk, conditional on the risk-set and event-count margins. The corresponding conditional variance is Vj:={Y1jY0jdj(Yj−dj)Yj2(Yj−1),Yj>1,0,Yj=1. If the study has no observed failures, all sums below are empty and equal zero. The conditional hypergeometric model is an explicit finite risk-set assumption; equality of survival laws with arbitrary censoring or subject heterogeneity does not by itself assert this conditional allocation law. The uniform law on the finite set of dj-subsets is the uniform finite probability space of The uniform probability space on a nonempty finite set.

A weight rule assigns a real value wj using only the predeclared time and information available strictly before the failures at tj; deterministic bounded time weights are a special case. If sup⁡j∣wj∣<∞, define the weighted logrank score and its conditional variance estimate by Uw(z;U,δ):=∑j=1Kwj(Oj−Ej),V^w(z;U,δ):=∑j=1Kwj2Vj. When V^w>0, set Zw:=Uw/V^w. If V^w=0, this standardized statistic is left undefined; the unstandardized score remains defined. The normal calibration is only an approximation until the separate terminal limit hypotheses are verified. It is not the finite-sample Fisher randomization p-value.

For a fixed observed record, the displayed scores are statistics in the measurable-map sense of Statistics and estimators: each risk count is a finite sum of Borel indicator functions, and every denominator is positive at an observed event time. A weight rule is fixed before assignments or outcomes are inspected and is recomputed by the same rule for any candidate assignment.

The risk-set table concerns one predeclared event type. If simultaneous records contain distinct event causes that are not exchangeable, form separate cause-specific counts Ojc and djc using the same pre-event risk set; use the displayed hypergeometric variance only for a cause whose failures are conditionally exchangeable. This definition does not pool different causes or add their variances without a specified cross-cause covariance model.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform convergence of empirical risk-set fractions

Statement

For g∈{0,1}, let Xg1,Xg2,… be IID measurable [0,∞)-valued observed times with law Pg. For deterministic ng→∞, define Yg,n(t):=∑i=1ng1{Xgi≥t},sg(t):=Pg(Xg1≥t),0≤t≤τ. Then, for each group, sup⁡0≤t≤τ∣Yg,n(t)ng−sg(t)∣⟶P0.

Facts & Assumptions

Given: A fixed finite horizon, an IID sequence of real observed times in each group, and the empirical threshold class F={ft:t∈[0,τ]} with ft(x)=1{x≥t}.

[F1]

Identical distribution and IID families: within each group the observations have one common law and the full family is mutually independent.

[F2]

Random elements and real random variables: each observed time is a measurable real-valued map, so every threshold indicator ft(Xgi) is a random variable.

[F3]

Empirical, centered, and Rademacher processes: Pgf=∫f dPg and Pg,nf=ng−1∑i=1ngf(Xgi).

[F4]

Glivenko–Cantelli classes: a nonempty pointwise-measurable class with an integrable envelope is Pg-Glivenko--Cantelli when its uniform empirical deviation tends to zero in probability.

[F5]

Covering, packing, bracketing numbers, and metric entropy: an L1(Pg) bracket has measurable endpoints ℓ≤u, contains every function in its class between those endpoints, and has width Pg(u−ℓ).

[F6]

Glivenko–Cantelli theorem by bracketing entropy: for IID observations, a nonempty pointwise-measurable function class with an integrable envelope and finite L1(Pg) bracketing number at every positive scale has uniform empirical deviation tending to zero in probability. The theorem's separate almost-sure branch assumes Countable Choice; that branch is not used here.

Proof

1.1F1F2F4given

Each ft is measurable. The subclass with rational thresholds in [0,τ] is countable and pointwise dense: for t>0 choose rationals qk↑t with 0≤qk<t, while for t=0 use the member f0 itself. If x≥t, every fqk(x)=1; if x<t, then qk>x eventually and fqk(x)=0. Hence fqk(x)→ft(x) for every x. The envelope is the constant function 1, which is measurable and has Pg-integral 1.

1.2F5given

Put q(t):=Pg(Xg1≥t). For s<t, the indicators are nested and Pg∣fs−ft∣=Pg(s≤Xg1<t)=q(s)−q(t). The function q is nonincreasing with range in [0,1]. Fix ϵ>0 and set δ=ϵ/3. Partition [0,1] into finitely many intervals of length at most δ and group thresholds whose q-values lie in the same interval. Each threshold class in one group is nested; its pointwise infimum and supremum are measurable threshold indicators (possibly their one-sided endpoint limits), and they bracket the group. The L1(Pg) width is the supremum of Pg∣fs−ft∣ over thresholds in that group, at most δ, by the displayed identity. Thus at most ⌈1/δ⌉+1 brackets cover F, so N[](ϵ,F,L1(Pg))<∞. This also handles atoms: a jump in q larger than a bin width places the two threshold sides in different bins, while a smaller jump contributes at most the bin's total q-width.

2.1F3F4F6step 1.1step 1.2∎

Steps 1.1 and 1.2 verify pointwise measurability, the integrable envelope, and every finite-bracketing hypothesis in [F6]. Its convergence-in-probability conclusion gives sup⁡t∈[0,τ]∣Pg,nft−Pgft∣→P0. Since Pg,nft=Yg,n(t)/ng and Pgft=sg(t) by their definitions, this is the asserted uniform risk-set convergence. No Countable Choice or strong Glivenko--Cantelli conclusion is used.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Conditional hypergeometric moments for a logrank risk set

Statement

Fix a risk set with Y1 group-1 subjects, Y0 group-0 subjects, and Y=Y1+Y0. Conditional on the margins, suppose the d failing subjects are a uniform d-subset of these Y subjects, where 0≤d≤Y. Let O be the number of failures in group 1. If Y>1, then E[O]=dY1Y,Var⁡(O)=Y1Y0d(Y−d)Y2(Y−1). If Y=0 or Y=1, set the contribution to the variance to zero; the expectation remains dY1/Y when Y>0, and is zero when Y=0.

For the sequential assertion, take a finite sequence j=1,…,J on a probability space with a filtration H0⊆H1⊆⋯⊆HJ. Before the failures at step j are revealed, the current risk-set subjects, their group counts Y1j,Y0j, and the total dj are Hj−1-measurable, with 0≤dj≤Yj:=Y1j+Y0j. Conditionally on Hj−1, the failing subjects are a uniform dj-subset of the current Yj subjects; their identities are revealed in Hj. If Yj=0, necessarily dj=0 and the failing subset is empty. Put Ej=djY1j/Yj when Yj>0 and Ej=0 when Yj=0; let Vj be the displayed risk-set variance when Yj>1 and zero when Yj≤1. Suppose each real weight wj is Hj−1-measurable and E ⁣[∑j=1Jwj2Vj]<∞. Then Dj=wj(Oj−Ej) are square-integrable martingale differences and E ⁣[∑jDj]=0,Var⁡ ⁣(∑jDj)=E ⁣[∑jwj2Vj], where the nonempty-risk-set variance contribution is the one in Two-group logrank and weighted logrank scores.

Facts & Assumptions

Given: A finite risk set, its two group counts, a total failure count d, the uniform-subset allocation model, and, for the sequential assertion, the finite filtration, measurable pre-reveal margins, zero-risk convention, conditional law, predictable weights, and integrability condition stated above.

[F1]

The uniform probability space on a nonempty finite set: the uniform law on a nonempty finite set assigns each element probability equal to the reciprocal of the set's cardinality.

[F2]

The indicator random variable of an event: an indicator is one on its event and zero elsewhere.

[F3]

Expectation is linear for every finite family of random variables, without any independence hypothesis: expectation of a finite sum is the sum of the expectations; independence is not required.

[F4]

Indicators turn event probabilities, intersections, and finite counts into expectations and products: indicator expectations equal event probabilities, and products of indicators equal indicators of intersections.

[F5]

Variance, standard deviation, and covariance on a finite probability space: variance and covariance are expectations of the centered square and centered product.

[F6]

Var⁡(X)=E[X2]−E[X]2 and Cov⁡(X,Y)=E[XY]−E[X]E[Y]: variance and covariance may be expanded as E[X2]−(EX)2 and E[XY]−EX EY.

[F7]

Two-group logrank and weighted logrank scores: Ej=djY1j/Yj, and under the conditional hypergeometric model Vj=Y1jY0jdj(Yj−dj)/(Yj2(Yj−1)) when Yj>1, with zero contribution for Yj=1.

[A1]

Conditional on Hj−1, which includes the risk-set margins and dj, each dj-subset of the Yj risk-set subjects has equal probability.

Proof

1.1A1F1F2F3F4given

If Y=0, then d=0, O=0, and both stated moments are zero. Suppose Y≥1. For each of the Y1 group-1 subjects let Ia indicate that subject a is in the failing subset. Under [A1], when d≥1, P(Ia=1)=(Y−1d−1)/(Yd)=d/Y; for d=0, both sides are zero. Since O=∑a=1Y1Ia, [F3] and [F4] give EO=Y1d/Y.

1.2F1F5given

If Y=1, then d∈{0,1} and the failing subset is deterministic: O=dY1. Its expectation is dY1/Y and its variance is zero, as stipulated.

2.1F3F5F6givenalgebrastep 1.1

Suppose Y>1. For distinct group-1 subjects a,b, if d≥2 the same subset count gives P(Ia=Ib=1)=(Y−2d−2)/(Yd)=d(d−1)/(Y(Y−1)); for d=0 or d=1 the probability and the displayed ratio are both zero. Using [F5] and [F6], Var⁡(Ia)=d(Y−d)Y2,Cov⁡(Ia,Ib)=−d(Y−d)Y2(Y−1). Thus [F3] and [F5] give Var⁡(O)=Y1d(Y−d)Y2−Y1(Y1−1)d(Y−d)Y2(Y−1)=Y1(Y−Y1)d(Y−d)Y2(Y−1). Since Y−Y1=Y0, this is the stated variance, including d=0, d=Y, Y1=0, and Y1=Y.

3.1A1F3F7step 1.1step 2.1algebrastep 1.2∎

In the sequential model, step 1.1 and the Yj=0 convention give E[Oj−Ej∣Hj−1]=0, and step 2.1 gives conditional variance Vj. Since wj is Hj−1-measurable, Dj has conditional mean zero and conditional second moment wj2Vj. The stated integrability condition makes each Dj square-integrable. If k<j, the filtration property and the revelation convention make Dk Hj−1-measurable, so E[DkDj]=E[Dk E(Dj∣Hj−1)]=0. Expanding the finite sum's variance therefore yields both sequential identities.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform convergence of the risk-set treatment fraction

Statement

For each g∈{0,1}, let (Ugi)i≥1 be IID measurable [0,∞)-valued observed times with law Pg; independence between the two groups is not required. Along a sequence of deterministic positive sample sizes, let n=n0+n1→∞ and ng/n→ρg∈(0,1), where ρ0+ρ1=1. Set sg(t):=Pg(Ug1≥t), yg(t)=ρgsg(t), and y(t)=y0(t)+y1(t). Assume inf⁡0≤t≤τy(t)>0. Write Yg,n(t)=∑i=1ng1{Ugi≥t},pn(t)={Y1,n(t)/(Y0,n(t)+Y1,n(t)),Y0,n(t)+Y1,n(t)>0,0,Y0,n(t)+Y1,n(t)=0. Then, for g=0,1, sup⁡t≤τ∣Yg,n(t)n−yg(t)∣⟶P0, and sup⁡0≤t≤τ∣pn(t)−zˉ(t)∣⟶P0,zˉ(t):=y1(t)y(t).

Facts & Assumptions

Given: The within-group IID observed-time sequences, the deterministic allocation limits and positive pooled support in the Statement, and the groupwise uniform empirical-risk convergence.

[F1]

Uniform convergence of empirical risk-set fractions: for each group, sup⁡t≤τ∣Yg,n(t)/ng−sg(t)∣→P0.

[F2]

Two-group logrank and weighted logrank scores: Yg,n(t) counts subjects with observed time at least t; risk at event time is counted immediately before failures at that time.

[A1]

The pooled limiting risk fraction obeys inf⁡t≤τy(t)=m>0.

Proof

1.1F1givenalgebra

By [F1], for each g, sup⁡t≤τ∣Yg,n(t)n−yg(t)∣≤∣ngn−ρg∣sup⁡t≤τYg,n(t)ng+ρgsup⁡t≤τ∣Yg,n(t)ng−sg(t)∣⟶P0. The first term tends to zero deterministically, and the empirical fraction in the second term is at most one. Hence the pooled fraction Yn(t)/n converges uniformly in probability to y(t) and the group-1 fraction Y1,n(t)/n converges uniformly to y1(t).

2.1F2A1step 1.1algebra∎

On the event inf⁡t≤τYn(t)/n≥m/2, whose probability tends to one by [A1] and step 1.1, the denominator is positive for all t≤τ. There, ∣Y1,n(t)Yn(t)−y1(t)y(t)∣≤2m∣Y1,n(t)n−y1(t)∣+2m∣Yn(t)n−y(t)∣, because 0≤y1(t)/y(t)≤1. Taking suprema and using step 1.1 proves convergence to zero in probability. The convention pn=0 on an empty risk set is immaterial on this event.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The logrank ordering gives a valid Fisher randomization p-value

Statement

Fix a finite randomized treatment-assignment model with allowed assignments Z and known law p, with unit set I as in Finite randomized treatment-assignment models. Fix a map γ:Z→{0,1}I assigning each allowed assignment a binary logrank group map. For each subject i, let (Ui(z),δi(z))∈[0,τ]×{0,1} be the full right-censored record under assignment z. Assume the record sharp null: for every i, the pair (Ui(z),δi(z)) is constant over all z∈Z. Fix before observing assignment or records a bounded logrank weight rule and the two-sided ordering T(z)=∣Uw(γ(z);U,δ)∣.

The inclusive assignment-tail p-value prand(z):=∑z′∈Zp(z′)1{∣Uw(γ(z′);U,δ)∣≥∣Uw(γ(z);U,δ)∣} is superuniform under the assignment law, so it is a valid finite-sample p-value for the record sharp null. If an auxiliary V is independent of the assignment and uniform on [0,1], replacing the inclusive tail by the strict-tail mass plus V times the tied-score mass gives an exactly uniform p-value. The result uses the actual assignment probabilities and asserts no validity under a weak average-effect null or under an equal-hazard null alone.

Facts & Assumptions

Given: A finite assignment law, a fixed binary group map for every allowed assignment, a fixed horizon, a predeclared weighted logrank ordering, a record sharp null, and optionally an independent uniform tie randomizer.

[F1]

Finite randomized treatment-assignment models: the experimental units and potential-outcome schedule are fixed, the assignment Z has the declared finite law p, and each unit's response under an assignment is defined for every allowed assignment.

[F2]

Fisher sharp null and predeclared test orderings: a Fisher sharp null fixes each unit's response under every allowed assignment, and the ordering score is fixed before assignment and response inspection.

[F3]

Two-group logrank and weighted logrank scores: for a fixed right-censored record and binary group map γ(z), the weighted score is the finite sum ∑jwj(Oj−Ej); the two-sided ordering uses its absolute value and includes event-time ties by the stated risk-set rule.

[F4]

Statistics and estimators: a statistic is a measurable map from the experiment's data space to its target measurable space.

[F5]

Fisher sharp-null randomization p-values are valid: for any predeclared real-valued ordering score in a finite assignment model, the inclusive weighted assignment tail is superuniform under the Fisher sharp null, and an independent uniform tie randomizer gives an exactly uniform value.

[F6]

Valid p-values: a p-value is valid for a null when its probability of being at most u is at most u for every u∈[0,1] and every law in that null.

[A1]

When the randomized-tie version is used, V is independent of the assignment and has the uniform law on [0,1].

Proof

1.1F1F2givenconstruct

Encode each record by the real number Ri(z)=Ui(z)+(τ+1)δi(z). The event-record range [0,τ] and censor-record range [τ+1,2τ+1] are disjoint, so this map is injective and Borel, with a Borel inverse on its image. Under the record sharp null, every encoded response Ri(z) is constant over all assignments. Hence the scalar schedule (Ri(z))i∈I satisfies the Fisher sharp null of [F2] within the finite assignment model [F1].

2.1F2F3F4step 1.1construct

On encoded response vectors whose coordinates lie in the image of the record encoding, decode the records and evaluate the fixed weighted logrank score using the candidate binary group map γ(z); define the score to be zero outside that image. This is a predeclared real-valued score on the finite assignment model. Its data space has the full power-set sigma-algebra, so every such map is measurable in the sense of [F4]. The absolute-score ordering includes ties and is fixed before assignment or records are inspected by [F2, F3].

3.1A1F5F6step 1.1step 2.1∎

Apply [F5] to this predeclared score and the actual finite assignment weights. Its inclusive tail is exactly the displayed prand, so for every u∈[0,1] its null probability of being at most u is at most u. Under [A1], the strict-tail mass plus V times the tied-score mass is exactly the randomized-tie p-value in [F5] and is uniform. By [F6], these bounds are precisely finite-sample p-value validity for the record sharp null. The proof uses no survival-law, censoring-independence, or Gaussian assumption; it makes no claim for a weaker null that does not fix every record.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Weighted logrank score expansion under a common-hazard model

Statement

Assume the Axiom of Choice. Let n0,n1 be deterministic, n=n0+n1, and let Zi=g for subject i in group g∈{0,1}. On a common finite-horizon filtration, each subject has the one-event process Ngi(t)=1{Ugi≤t, δgi=1},Ygi(t)=1{Ugi≥t}, and satisfies the separate counting-process contract Agi(t)=∫0tYgi(s)λ(s) ds,Mgi=Ngi−Agi, where λ is a common deterministic nonnegative hazard density with Λ(τ):=∫0τλ(s) ds<∞. Assume each Mgi is a square-integrable martingale under this contract, Ygi is predictable, and no two subjects have simultaneous event jumps. Write Ng,n and Yg,n for the group sums, Nn=N0,n+N1,n, and pn(t)=Y1,n(t)/(Y0,n(t)+Y1,n(t)), with pn(t)=0 on an empty pooled risk set.

Assume the observed-time and allocation hypotheses of Uniform convergence of the risk-set treatment fraction: within each group the observed times are IID, n→∞, ng/n→ρg∈(0,1), and, with yg(t)=ρgP(Ug1≥t) and y=y0+y1, inf⁡0≤t≤τy(t)>0. Set zˉ(t)=y1(t)/y(t). Let wn be a common predictable weight process with ∣wn(t)∣≤C and a measurable supremum satisfying sup⁡t≤τ∣wn(t)−w(t)∣→P0 for a deterministic bounded predictable weight w. Then the weighted logrank score satisfies Un,wnn=1n∑g=01∑i=1ng∫0τw(t)(g−zˉ(t)) dMgi(t)+oP(1). In particular, fixed deterministic bounded predictable weights are included by taking wn=w.

Facts & Assumptions

Given: A finite horizon, two fixed groups, the common-hazard model contract for each subject, no simultaneous event jumps, the uniform risk-fraction limit, and the bounded predictable weight sequence in the Statement.

[A1]

Assume the Axiom of Choice, inherited from the continuous-time martingale, bracket, and L2-integral interfaces. (The Axiom of Choice)

[F1]

Simple counting-process intensity and compensator contract: for a simple counting process, A=∫Yλ is continuous and has finite expectation, and the model separately assumes M=N−A is a square-integrable martingale.

[F2]

L² counting-process integral when the limit exists: a predictable H with E∫H2 dA<∞ has an integral defined by L2 limits of bounded predictable step integrals when the limit exists.

[F3]

Brackets of a compensated simple counting process: under the counting-process contract, M2−A is a martingale and ⟨M⟩=A.

[F4]

L² extension of the predictable counting-process integral: every predictable finite-energy integrand has a square-integrable martingale integral with E(∫H dM)2=E∫H2 dA.

[F5]

Uniform convergence of the risk-set treatment fraction: pn converges uniformly in probability to zˉ on [0,τ].

[F6]

Two-group logrank and weighted logrank scores: Un,wn=∑jwn(tj)(Oj−Ej) with Ej=djY1,n(tj)/Yn(tj).

Proof

1.1A1F1F2F6givenalgebra

Each Ygi is predictable by assumption. Sums of these processes are predictable, and the ratio map (a,b)↦a/b for b>0, extended by zero when b=0, is Borel; hence pn is predictable. At an event time tj, the Stieltjes increment of N1,n is Oj and that of Nn is dj. Therefore [F6] gives Un,wn=∫0τwn(t){dN1,n(t)−pn(t)dNn(t)}. Using dNgi=dMgi+Ygiλ(t) dt, the compensator part equals wn(t){Y1,n(t)−pn(t)(Y0,n(t)+Y1,n(t))}λ(t) dt=0. Thus, with Mn=∑g,iMgi, Un,wn=∑g,i∫0τwn(t)(g−pn(t)) dMgi(t).

2.1A1F2F3F4F5step 1.1

No simultaneous event jumps make Nn=∑g,iNgi a simple unit-jump counting process. Its compensator is the continuous process An=∑g,iAgi, and Mn=Nn−An=∑g,iMgi is a square-integrable martingale by finite summation. Also An(τ)≤nΛ(τ) pathwise. By [F3], Mn2−An is a martingale; [F2]-[F4] apply to the common predictable integrand Hn=wn(pn−zˉ), whose compensator energy is finite. The isometry gives E[{1n∫0τwn(pn−zˉ) dMn}2]≤C2Λ(τ) E ⁣[sup⁡t≤τ∣pn(t)−zˉ(t)∣2]⟶0. The last expectation tends to zero because the supremum is bounded by one and converges to zero in probability by [F5]. Replacing pn by zˉ therefore changes Un,wn/n by oP(1).

3.1A1F1F2F3F4givenstep 2.1algebra∎

For the remaining weight replacement, put Dn=∑g,i∫0τ(wn−w)(g−zˉ) dMgi. Since g is constant within each group, Dn=∫0τ(wn−w)(1−zˉ) dM1,n−∫0τ(wn−w)zˉ dM0,n. Each group aggregate has a simple counting process, continuous compensator, and square-integrable martingale because there are no simultaneous event jumps within that group. Applying [F2]-[F4] to each aggregate and using (a−b)2≤2a2+2b2 yields E[(Dn/n)2]≤2Λ(τ) E ⁣[sup⁡t≤τ∣wn(t)−w(t)∣2]⟶0. Boundedness of wn and w makes the squared supremum bounded, so its convergence in probability implies convergence of its expectation. Combining the risk-fraction replacement in step 2.1 with this weight replacement proves the stated expansion. No martingale process central limit theorem is used.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Consistency of the weighted logrank variance estimate

Statement

Assume the two-group common-hazard model with finite-horizon predictable risk processes and the explicit square-integrable martingale contracts Mgi=Ngi−Agi, Agi(t)=∫0tYgi(s)λ(s) ds; assume no simultaneous event jumps. Let Yg,n=∑iYgi, Yn=Y0,n+Y1,n, and assume the uniform risk-fraction convergence Yn/n→y and pn=Y1,n/Yn→zˉ in probability on [0,τ], with pn=0 on an empty risk set (as proved in Uniform convergence of the risk-set treatment fraction). Let wn→w uniformly in probability, where the predictable weights are uniformly bounded and w is deterministic. Suppose event times are continuous, so every observed failure time has dj=1 almost surely. Here V^n,wn is the plug-in statistic defined in Two-group logrank and weighted logrank scores; the claim is its asymptotic consistency and does not assert an exact finite-sample conditional variance law. Here y0,y1 are deterministic nonnegative Borel functions, y=y0+y1, inf⁡0≤t≤τy(t)>0, and zˉ=y1/y. Define σw2:=∫0τw(t)2y0(t)y1(t)y(t)λ(t) dt. Then the weighted plug-in variance sum from Two-group logrank and weighted logrank scores satisfies V^n,wnn⟶Pσw2.

Facts & Assumptions

Given: The model and convergence hypotheses in the Statement, with finite horizon and Λ(τ)<∞.

[A1]

Assume the Axiom of Choice inherited from the counting-process martingale and integral interfaces. (The Axiom of Choice)

[F1]

Two-group logrank and weighted logrank scores: V^n,wn=∑jwn(tj)2Vj and Vj is the stated conditional risk-set variance.

[F2]

Two-group logrank and weighted logrank scores: the plug-in contribution is Vj=Y1,n(tj)Y0,n(tj)dj(Yn(tj)−dj)/(Yn(tj)2(Yn(tj)−1)) for Yn(tj)>1, and zero for Yn(tj)=1.

[F3]

Uniform convergence of the risk-set treatment fraction: pn→zˉ and Yn/n→y uniformly in probability on [0,τ].

[F4]

Simple counting-process intensity and compensator contract: for the aggregate simple process the compensator is An=∫Ynλ and Mn=Nn−An is a square-integrable martingale under the separately stated model contract.

[F5]

Brackets of a compensated simple counting process: Mn2−An is a martingale and its predictable bracket is An.

[F6]

L² extension of the predictable counting-process integral: for predictable h with finite compensator energy, E(∫h dMn)2=E∫h2 dAn.

Proof

1.1F1F2given

Since dj=1, the variance formula [F2] reduces to Vj=Y1,n(tj)Y0,n(tj)/Yn(tj)2=pn(tj)(1−pn(tj)) when Yn(tj)>1. If Yn(tj)=1, both groups' product is zero and [F1] assigns variance zero. Thus V^n,wnn=1n∫0τwn(t)2pn(t)(1−pn(t)) dNn(t).

2.1F1F3givenstep 1.1algebra

Uniform convergence of wn to w and of pn to zˉ, together with their uniform bounds, gives sup⁡t≤τ∣wn(t)2pn(t)(1−pn(t))−w(t)2zˉ(t)(1−zˉ(t))∣→P0. Because Nn(τ)≤n, replacing the integrand in step 1.1 by h(t):=w(t)2zˉ(t)(1−zˉ(t)) changes the normalized integral by at most this supremum, hence by oP(1).

3.1A1F4F5F6givenstep 2.1

The aggregate process Nn is simple because no two subjects jump simultaneously, and An(τ)≤nΛ(τ). The deterministic h is bounded and predictable, so [F4]-[F6] give E[{1n∫0τh(t) dMn(t)}2]=1n2E∫0τh(t)2 dAn(t)≤∥h∥∞2Λ(τ)n⟶0. Hence the martingale part of the normalized variance sum tends to zero in probability.

4.1F3givenstep 1.1step 2.1step 3.1algebra∎

The compensator part of that sum is 1n∫0τh(t) dAn(t)=∫0τh(t)Yn(t)nλ(t) dt. Uniform convergence of Yn/n to y and ∫0τλ(t) dt<∞ make this converge in probability to ∫0τh(t)y(t)λ(t) dt. Since zˉ=y1/y, the limit is ∫0τw(t)2y0(t)y1(t)y(t)−1λ(t) dt=σw2. Combining this with steps 2.1 and 3.1 proves the assertion.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Terminal normal limit for weighted logrank scores

Statement

Assume the Axiom of Choice. For g∈{0,1}, let (Tgi,Cgi)i≥1 be IID within group, with Tgi,Cgi∈[0,∞) almost surely and the two group families independent. Assume conditional independent censoring Tgi⊥Cgi∣g, and a common absolutely continuous event-time law with hazard density λ on [0,τ], where Λ(τ)=∫0τλ(t) dt<∞. Censoring distributions may differ between groups. Use the horizon-truncated record Ugi:=min⁡(Tgi,Cgi,τ) and δgi:=1{Tgi≤Cgi, Tgi≤τ}, which lies in [0,τ]×{0,1} as required by Two-group logrank and weighted logrank scores.

For deterministic positive sample sizes ng along a sequence with n=n0+n1→∞ and n1/n→ρ∈(0,1), set ρ1=ρ, ρ0=1−ρ, yg(t)=ρgP(Ug1≥t), y(t)=y0(t)+y1(t), and zˉ(t)=y1(t)/y(t). Assume inf⁡t≤τy(t)>0. For each subject define Ngi(t)=1{Ugi≤t,δgi=1} and Ygi(t)=1{Ugi≥t}. Under one common filtration, assume Ygi is predictable and, separately, that Agi(t)=∫0tYgi(s)λ(s) ds,Mgi=Ngi−Agi satisfies the finite-horizon square-integrable martingale contract of Simple counting-process intensity and compensator contract. Assume no two subjects have simultaneous event jumps. Conditional independent censoring and the displayed hazard are scientific model premises; they are not used as substitutes for the explicit martingale contract.

Use Un,wn and V^n,wn as defined in Two-group logrank and weighted logrank scores. Let wn be a common predictable weight sequence with ∣wn∣≤C and a measurable supremum satisfying sup⁡t≤τ∣wn(t)−w(t)∣→P0 for a deterministic bounded Borel predictable weight w. Define σw2:=∫0τw(t)2y0(t)y1(t)y0(t)+y1(t)λ(t) dt. Then Un,wnn⇒N(0,σw2). If σw2>0, define the standardized statistic as Un,wn/V^n,wn when the denominator is positive and assign any fixed finite value on the event that it is zero. Every such extension converges to N(0,1). If σw2=0, only the degenerate score limit is asserted. For a fixed deterministic weight, take wn=w. This is a terminal finite-dimensional limit; it asserts no process central limit theorem.

Facts & Assumptions

Given: Assume AC; two independent IID groups of subject records, deterministic allocation fractions tending to ρg∈(0,1), equal continuous event hazard, group-conditional independent censoring, the explicit counting-process contracts and no-simultaneous-jump condition, positive pooled risk support, finite Λ(τ), and the bounded predictable weights in the Statement.

[A1]

Assume the Axiom of Choice (AC), inherited from the counting-process integral and independent-groups terminal-limit suppliers. (The Axiom of Choice)

[A2]

Since each Ugi is the same measurable function of its within-group IID pair (Tgi,Cgi), the observed times are IID within each group. The deterministic allocation limits and positive pooled-risk bound in the Statement therefore meet the hypotheses of Uniform convergence of the risk-set treatment fraction, which supplies the uniform risk-fraction limits required by [F4] and [F5].

[F1]

Identical distribution and IID families: within each group the subject records share one law and are mutually independent.

[F2]

Independent families of event classes: independence of the two subject families means every finite choice of events from distinct subjects has product probability.

[F3]

Two-group logrank and weighted logrank scores: Un,wn and V^n,wn are the weighted risk-set score and its plug-in variance sum.

[F4]

Weighted logrank score expansion under a common-hazard model: under its stated martingale, risk-fraction, no-simultaneous-jump, and weight hypotheses, Un,wn/n=n−1/2∑g=01∑i=1ngϕg(Ugi,δgi)+oP(1), where ϕg=∫0τw(t)(g−zˉ(t)) dMgi(t).

[F5]

Consistency of the weighted logrank variance estimate: V^n,wn/n→Pσw2 under its stated continuous-event and plug-in variance hypotheses.

[F6]

Independent-group terminal influence limit: for a fixed finite number of independent IID groups, centered square-integrable measurable group influences and a separately established terminal expansion imply a Gaussian limit with covariance ∑gρg−1Σg.

[F7]

Simple counting-process intensity and compensator contract: Mgi=Ngi−Agi is a square-integrable martingale under the explicit model contract, and Agi=∫Ygiλ.

[F8]

L² counting-process integral when the limit exists: predictable integrands of finite compensator energy have the stated L2 counting-process integral when the approximating integrals converge.

[F9]

L² extension of the predictable counting-process integral: the integral is a square-integrable martingale and E(∫H dM)2=E∫H2 dA for finite-energy predictable H.

[F10]

Covariance matrix of a finite-dimensional random vector: for a centered square-integrable scalar, its covariance is its second moment.

[F11]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: a nonnegative measurable integrand may be integrated in either order on the product space.

[F12]

Expectations factor over finite products of independent random variables: expectations of products of finitely many independent integrable real random variables factor into the product of their expectations.

[F13]

Variance of a finite sum as the sum of all variances and covariances: the variance of a finite sum is the sum of its variances and pairwise covariance terms.

[F14]

Markov's inequality for random variables: for X≥0 and a>0, P(X≥a)≤E[X]/a.

[F15]

Dominated convergence: pointwise convergence under one integrable majorant permits passage to the limit in the integral.

[F16]

Stochastic order and convergence notation for finite-dimensional random vectors: Xn=OP(1) means its tails are bounded in probability, and Xn=oP(1) means convergence in probability to zero.

[F17]

Standard normal and normal laws: N(0,v) is the law of vZ for Z∼N(0,1), including v=0.

[F18]

Vector Slutsky theorem: weak convergence is preserved after adjoining a quantity converging in probability to a constant and applying a continuous map.

Proof

1.1A1F1F2F7F8F9given

Put hg(t)=w(t)(g−zˉ(t)). For a subject record (u,δ), define the real map ϕg(u,δ)=1{δ=1, u≤τ}hg(u)−∫0u∧τhg(t)λ(t) dt. The deterministic integrand is bounded and Borel, so its indefinite integral is Borel and this map is measurable. From the definitions of Ngi, Ygi and Agi, this is exactly ∫0τhg(t) dMgi(t). Its energy is at most ∥hg∥∞2Λ(τ); [F8] and [F9] therefore make it square-integrable and centered. It is the same measurable function of each subject record within group g, so [F1] makes the transformed records IID within group and [F2] makes the two groups independent.

2.1F9F11givenstep 1.1algebra

By [F9] and [F11], E[ϕg2]=∫0τw(t)2(g−zˉ(t))2P(Ug1≥t)λ(t) dt. Multiplying by ρg and summing over g=0,1 gives ∑g=01ρgE[ϕg2]=∫0τw(t)2{y1(t)(1−zˉ(t))2+y0(t)zˉ(t)2}λ(t) dt=σw2, where the last equality follows by substituting zˉ=y1/(y0+y1). The integral is finite since w is bounded, 0≤yg≤1, and Λ(τ)<∞.

2.2F1F12F13F14F15F16step 1.1

Fix ϵ>0. Since ng→∞, the integrand ϕg21{∣ϕg∣>ϵng} tends pointwise to zero and is bounded by the integrable ϕg2. [F15] gives ngP(∣ϕg∣>ϵng)≤ϵ−2E[ϕg21{∣ϕg∣>ϵng}]⟶0. Thus each group satisfies the finite-variance no-large-jump condition. Also, for Sg,n=ng−1/2∑i=1ngϕg(Ugi,δgi), [F1] and [F12] make the cross covariances zero, and [F13] gives E[Sg,n2]=E[ϕg2]. Applying [F14] to Sg,n2 yields P(∣Sg,n∣>M)≤E[ϕg2]/M2; hence Sg,n=OP(1) by [F16].

3.1A2F3F4F6step 2.2algebra

By [A2], the risk-fraction hypotheses used by [F4] hold. Let θ^n=Un,wn/n and set θ=0. By [F4], n(θ^n−θ)=n−1/2∑g=01∑i=1ngϕg(Ugi,δgi)+oP(1). Set ψg=ρgϕg. The group-sum term in [F6] is Sn∗=∑g=01nng 1ng∑i=1ngψg(Ugi,δgi). Its difference from n−1/2∑g,iϕg(Ugi,δgi) equals ∑g=01nng(ρg−ngn)Sg,n=oP(1), because Sg,n=OP(1) by step 2.2, ng/n→ρg>0, and there are only two groups. Thus the expansion required by [F6] is established with centered group influences ψg.

4.1A1F6F10step 1.1step 2.1step 3.1

Each ψg is centered and square-integrable by step 1.1, and Var⁡(ψg)=ρg2E[ϕg2] by [F10]. The covariance in [F6] is therefore ∑g=01ρg−1Var⁡(ψg)=∑g=01ρgE[ϕg2]=σw2 by step 2.1. Applying [F6] to the proved expansion in step 3.1 yields Un,wn/n⇒N(0,σw2).

5.1A2F5F17F18step 4.1∎

Suppose σw2>0 and put Vn=V^n,wn/n. By [A2] and [F5], Vn→Pσw2, so P(Vn>σw2/2)→1. The function (x,v)↦x/max⁡(v,σw2/2) is continuous everywhere. Apply [F18] and this map to the score limit and Vn; the result converges to Z/σw for Z∼N(0,σw2), which has law N(0,1) by [F17]. On {Vn>σw2/2} this map equals the stated standardized statistic. Since the complement has probability tending to zero, changing the statistic there has no effect on weak convergence, including any fixed finite extension on the zero-denominator event. When σw2=0, step 4.1 gives the degenerate score law and no standardized conclusion.

5 · Examples, counterexamples and false statements

None yet.

Sources