Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

The sample mean attains the unrestricted mean bound

Example

Let P be any law on R with P[X2]<∞, let μ=PX, and consider the local model whose allowed paths are all bounded mean-zero tilts dPt,s=(1+ts)dP for sufficiently small t≥0. For ψ(Q)=QX, the sample mean Xˉn is regular along each allowed one-sided path (the centered root-n error has one common limit law for every fixed h≥0), and is asymptotically linear with influence function X−μ. Its asymptotic variance equals the unrestricted mean bound.

Facts & Assumptions

Given: A probability law P on R with P[X2]<∞, the stated bounded-score local model, and AC and Countable Choice.

[F1]

A dominated differentiable-in-quadratic-mean submodel: a supplied common-dominated one-sided path is DQM when its square-root densities have the stated L2(μ) first-order expansion.

[F2]

Pathwise differentiability and parameter influence curves: the tangent space is the closed L02(P) span of allowed scores, and a parameter influence curve represents the path derivative by P[ϕs].

[F3]

Asymptotically linear estimators and influence functions: asymptotic linearity means ψ^n−ψ(P)=(Pn−P)φ+oP(n−1/2) with φ∈L02(P).

[F4]

Multivariate iid central limit theorem: under AC, iid square-integrable vectors have their centered Gaussian limit, including singular covariance.

[F5]

A one-sided DQM path yields an iid LAN proxy: each bounded-score path has a mean-one local likelihood-ratio proxy with the Gaussian LAN expansion, an actual-law total-variation error tending to zero, and proxy-zero probability tending to zero.

[F6]

Le Cam's third lemma for a Gaussian likelihood-ratio limit: under the proxy law, a joint Gaussian limit shifts the statistic's mean by its covariance with the log likelihood ratio and preserves its covariance.

[F7]

Asymptotic linearity implies asymptotic normality: the estimator's base-law limit is normal with covariance equal to its influence-function covariance.

[F8]

Semiparametric information bound for regular asymptotically linear estimators: every regular asymptotically linear estimator has influence covariance at least the canonical-gradient covariance.

[F9]

Influence-curve representers form an affine orthogonal-complement class: the canonical gradient is the unique derivative representer in the tangent space; Countable Choice is assumed for its projection construction.

[F10]

Cauchy-Schwarz inequality for L2: the L2(P) pairing is continuous.

[F11]

Slutsky's theorem for real random variables and Cramer wold device: scalar oP(1) perturbations preserve projected limits, and all projection limits determine the vector limit.

[F12]

A uniform derivative bound gives a uniform Taylor remainder bound: if the second derivative is bounded on an interval, the first-order Taylor polynomial has a remainder bounded by a constant times the square of the displacement.

[A1]

The Axiom of Choice: AC is used by the iid CLT [F4]; the displayed tilt densities are explicit and require no selection.

[A2]

The Axiom of Countable Choice (ACω): Countable Choice is used for the tangent-space projection in [F9].

Verification

Given: P[X2]<∞, μ=PX, and the bounded-score path family in the example.

1.1F1F12givenalgebra

For each bounded s with Ps=0, choose t≥0 so small that ∣ts∣≤1/2 everywhere. On [−1/2,1/2], g(x)=1+x has g′′(x)=−1/(4(1+x)3/2), so ∣g′′(x)∣≤1. [F12] with n=1 gives 1+ts=1+t2s+O(t2∥s∥∞2) uniformly. The remainder is o(t) in L2(P), so this is a DQM path with score s. Its mean is ψ(Pt,s)=μ+tP[Xs], hence ψ˙P(s)=P[(X−μ)s].

1.2A2F2F9F10givenalgebra

Bounded centered functions are dense in L02(P): for g∈L02(P), the bounded functions gM=g1{∣g∣≤M}−P[g1{∣g∣≤M}] are centered and converge to g in L2(P) by truncation and Pg=0. Thus T=L02(P). By [F10], ψ˙P is continuous and is represented by ϕ=X−μ∈T; [F9] makes this the canonical gradient. Its covariance is Vcan=P[(X−μ)2]=σ2.

1.3A1F3F7givenalgebra

The identity Xˉn−μ=(Pn−P)(X−μ) proves exact asymptotic linearity with influence φ=X−μ. Therefore [F7] gives the base limit N(0,σ2).

1.4A1F4F5F6F11given

Fix a bounded centered score s and h≥0. Under the base law, the iid vectors (Xi−μ,s(Xi)) have finite second moment. By [F4], their normalized sums converge jointly to a centered Gaussian with covariance entries σ2, P[(X−μ)s], and P[s2]. The lemma [F5] also gives P(Ln=0)→0; set ℓn=log⁡Ln when Ln>0 and ℓn=0 otherwise, which changes the joint law only on an o(1)-probability event. Scalar Slutsky and Cramér–Wold [F11] give the joint Gaussian limit with ℓn; exponentiation gives the likelihood-ratio limit required by [F6]. The proxy limit of n(Xˉn−μ) is therefore N(hP[(X−μ)s],σ2), and total-variation closeness [F5] transfers it to the actual local law.

2.1F8step 1.2step 1.4givenalgebra∎

The target shift is exact: n{ψ(Ph/n,s)−μ}=hP[(X−μ)s]. Subtracting it from step 1.4 gives N(0,σ2) for every fixed h≥0, so the sample mean is regular on every allowed path. Its influence covariance is σ2=Vcan by step 1.2; [F8] shows it attains the regular asymptotically linear lower bound. This includes σ2=0, when both covariance matrices vanish.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

86 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