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.
Permutation CLT for a two-sample U-statistic under mixed-assignment centering
Statement
Assume AC. Let be IID and independently let be IID , with , , and . Fix and a measurable kernel that is symmetric in each block and antisymmetric under block exchange. Assume for every assignment of independent P- and Q-distributed arguments to the positions that and . Let for , where is its first projection. Then the conditional permutation CDF of satisfies
Facts & Assumptions
Given: The sample, all-assignment centering and moment assumptions, and positive pooled projection variance in the Statement.
Permutation CLT for a two-sample U-statistic under a weak null gives the conditional permutation limit under the weak null, block antisymmetry, finite positive mixed second moments and positive pooled projection variance.
AC is inherited through [F1]. The Axiom of Choice
Proof
Given: The hypotheses in the Statement. Apply the general weak-null result.
The stated all-assignment assumptions include the weak null and every finite positive mixed second moment required by [F1]. Block symmetry, antisymmetry, proportional growth and positive pooled projection variance are the same hypotheses as in [F1].
Under AC [A1], apply [F1] to obtain the stated uniform conditional CDF limit and the identical scale . The additional assignment-wise centering assumptions cause no change in that scale.
Remarks
This is the all-assignment-centered specialization of the general weak-null theorem. Its extra centering assumptions are sufficient but are not needed by the locally proved permutation coupling.
Depends on
Used by
Dependency tree · two levels
10 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.