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.

✓ 4 results · all verified · 3 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.

IID bootstrap and jackknife for smooth statistics — Examples

1 · Prerequisites

2 · Summary

These examples apply the smooth-mean theorem, exhibit bootstrap failure at a nondifferentiable kink, compute a discrete median bootstrap with tied support, and verify the exact delete-one jackknife identity for the sample mean.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The delete-one jackknife variance for a sample mean

Example

For real data X1,…,Xn with n≥2, take g(x)=x. The delete-one pseudovalues are exactly the observations, and the jackknife variance estimate is the usual sample variance divided by n.

Facts & Assumptions

Given: Real data X1,…,Xn, n≥2, the delete-one definitions, and the estimator g(x)=x, so θ^n=Xˉn and θ^n,(−i)=Xˉn,(−i).

[F1]

For n≥2, define θˉn,(−)=n−1∑iθ^n,(−i), pn,i=nθ^n−(n−1)θ^n,(−i), and VJ,n=(n−1)n−1∑i(θ^n,(−i)−θˉn,(−))2. These are the finite-sample delete-one pseudovalues and jackknife variance; their definitions require no IID or moment assumptions.

[F2]

The delete-one mean is Xˉn,(−i)=(nXˉn−Xi)/(n−1). IID empirical bootstrap sample and mean statistic

Verification

1.1F2givenalgebra

By [F2], Xˉn,(−i)=Xˉn−(Xi−Xˉn)/(n−1). Averaging over i gives θˉn,(−)=Xˉn, since ∑i(Xi−Xˉn)=0.

2.1F1step 1.1algebra∎

Substitution into [F1] gives pn,i=Xi and VJ,n=n−1n∑i(Xˉn−Xin−1)2=1n(n−1)∑i(Xi−Xˉn)2. Thus VJ,n=sn2/n, where sn2=(n−1)−1∑i(Xi−Xˉn)2 is the unbiased sample variance.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Discrete median bootstrap with ties

Example

Use the lower empirical median, defined as the second order statistic for a sample of size three, and consider observed data (0,0,1). Enumerating all 33=27 bootstrap index tuples gives the exact conditional bootstrap law and demonstrates how the declared lower-quantile convention handles ties. The percentile and basic procedures below are endpoint algorithms, not coverage assertions.

Facts & Assumptions

Given: The observed sample (0,0,1), its empirical masses Pn({0})=2/3 and Pn({1})=1/3, the finite-index empirical bootstrap, and the interval algorithms.

[F1]

Conditional bootstrap coordinates are IID from the empirical law. Finite-index bootstrap draws are conditionally IID from the empirical law

[F2]

The lower empirical quantile returns the order statistic with index max⁡(1,⌈Bp⌉). Lower empirical quantile of bootstrap values

[F3]

The percentile interval returns the two empirical bootstrap quantiles at α/2 and 1−α/2. Percentile bootstrap interval

[F4]

The basic interval reflects those two bootstrap quantiles about the observed estimate. Basic bootstrap interval

Verification

1.1F1givenalgebra

By [F1], the number K of ones in a size-three bootstrap sample has the binomial law with parameters 3 and 1/3. The lower median is 1 exactly when K≥2, so P∗(bootstrap median=1∣0,0,1)=(32)(1/3)2(2/3)+(1/3)3=7/27. The other 20 of the 27 equally likely index tuples give median 0.

2.1F2F3F4step 1.1givenalgebra∎

List the 27 conditional median values with multiplicity: twenty zeros and seven ones. With α=1/3, [F2] gives Q27(1/6)=0 and Q27(5/6)=1. Thus [F3] returns [0,1], while [F4] with observed median 0 returns [−1,0]. These are the outputs under the specified tie and quantile conventions.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The IID bootstrap can fail at the kink of the absolute mean

Statement refuted

For every finite-variance IID law and every Borel plug-in map g whose sampling root n{g(Xˉn)−g(EX1)} has a continuous weak limit L, the conditional empirical-bootstrap root n{g(Xˉn∗)−g(Xˉn)} has CDF converging in probability to the CDF of L at every continuity point, even when g is not differentiable at EX1.

Facts & Assumptions

Given: Let Xi be IID Rademacher random variables with P(Xi=1)=P(Xi=−1)=1/2, and use their empirical bootstrap with g(x)=∣x∣. Thus μ=0 and Var⁡(Xi)=1.

