Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Uniform concentration of Gaussian sample partial correlations

Statement

Fix 0≤M<1. There are constants cM>0 and CM<∞ such that the following holds. Let X(1),…,X(n) be independent observations from a nondegenerate Gaussian law, and let i,j,S be as in the definitions of population and sample partial correlation. Suppose ∣ρij∣S∣≤M and n−∣S∣−3>0. Then, for 0<t≤1, P ⁣(∣g(ρ^ij∣S)−g(ρij∣S)∣>t)≤CMexp⁡ ⁣(−cM(n−∣S∣−1)t2), where g(r)=12log⁡((1+r)/(1−r)). The constants do not depend on i,j,S,n or the Gaussian mean and covariance beyond the bound M.

Facts & Assumptions

Given: A nondegenerate Gaussian law, independent observations, a pair i,j, a conditioning set S, the bound ∣ρij∣S∣≤M<1, and n−∣S∣−3>0.

[F1]

The population partial correlation is the normalized off-diagonal entry of the Gaussian conditional covariance block. Gaussian partial correlation

[F2]

Under a nondegenerate Gaussian law, the sample partial correlation is the correlation of the two residual columns after projection off the intercept and conditioning columns; the Fisher transform is g(r)=atanh⁡(r). Sample partial correlation by residualization

[F3]

The Gaussian conditional covariance block Kij∣S is positive definite. Zero Gaussian partial correlation is conditional independence

[F4]

A nondegenerate Gaussian vector has its usual Lebesgue density, so every proper linear subspace has probability zero. A positive-definite multivariate normal law has its Gaussian density

[F5]

A Gaussian vector has normal scalar linear projections with the corresponding projected means and variances. Multivariate normal law, including singular covariance

[A2]

AC is assumed by the supplied Gaussian probability interfaces. The Axiom of Choice

Proof

1.1givenF1F2F3F4F5A2algebra

Put Y=(Xi,Xj) and Z=XS. For nonempty S, define B=ΣY,SΣS,S−1 and U=Y−μY−B(Z−μS). Covariance algebra gives Cov⁡(U)=Kij∣S and Cov⁡(U,Z)=0. The vector (U,Z) is jointly Gaussian by [F5], since every scalar projection is an affine scalar projection of X. Its covariance is block diagonal and positive definite by [F3] and positive definiteness of ΣS,S. Its density from [F4] factors into the Gaussian densities of U and Z: both the determinant and the quadratic form split by blocks. Integrating over rectangles proves independence of U and Z. For empty S, take U=Y−μY with covariance Kij∣∅; independence from the empty conditioning tuple is automatic. Across observations the residual pairs are independent, and their entire sample is independent of the conditioning sample, because the joint observation densities multiply. The S coordinates have a nondegenerate Gaussian density because their covariance is a positive-definite principal submatrix. If ∣S∣=0, the intercept design has rank one. If s=∣S∣>0, successive independent sample points in Rs are affinely independent until there are s+1: after r≤s affinely independent points, their affine span has dimension r−1<s, and the next point has a density, so lies in that span with probability zero by [F4]. Thus the intercept and S design has rank s+1 almost surely. Conditional on that design, an orthonormal basis of its orthogonal complement has dimension m=n−∣S∣−1. In that basis the projected residual pairs are m independent copies of this Gaussian residual; standardizing the two coordinates does not change their sample correlation. Thus the sample partial correlation has the same distribution as Rm=∑r=1mUrVr(∑r=1mUr2)1/2(∑r=1mVr2)1/2,m=n−∣S∣−1, for m independent copies (Ur,Vr) of the standardized pair, whose correlation is ρ=ρij∣S by [F1]. The hypothesis gives m≥3. Their covariance block is positive definite by [F3], so the first residual sample column is nonzero almost surely, and conditional on that column the second has a density in Rm. Its probability of lying in the first column's one-dimensional span is zero by [F4], since m≥2. Thus the two residual columns have rank two almost surely. Together with the full-rank intercept and S design, this makes the centered sample covariance block on {i,j}∪S positive definite. Therefore Rm∈(−1,1) almost surely and the Fisher transform is defined.

2.1step 1.1F4constructalgebra

Represent Ur=Xr and Vr=ρXr+1−ρ2Er with independent standard normal vectors X,E∈Rm. Put A=∥X∥, Z=⟨E,X/A⟩, and W=∥E−ZX/A∥. Rotational invariance of the standard Gaussian density implies that A2∼χm2, Z∼N(0,1), and W2∼χm−12 are independent. Direct substitution gives Rm=qq2+W2,q=ρA1−ρ2+Z, and hence g(Rm)=arsinh⁡(q/W). Rotational invariance follows directly from the standard Gaussian density, and it makes A,Z,W independent. Also arsinh⁡(ρ/1−ρ2)=g(ρ).

3.1F1F2step 2.1algebra

Let B=M/1−M2 and L=4B+2. On the event ∣A/m−1∣≤δ,∣W/m−1∣≤δ,∣Z∣/m≤δ, where 0<δ≤1/2, one has ∣qW−ρ1−ρ2∣≤(2B+1)δ1−δ≤Lδ. Since ∣arsinh⁡′(x)∣=1/1+x2≤1, step 2.1 yields ∣g(Rm)−g(ρ)∣≤Lδ.

4.1step 2.1step 3.1F4algebra

For Q∼χk2, its moment generating function, obtained by multiplying the k one-dimensional Gaussian integrals, is EesQ=(1−2s)−k/2 for s<1/2. For δ>0, Markov's inequality optimized at s=δ/[2(1+δ)] gives P(Q/k≥1+δ)≤e−k(δ−log⁡(1+δ))/2. For 0<δ<1, the negative choice s=−δ/[2(1−δ)] gives P(Q/k≤1−δ)≤e−k(−δ−log⁡(1−δ))/2. Put δ+=2u+u2≤3 and δ−=2u−u2≥u. The inequalities δ−log⁡(1+δ)=∫0δx/(1+x) dx≥δ2/8 for 0≤δ≤3 and −δ−log⁡(1−δ)≥δ2/2 imply P(∣Q/k−1∣>u)≤2e−ku2/8(0<u<1). Applying this to A2 and W2, and using ∣(m−1)/m−1∣≤1/m≤δ/2, shows that ∣W/m−1∣>δ implies ∣W/m−1−1∣>δ/2. Thus for 2/m≤δ≤1/2, P(∣A/m−1∣>δ or ∣W/m−1∣>δ)≤4e−mδ2/64. The standard normal moment generating function EesZ=es2/2, with Markov's inequality optimized at s=δm, gives P(∣Z∣/m>δ)≤2e−mδ2/2. For 0<δ<2/m, the trivial bound 1≤6e−mδ2/64 applies. Thus the complement of the event in step 3.1 has probability at most 6e−mδ2/64 for every 0<δ≤1/2.

5.1givenstep 3.1step 4.1algebra∎

Set δ=t/L. Since L≥2 and 0<t≤1, step 3.1 applies and its complement contains the event in the Statement. Step 4.1 therefore bounds that event by 6exp⁡(−mt2/(64L2)). Taking CM=6 and cM=(64L2)−1 proves the claim.

Depends on

Used by

Cited to discharge well-definedness by Sample partial correlation by residualization.

Dependency tree · two levels

33 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