Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge 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.

Square ICA is identifiable up to signs and permutation with at most one Gaussian source

Statement

Let a probability law on Rp admit two square independent-component representations X=dAS and X=dA′S′, with invertible A,A′∈Rp×p. Suppose that the components of S and S′ are mutually independent, centered, and have unit variance, and that at most one component of S is Gaussian. Then there is a signed-permutation matrix Q—a matrix with exactly one nonzero entry, equal to 1 or −1, in each row and each column—such that A′=AQ and S′=QTS in distribution.

Facts & Assumptions

Given: The two standardized square independent-component representations in the Statement, with at most one Gaussian coordinate of S.

[F1]

Square independent-component model with standardized sources gives independence, centering, unit variances, invertibility and the equality-in-law convention.

[F2]

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 1 or −1.

Proof

1.1givenF1constructalgebra

Work on the probability space of S and define T=A′−1AS. The given equality AS=dA′S′ implies T=dS′ by applying the fixed invertible linear map A′−1 to both laws. In particular the coordinates of T are mutually independent, centered and have unit variance. Write O=A′−1A, so T=OS on this probability space. Independence and centering give Cov⁡(S)=Cov⁡(T)=Ip, and covariance under this linear map yields OOT=Ip. Since O is square and invertible, also OTO=Ip; it is orthogonal. This covariance calculation is the relative whitening reduction and requires neither a density nor moments beyond the given second moments.

2.1givenF2step 1.1algebra

By [F2], every non-Gaussian column of O is a signed coordinate vector. Distinct such columns occupy distinct rows, because they are orthogonal. There are at least p−1 such columns. If there are p they occupy all rows and O is already a signed-permutation matrix. Otherwise there are exactly p−1, leaving one row r and the one possible Gaussian column i. Its inner product with each occupied signed coordinate column is zero, so Oji=0 on every occupied row j. Its norm is one, so Ori=1 or −1. Thus O is a signed-permutation matrix also in this case. For p=1 the same argument has zero occupied rows and its single norm-one column is 1 or −1.

3.1step 1.1step 2.1constructalgebra∎

Put Q=OT, again a signed-permutation matrix. From O=A′−1A and O−1=OT we get A′=AOT=AQ. Also S′=dT=OS=QTS. 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