Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Delete-one jackknife linearization for smooth functions of a mean

Statement

Let Xi be IID Rd-valued vectors with E∥X1∥2<∞, μj=EX1j, and Σjk=E[(X1j−μj)(X1k−μk)] (Moments, variance, and covariance on a probability space). Let g:Rd→R be Borel and continuously Fréchet differentiable on an open neighborhood U of μ; this means its Fréchet derivative exists at every point of U and varies continuously there (Fréchet derivative between Banach spaces). For each x∈U, write the row representing Dg(x) in Euclidean coordinates as ∇g(x)T, and set a=∇g(μ); suppose 0<aTΣa<∞. For n≥2, set θ^n=g(Xˉn), θ^n,(−i)=g(Xˉn,(−i)), θˉn,(−)=n−1∑iθ^n,(−i), and VJ,n=n−1n∑i=1n(θ^n,(−i)−θˉn,(−))2,pn,i=nθ^n−(n−1)θ^n,(−i). Then 1n∑i=1n∣pn,i−{θ^n+aT(Xi−Xˉn)}∣2⟶0in probability,nVJ,n⟶aTΣain probability. The neighborhood C1 condition is used for the deletion secants; differentiability at μ alone is not asserted to give this jackknife conclusion.

Facts & Assumptions

Given: The IID vectors, finite second moment, local C1 map, and definitions in the statement.

[F1]

The data mean and empirical covariance converge in probability to μ and Σ. Finite-second-moment IID sample covariance converges

[F2]

A finite union has measure at most the sum of its measures. Finite and countable subadditivity of measures

[F3]

The delete-one mean equals Xˉn−(Xi−Xˉn)/(n−1). IID empirical bootstrap sample and mean statistic

[F5]

The derivative of a composition of Fréchet differentiable maps is the composition of their derivatives. Chain sum product and composition rules for Banach derivatives

Proof

1.1F1F2F3givenalgebra

By [F1], Xˉn→μ and n−1∑i∥Xi−Xˉn∥2=tr⁡(Σ^n) is bounded in probability. For each ε>0, [F2] and the finite second moment give P ⁣(max⁡i≤n∥Xi∥>εn)≤n P(∥X1∥>εn)≤E∥X1∥2ε2n⟶0. Therefore max⁡i∥Xi−Xˉn∥/(n−1)→0 in probability. Choose δ>0 so the closed Euclidean ball B‾(μ,2δ) is contained in U, and let En={∥Xˉn−μ∥≤δ, max⁡i∥Xi−Xˉn∥/(n−1)≤δ}. This is measurable and has probability tending to one by the preceding bounds. Extend ∇g by zero outside U to a Borel map ∇g~:Rd→Rd, and define ωn=max⁡i≤nsup⁡t∈Q∩[0,1]1En∥∇g~ ⁣(Xˉn−tXi−Xˉnn−1)−a∥. Each rational-indexed term is measurable, and the countable supremum is measurable because its strict superlevel sets are countable unions; the finite maximum is measurable as well. On En, every segment lies in B‾(μ,2δ)⊂U, where ∇g is bounded by continuity on this compact ball, and continuity along the segment makes the rational supremum equal the supremum over [0,1]. On Enc every term inside the supremum is zero. The greatest distance of any segment point from μ on En is at most ∥Xˉn−μ∥+max⁡i∥Xi−Xˉn∥/(n−1), which tends to zero in probability. Continuity of ∇g at μ and P(En)→1 therefore imply ωn→0 in probability.

2.1F4F5step 1.1givenchoosealgebra

On En, define φi(t)=g(Xˉn−t(Xi−Xˉn)/(n−1)) for 0≤t≤1. It is continuous on [0,1] and differentiable on (0,1) by [F5], with derivative −(n−1)−1∇g(Xˉn−t(Xi−Xˉn)/(n−1))T(Xi−Xˉn). By [F4] there is τi∈(0,1) at which this derivative equals φi(1)−φi(0). On every outcome define the measurable algebraic remainder en,i:=θ^n,(−i)−θ^n+aT(Xi−Xˉn)/(n−1). On En the mean-value identity expresses this remainder as −(∇g(Xˉn−τi(Xi−Xˉn)/(n−1))−a)T(Xi−Xˉn)n−1, so ∣en,i∣≤ωn∥Xi−Xˉn∥/(n−1). The points τi are used only for this pointwise identity and bound; no measurable selection is needed. Since P(En)→1, the expansion with the stated bound holds with probability tending to one.

3.1step 1.1step 2.1algebra

The algebraic definition of en,i gives pn,i=θ^n+aT(Xi−Xˉn)−(n−1)en,i. On En, the bound in step 2.1 makes the average squared error in the statement at most ωn2 1n∑i∥Xi−Xˉn∥2, which tends to zero in probability by step 1.1. Since P(Enc)→0, the stated convergence in probability follows.

4.1F1step 1.1step 2.1algebra∎

The algebraic definition of en,i gives, after averaging over i and using ∑i(Xi−Xˉn)=0, nVJ,n=1n−1∑i(aT(Xi−Xˉn)−(n−1)(en,i−eˉn))2, where eˉn=n−1∑ien,i. The leading quadratic term is 1n−1∑i{aT(Xi−Xˉn)}2=nn−1aTΣ^na⟶aTΣa by [F1]. On En, the normalized squared error term is bounded by (n−1)∑i(en,i−eˉn)2≤(n−1)∑ien,i2≤ωn21n−1∑i∥Xi−Xˉn∥2⟶0. If ψi=aT(Xi−Xˉn) and ri=(n−1)(en,i−eˉn), then on En the absolute cross term is at most 2(1n−1∑iψi2)(1n−1∑iri2), which tends to zero because the first factor converges to the finite aTΣa and the second to zero. Since P(Enc)→0, these bounds prove the jackknife variance limit in probability.

Depends on

Used by

Dependency tree · two levels

41 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