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.

The one-sample Hotelling statistic has an exact F law

Statement

Assume AC, n>p≥1, and the iid multivariate-normal sample model with covariance Σ≻0. For μ0∈Rp, define T2=n(Xˉ−μ0)TS−1(Xˉ−μ0) when S≻0, and set T2=0 otherwise. Under H0:μ=μ0, n−pp(n−1)T2∼Fp,n−p. The zero extension does not change the law because S≻0 almost surely when n>p.

Facts & Assumptions

Given: AC, n>p≥1, an iid Np(μ,Σ) sample with Σ≻0, and the null μ=μ0.

[A1]

AC is used in the Gaussian and Wishart constructions. The Axiom of Choice

[F1]

The sample mean is independent of the centered scatter and (n−1)S∼Wp(Σ,n−1); for n>p, S≻0 almost surely. The Gaussian sample mean is independent of the Wishart sample scatter

[F2]

The Wishart law is the law of a sum of independent Gaussian outer products, with scale Σ and integer degrees of freedom. Wishart law by Gaussian outer products

[F3]

A Gaussian vector with covariance Σ is obtained by multiplying a standard normal by Σ1/2. Multivariate normal law, including singular covariance

[F4]

For independent W∼Wp(Ip,m) and Z∼Np(0,Ip) with m≥p, W≻0 almost surely and m−p+1pZTW−1Z∼Fp,m−p+1. The standard Wishart inverse quadratic form has an exact Fisher law

[F5]

The Fisher law has numerator and denominator degrees of freedom as given by its independent chi-square ratio definition. Student t and Fisher F laws Chi-square laws, including zero degrees

[F6]

Positive-degree chi-square variables are positive almost surely, so the Fisher denominator is positive. Positive-degree chi-square laws have a positive density and regular CDF

[F7]

Every positive-semidefinite symmetric matrix has a positive square root; if Σ≻0 and Σ1/2v=0, then vTΣv=∥Σ1/2v∥2=0, so the root is injective and hence invertible. A non-negative operator has a unique non-negative square root

[F8]

Measurable functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence

[F9]

The sample map S is continuous by the model definition, and Sylvester's criterion expresses S++p as finitely many strict polynomial inequalities; hence {S≻0} is Borel. Inversion is continuous on invertible matrices, and continuous Euclidean maps are Borel under countable choice, which follows here from AC. The iid multivariate-normal sample and covariance conventions Sylvester's criterion: a real symmetric n×n matrix with n≥1 is positive definite if and only if all leading principal minors are positive Continuous functions on Euclidean spaces are Borel measurable AC supplies countable selections and prescribed serial paths

Proof

1.1A1F1F2F3F7F8F9givenalgebra

The statistic T2 in the Statement is a random variable: by [F9], {S≻0} is Borel; on this set inversion is continuous, so the displayed quadratic form is Borel, and setting it to zero on the Borel complement preserves measurability. Let Z=n Σ−1/2(Xˉ−μ0). The positive root is invertible by [F7]; under the null, [F1] and [F3] therefore give Z∼Np(0,Ip). Moreover, Z and W:=Σ−1/2(n−1)SΣ−1/2 are independent: Xˉ and S are independent by [F1], and the separate whitening maps are continuous, hence Borel, so [F8] preserves independence. The congruence in [F1] and [F2] gives W∼Wp(Ip,n−1); it is positive definite almost surely by [F1].

2.1F1step 1.1algebra

On the event S≻0 (which has probability one by [F1]), substitute S=Σ1/2WΣ1/2/(n−1) and Xˉ−μ0=Σ1/2Z/n into the definition. Cancelling the inverse congruence gives T2=(n−1)ZTW−1Z.

3.1F1F4F5F6step 2.1algebra∎

Apply [F4] with m=n−1≥p. It gives n−ppZTW−1Z∼Fp,n−p. Multiplying the identity in step 2.1 by (n−p)/(p(n−1)) proves the asserted law. Since S≻0 almost surely, the off-domain zero convention affects only a null event.

Depends on

Used by

Dependency tree · two levels

66 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