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.
Latent factors, ICA, NMF, and representation ambiguity — Examples
1 · Prerequisites
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
A standardized Laplace ICA model has signed-permutation alternatives
Example
Let be independent with common density , which has mean zero, variance one, and is non-Gaussian. Put , , and . Then and are two square independent-component representations of the same law, with standardized non-Gaussian sources.
Facts & Assumptions
Given: The independent Laplace sources and signed-permutation matrix in the example statement.
Square independent-component model with standardized sources: a square ICA representation has an invertible mixing matrix and mutually independent centered unit-variance sources.
Verification
Put . Direct integration gives and . Hence , symmetry gives mean zero, and . The one-sided derivatives of at zero are and , unlike the smooth standard Gaussian density; since both densities are continuous, this law is non-Gaussian.
The matrix is a signed permutation, so . The two coordinates remain independent, centered, and unit variance by step 1.1; the even Laplace density is unchanged by sign reversal, so both remain non-Gaussian.
Since , exactly. Thus the observed law is unchanged while the source order/sign representation changes.
Two Gaussian latent factors admit a nontrivial orthogonal rotation
Example
Let , ,
Let have density on , and let be independent of with density on . With , the two parameterizations and have the same covariance
and the same law of . The matrix is not a signed permutation, so the Gaussian latent orientation is not uniquely determined.
Facts & Assumptions
Given: The matrices and independent Gaussian random vectors in the example statement.
Orthogonal rotation preserves the covariance factor model: replacing by for orthogonal preserves the covariance factor model and its covariance matrix.
Covariance factor model with diagonal residual covariance: the factor model requires centered factors with covariance identity, diagonal positive residual covariance, and zero factor-residual cross-covariance.
Verification
The displayed densities factor as products of the one-dimensional standard Gaussian density , so the coordinates of and are independent. Symmetry gives for a coordinate , and with vanishing boundary terms gives . Thus , , and . The given independence of and makes their cross-covariance zero.
Direct multiplication gives and , so the transformed representation yields the same for every outcome. By [F1], its covariance is unchanged; here .
The density of is because is orthogonal and . Thus again has independent standard Gaussian coordinates; it remains independent of , and [F2] together with step 1.1 shows both parameterizations satisfy the model. Since has four nonzero entries, it is not a signed permutation.
A positive rate matrix has NMFs beyond scale and permutation
Example
Let be the all-ones count matrix and set . For , define
Every pair is strictly positive and gives rate matrix . The factorizations for and are not related by positive component rescaling or permutation.
Facts & Assumptions
Given: The count matrix and factors defined in the example statement.
Poisson nonnegative matrix-factorization model: the Poisson rate matrix is the product .
Positive component rescaling and permutation preserve an NMF rate matrix: the elementary component ambiguities rescale one factor column and its corresponding factor row inversely, or permute corresponding components.
Verification
Each row of sums to , while each entry of is , so for every cell. This verifies the common positive rate matrix.
Under the transformations in [F2], each rank-one component matrix is unchanged except for reordering. At the multiset of component matrices is , whereas at it is . These multisets differ, so the factorizations are not related by scale or permutation.
A zero-count cell remains well-defined in a positive NMF update
Example
Let
After one complete Poisson NMF sweep, the algorithm gives and . The zero-count cells contribute zero to the update numerators, and every rate used in the sweep is positive.
Facts & Assumptions
Given: The count matrix, positive initialization, and one sweep of the finite Poisson NMF updates.
Poisson nonnegative matrix-factorization model: every row and column has a positive count, and cell rates are the entries of .
Finite Poisson NMF multiplicative-update sweeps: a sweep updates first, recomputes the rates, then updates using the new .
Strictly positive initialization keeps the Poisson NMF updates well-defined: positive initialization and the nonzero row/column condition keep all rates and denominators positive.
Verification
Initially every rate is . For each , the numerator is and the denominator is , so . The recomputed intermediate rates are all .
For each , the numerator is and the denominator is , hence . Every division is by a positive rate as guaranteed by [F3], and a zero-count cell contributes , not an indeterminate quotient.