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.
Square ICA is identifiable up to signs and permutation with at most one Gaussian source
Statement
Let a probability law on admit two square independent-component representations and , with invertible . Suppose that the components of and are mutually independent, centered, and have unit variance, and that at most one component of is Gaussian. Then there is a signed-permutation matrix —a matrix with exactly one nonzero entry, equal to or , in each row and each column—such that and in distribution.
Statement references
Facts & Assumptions
Given: The two standardized square independent-component representations in the Statement, with at most one Gaussian coordinate of .
Square independent-component model with standardized sources gives independence, centering, unit variances, invertibility and the equality-in-law convention.
A shared column of an independent orthogonal mixing must be Gaussian shows that a non-Gaussian source column of an orthogonal matrix preserving coordinate independence has exactly one nonzero entry, equal to or .
Proof
Work on the probability space of and define . The given equality implies by applying the fixed invertible linear map to both laws. In particular the coordinates of are mutually independent, centered and have unit variance. Write , so on this probability space. Independence and centering give , and covariance under this linear map yields . Since is square and invertible, also ; it is orthogonal. This covariance calculation is the relative whitening reduction and requires neither a density nor moments beyond the given second moments.
By [F2], every non-Gaussian column of is a signed coordinate vector. Distinct such columns occupy distinct rows, because they are orthogonal. There are at least such columns. If there are they occupy all rows and is already a signed-permutation matrix. Otherwise there are exactly , leaving one row and the one possible Gaussian column . Its inner product with each occupied signed coordinate column is zero, so on every occupied row . Its norm is one, so or . Thus is a signed-permutation matrix also in this case. For the same argument has zero occupied rows and its single norm-one column is or .
Put , again a signed-permutation matrix. From and we get . Also . These are exactly the asserted matrix and source-law conclusions.
Remarks
The proof uses the finite-variance orthogonal characterization supplied locally, rather than the general Darmois–Skitovich theorem for arbitrary pairs of linear forms. No extra regularity, higher-moment, density or global characteristic-function nonvanishing assumption is imposed on either source representation. HKO §7.5–7.6, printed p. 163, states the precise at-most-one-Gaussian boundary but omits its proof; it serves as source documentation, not a proof premise.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The Elements of Statistical Learning, second edition, corrected 12th printing (standard reference, not scraped)
- Aapo Hyvärinen, Juha Karhunen, and Erkki Oja, Independent Component Analysis (standard reference, not scraped)