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.

Exact equality null versus weak parameter null

Example

For the sample-mean kernel h(x,y)=x−y, compare two cases. First take P=Q equal to the Rademacher law. Second take the distinct laws P({−1,1})=(1/2,1/2) and Q({−2,0,2})=(1/4,1/2,1/4). Both cases satisfy the weak parameter null EPX−EQY=0, but only the first has an invariant pooled law under all label permutations. In both cases use the usual sample variances as σ^m2,σ^n2 in Studentized two-sample U-statistic and permutation distribution, and take m/N→1/2. For a group W1,…,Wk, put Wˉk=k−1∑i=1kWi and σ^k2=(k−1)−1∑i=1k(Wi−Wˉk)2.

Facts & Assumptions

Given: The two law pairs and the mean-difference kernel in the Example.

[F1]

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

[F2]

Finite-sample exactness under equal distributions: when P=Q, the inclusive permutation p-value is superuniform and independent-uniform tie randomization is exact.

[F3]

Studentized permutation validity under mixed-assignment centering: under a weak mean-difference null with the stated moment, variance, and studentizer conditions, studentization gives asymptotic standard-normal permutation and sampling limits.

[F4]

Studentized two-sample U-statistic and permutation distribution defines the statistic using the two nonnegative variance estimates and its zero-denominator convention.

[F5]

Chebyshev's inequality on a finite probability space proves consistency of bounded finite-support sample means and second moments.

[A1]

AC is assumed by the asymptotic permutation limit result [F3]. The Axiom of Choice

Verification

Given: AC, the law pairs, h(x,y)=x−y, the sample-variance estimators, and m/N→1/2. Verify the shared parameter null and distinguish their invariance conditions.

1.1F1givenalgebra

In both cases, EPX=EQY=0, so [F1] gives θ=0. The kernel is antisymmetric, and for either assignment of P and Q to its two arguments its mean is 0−0=0. All mixed second moments are finite and positive because the two laws have finite positive variances.

1.2F2givenalgebra

In the first case P=Q, so the joint law of the pooled IID sample is invariant under coordinate permutations; [F2] gives finite-sample superuniformity and exactness after tie randomization. In the second case P≠Q (for example, P(X=0)=0 and Q(Y=0)=1/2), so swapping coordinates across groups does not preserve the sampling law. The parameter null alone therefore does not supply the finite-sample exchangeability premise of [F2].

2.1A1F3F4F5givenalgebra∎

Under AC [A1], in each case the two population variances are positive, and the pooled-mixture variance is positive. For any bounded law R, [F5] applied to W and W2 shows that their sample averages converge to ERW and ERW2; the identity Var⁡^(W)=kk−1{W2‾−Wˉ2} then proves sample-variance consistency. For the triangular pooled laws PˉN, the same Chebyshev bounds are uniform because the support stays in {−2,−1,0,1,2}, and their variances converge to 1 in the first case and 32 in the second. Thus the estimators in [F4] satisfy the conditions of [F3]. In the second case, studentization has the asymptotic standard-normal calibration even though finite-sample group exchangeability is absent.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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