Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Studentized difference of means with equal means and unequal variances

Example

Assume AC. Let P assign probability 1/2 to each of −1,1, and let Q assign probability 1/2 to 0 and probability 1/4 to each of −2,2. Take h(x,y)=x−y, so r=1 and θ(P,Q;h)=μP−μQ. Let m/N→1/4. For a group W1,…,Wk, put Wˉk=k−1∑i=1kWi and σ^k2=(k−1)−1∑i=1k(Wi−Wˉk)2 for σ^m2 and σ^n2 in the studentized statistic.

Facts & Assumptions

Given: AC, the finite laws P,Q, kernel h(x,y)=x−y, and sample-size ratio p=1/4.

[F1]

Two-sample U-statistic parameter: θ(P,Q;h)=EPX−EQY.

[F2]

Two-sample order-r U-statistic and first projections: for r=1, Um,n=Xˉm−Yˉn, gX(x)=E[h(x,Y)]−θ, and gY(y)=E[h(X,y)]−θ.

[F3]

Permutation CLT for a two-sample U-statistic under mixed-assignment centering: under the all-assignment centered kernel premise, the raw permutation limit of mU has variance r2σPˉ2/(1−p).

[F4]

Studentized permutation validity under mixed-assignment centering: consistent direct and pooled-mixture variance estimates give standard-normal true and permutation limits.

[F5]

Moments, variance, and covariance on a probability space: variance is the expectation of the squared centered deviation.

[F6]

Chebyshev's inequality on a finite probability space: for a finite random variable, its sample-average deviation probability is bounded by its variance divided by the squared threshold.

[A1]

AC is assumed by the asymptotic permutation and sampling limit results [F3]–[F4]. The Axiom of Choice

Verification

Given: AC, P,Q,h, and p=1/4. Verify the weak null, projection conditions, studentizer consistency, and the unstudentized variance mismatch.

1.1F1F5givenalgebra

Both means are zero. The variances are σP2=1 and σQ2=2, so [F1] gives θ=0. The kernel is antisymmetric, and under every P/Q assignment its expectation is the difference of two zero means, hence zero. Its second moment is the sum of the two positive variances, so it is finite and strictly positive for every assignment.

1.2F5F6givenalgebra

For k observations W1,…,Wk, the sample variance is σ^k2=kk−1{k−1∑iWi2−(k−1∑iWi)2} for k≥2. Under either finite-support law P or Q, Chebyshev [F6] applied to the averages of Wi and Wi2 gives convergence in probability to their expectations, so σ^m2→1 and σ^n2→2. Under IID PˉN rows, ∣Wi∣≤2 uniformly in N, so the variances of both averages are bounded by constants divided by their row sizes; [F6] again gives convergence to their row expectations. These means are 0 and pN(1)+(1−pN)(2)→7/4, so both mixture-sample variance estimates converge to 7/4.

2.1F2F5step 1.1algebra

From [F2], gX(x)=x and gY(y)=−y, so their variances are 1 and 2. The pooled mixture has mean zero and variance σPˉN2=pNσP2+(1−pN)σQ2=2−pN→74. It is positive.

3.1A1F4step 1.1step 2.1step 1.2

Under AC [A1], the hypotheses of [F4] now hold, including positive direct and pooled projection variances, so the studentized statistic has standard-normal true-sampling and permutation limits. This example has a weak parameter null while P≠Q.

4.1A1F2F3step 2.1algebra∎

Under AC [A1], step 1.2 and [F4] give mVm,nSE→P1+p1−p2=5/3 and Sm,n⇒N(0,1) under the true sampling law. Thus mUm,n=(mVm,nSE)Sm,n⇒N(0,5/3) by Slutsky. The raw permutation limit instead has variance σPˉ21−p=7/43/4=73 by [F3]. To specify the resulting two-sided permutation test, let R^N(t)=Pπ(mUm,nπ≤t∣Z) and qN(u)=inf⁡{t:R^N(t)≥u}. For α∈(0,1), reject when mUm,n<qN(α/2) or mUm,n>qN(1−α/2). The conditional CDF convergence in [F3] to the continuous strictly increasing law N(0,7/3) implies qN(α/2)→P−z1−α/27/3 and qN(1−α/2)→Pz1−α/27/3. Since the true-sampling statistic converges to N(0,5/3) and this limit has no atoms at either limiting critical value, the rejection probability tends to P(∣N(0,5/3)∣>z1−α/27/3)=2(1−Φ(z1−α/275))<α, where z1−α/2>0 is the standard-normal quantile. Thus the unstudentized equal-tail permutation test is conservative in this example, and studentization corrects this variance mismatch.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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