[A1]

AC is assumed by the IID CLTs and standard normal law used in this counterexample. The Axiom of Choice

[F1]

For the empirical bootstrap mean with positive projected variance, its conditional CDF converges uniformly in probability to the corresponding normal CDF. Conditional IID bootstrap CLT for an empirical law

[F2]

The centered sample mean of a real IID law with mean zero and positive finite variance obeys the Lindeberg–Levy CLT. Lindeberg-Levy iid central limit theorem

[F3]

Continuous maps preserve convergence in distribution. Continuous mapping theorem

[F4]

If Un⇒U and Vn→c in probability, then Un+Vn⇒U+c. Slutsky's theorem for real random variables

[F5]

The standard normal CDF Φ is continuous and strictly increasing. Standard normal and normal laws The standard normal CDF is continuous and strictly increasing

Counterexample

1.1A1F2F3given

By [F2], Zn=n Xˉn⇒Z with Z∼N(0,1). Since absolute value is continuous, [F3] gives n∣Xˉn∣⇒∣Z∣. The limiting CDF of ∣Z∣ is continuous at 0 and equals P(∣Z∣≤0)=0.

1.2A1F1givenalgebra

Let Vn∗=n(Xˉn∗−Xˉn). Its conditional CDF Fn∗ satisfies Dn:=sup⁡t∣Fn∗(t)−Φ(t)∣→0 in probability by [F1]. The bootstrap root for g(x)=∣x∣ is Rn∗=n(∣Xˉn∗∣−∣Xˉn∣)=∣Zn+Vn∗∣−∣Zn∣. For fixed data value Zn=z≥0, the event Rn∗≤0 is −2z≤Vn∗≤0; for z<0, it is 0≤Vn∗≤−2z.

2.1F3F4F5step 1.1step 1.2given

For any interval [u,v], the difference between its conditional bootstrap probability and its standard normal probability is at most 2Dn: use Fn∗(v)−Fn∗(u−) and take left limits in the uniform CDF bound, using continuity of Φ. Therefore Qn:=P∗(Rn∗≤0∣X1,…,Xn)=Φ(2∣Zn∣)−12+oP(1). Indeed, the normal mass of either interval in step 1.2 is Φ(2∣z∣)−1/2. By [F3] and [F4], Qn⇒Φ(2∣Z∣)−1/2. This limit is positive with positive probability because P(∣Z∣≥1)>0 and [F5] gives Φ(2)−1/2>0. Thus Qn does not converge in probability to zero.

3.1F1F5step 1.1step 2.1∎

If the conditional bootstrap law consistently estimated the sampling law of n∣Xˉn∣, its conditional CDF at the continuity point 0 would converge in probability to the sampling limit CDF there, namely zero by step 1.1 and [F5]. Step 2.1 contradicts this. The failure occurs because g(x)=∣x∣ is not differentiable at the true mean 0.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The IID bootstrap for a smooth mean functional

Example

Let X1,X2,… be IID real random variables with mean μ and variance 0<σ2<∞, and estimate θ=μ by the sample mean. This is the smooth statistic g(x)=x in the theorem.

Facts & Assumptions

Given: The IID sample, finite positive variance, and ideal empirical bootstrap.

[A1]

AC is assumed as required by the multivariate and conditional IID CLTs used below. The Axiom of Choice

[F1]

For a Borel g, the estimator is g(Xˉn) and the bootstrap estimator is g(Xˉn∗). IID empirical bootstrap sample and mean statistic

[F2]

Under the stated moment and differentiability hypotheses, the centered sample and bootstrap roots have the same N(0,σ2) first-order limit. First-order IID bootstrap validity for smooth functions of a mean

Verification

1.1A1F1given

Here g(x)=x is Borel and differentiable everywhere with derivative a=1. Thus aTΣa=Var⁡(X1)=σ2∈(0,∞), so all assumptions of [F2] hold.

2.1A1F2step 1.1∎

Since θ^n=Xˉn and θ^n∗=Xˉn∗ by [F1], [F2] gives n(Xˉn−μ)⇒N(0,σ2) and the conditional law of n(Xˉn∗−Xˉn) converges weakly in probability to the same normal law. This is first-order distributional validity only.

Sources