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
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Characteristic Functions Inversion and Continuity
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
Covariance factor model with diagonal residual covariance
Definition
Let be positive integers with , let be a probability space, and let and be measurable random vectors with finite second moments. For finite-second-moment random vectors , define
where expectation is integration with respect to . A covariance factor model is a representation
with a fixed matrix and assumptions
The model assumes only the stated moment and cross-covariance conditions; it does not assume that and are independent.
Definition references
Square independent-component model with standardized sources
Definition
Let and let be random vectors in , considered through their probability laws. A square independent-component representation of is a representation in distribution
where is an invertible mixing matrix and has mutually independent real-valued components. Mutual independence means that for all Borel sets ,
Each source is standardized: and . A source is Gaussian if its law has density , and is non-Gaussian otherwise. All vectors are columns and matrix transposes use the standard Euclidean inner product. The definition specifies a latent representation, not a claim that it can be recovered uniquely from the law of .
Definition references
Poisson nonnegative matrix-factorization model
Definition
Let be positive integers and write . An observed count matrix is admissible when every row and every column contains a positive entry. A Poisson nonnegative matrix-factorization parameter of inner dimension consists of matrices
At this parameter, the random counts are mutually independent and have Poisson means . For , the Poisson law is
for , it assigns probability to and probability to every . This model defines a likelihood for the observed matrix; it makes no convexity or global-optimality assertion about the factor parameters.
Definition references
Orthogonal rotation preserves the covariance factor model
Statement
In the covariance factor model, write with , , , , diagonal positive, and . Then
For every orthogonal matrix , the transformed loadings and factors and give another representation with the same covariance matrix. Thus covariance alone does not identify a unique loading matrix or latent orientation. This is a covariance-model claim; if the factors are additionally required to be mutually independent, the proposition does not claim that arbitrary rotations preserve that extra requirement.
Statement references
Facts & Assumptions
Given: A covariance factor model and an orthogonal matrix , so .
Covariance factor model with diagonal residual covariance: , with zero means, , , and .
Proof
By [F1], bilinearity of covariance gives .
The transformed factors have mean zero, covariance , and cross-covariance . Also , and . Hence the transformed pair is another covariance factor model with the same covariance.
Whitening a square ICA model gives orthogonal mixing
Statement
Let be a square independent-component representation with and centered unit-variance independent sources, so . Put . Choose a real singular value decomposition with positive diagonal and orthogonal , and define the symmetric inverse square root of by . This matrix is the unique positive-definite symmetric matrix whose square is . The whitened mixing matrix is
which is orthogonal. Thus whitening reduces the square mixing ambiguity to an orthogonal transformation.
Statement references
Facts & Assumptions
Given: A square ICA representation with invertible and .
Square independent-component model with standardized sources: the source components are centered with variance one and is invertible.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional real linear map has a singular value decomposition with orthonormal left and right bases and nonnegative singular values.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a finite-dimensional real self-adjoint endomorphism has an orthonormal eigenbasis.
Proof
By [F1], . For every nonzero , because is invertible; hence is symmetric positive definite.
By [F2], write with orthogonal. Since is invertible, every diagonal entry of is positive. Thus , and is symmetric positive definite with .
If is another symmetric positive-definite matrix with , then commutes with and preserves each eigenspace of . On each such subspace, [F3] gives an orthonormal eigenbasis for . Its eigenvalues are positive and satisfy , so . This determines uniquely and agrees with .
Therefore and . Since , the whitened mixing is orthogonal and .
Positive component rescaling and permutation preserve an NMF rate matrix
Statement
Let and . For any positive scalars , replacing column of by and row of by leaves unchanged. For any permutation of , replacing by and by also leaves unchanged. Therefore both transformations preserve every Poisson rate and the corresponding likelihood.
Statement references
Facts & Assumptions
Given: Nonnegative factor matrices and positive component scales or a permutation .
Poisson nonnegative matrix-factorization model: the rate matrix is the matrix product .
Proof
For the rescaled factors, each entry is . Thus every rate is unchanged.
For the permuted factors, because reorders the finite sum. Equal rate matrices give the same independent Poisson law and likelihood by [F1].
Independent Poisson counts have the stated NMF log-likelihood
Statement
For an admissible count matrix and a Poisson NMF parameter with rates , the joint log-likelihood is
After dropping the data-only term , the objective is
Use ; if and , the log-likelihood is .
Statement references
Facts & Assumptions
Given: An admissible observed count matrix, nonnegative factors , and rates .
Poisson nonnegative matrix-factorization model: the cell counts are mutually independent; a positive-rate cell has Poisson mass , and a zero-rate cell is concentrated at zero.
Proof
When all rates are positive, [F1] and independence give joint likelihood . Taking logarithms and using gives the displayed formula.
If , [F1] gives cell likelihood when and when ; their log-likelihoods are respectively and , exactly the stated conventions. The factorial term depends only on the fixed data, so removing it leaves the same maximizing objective in .
A characteristic function that is Gaussian near zero is globally Gaussian
Statement
Let be a real random variable. If there is such that for every , then has the standard Gaussian law, with density . No moment or density assumption on is required.
Statement references
Facts & Assumptions
Given: A real random variable with characteristic function equal to on , where .
Fatou's lemma bounds the integral of a nonnegative pointwise limit by the lower limit of its integrals.
Dominated convergence passes dominated limits through integrals; Monotone convergence for the integral does the same for increasing nonnegative limits.
Moments give derivatives of the characteristic function gives whenever the th absolute moment is finite.
Fubini's theorem for L^1 functions on a sigma-finite product and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product allow iterated integration of absolutely integrable and nonnegative product-measurable functions, respectively.
The Gaussian integral gives .
Finite measures agreeing on a generating pi-system and on the whole space are equal identifies finite measures that agree on a generating pi-system and on the whole space.
If are differentiable on with integrable, then applies to differentiable real functions on compact intervals whose derivatives are integrable.
Substitution: if is differentiable on with integrable and is continuous on an interval containing , then gives compact substitution for continuous integrands and a differentiable change of variable with integrable derivative. For the absolutely integrable whole-line expressions below, apply it on finite intervals and pass to the limit using the integrable tails.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion gives compact Riemann integrability, with uniform partitions whose upper and lower sums approach one another.
A function continuous on an interval whose derivative vanishes at every interior point of is constant on ; consequently two such functions with the same derivative differ by a constant makes a continuous real function with zero derivative on an interval constant; apply it to real and imaginary parts for complex functions.
Proof
By [F9], substitution in [F6] gives , so defines a probability law . These integrals can be read as Lebesgue integrals: on each , the uniform dyadic lower and upper sums of the continuous integrand converge to the same Riemann integral and bound its Lebesgue integral; increasing truncations then give the whole-line equality by [F3]. For each integer , is integrable: its tail is bounded by a constant times , since is bounded (differentiate it on ). If has law , integration by parts [F8] on , followed by [F3], using and vanishing polynomial times Gaussian boundary terms, gives and odd moments zero. Hence . Also by the same integration by parts, justified by . By [F11], differentiation of gives zero and its value at zero is one: for every real . All integrations by parts first concern smooth functions on compact intervals, whose derivatives are continuous and therefore integrable by [F10]; the same dyadic comparison identifies their Riemann and Lebesgue integrals.
Fix an integer and define for . It is nonnegative and bounded for fixed . The binomial theorem and give For , its expectation under therefore equals its expectation under , since every frequency lies in . On the prescribed sequence , ; moreover because . By [F3] applied to , . Fatou's lemma [F2] applied to now gives . Applying [F3] again, now with the integrable majorant , shows equality .
Every absolute moment of is finite, since . By [F4], equality of and on a neighborhood of zero implies equality of their derivatives there, hence for every . For every , the nonnegative partial sums of increase to it; [F3] and step 2.1 give Since , . The identical calculation applies to . For every real , the partial sums of the exponential series for have modulus at most , so [F3] and moment equality yield This proves global equality without presupposing analyticity of .
For completeness identify the law directly, without importing a general Fourier uniqueness theorem. For set . The Gaussian transform computed in step 1.1, with the substitution , gives If is the law of , then is a probability density by Tonelli. Substituting the displayed identity and applying Fubini gives Absolute integrability for this interchange follows from and . By step 3.1 this density equals for every .
For a bounded continuous real , Fubini and substitution give The product-integrand is bounded in absolute integral by . Along , dominated convergence gives limit ; the same holds for . Step 4.1 therefore implies for every such . For take the continuous functions equal to on , equal to on , and zero on . They are bounded by one and converge pointwise to , so [F3] gives equality of both measures on every such half-line. These half-lines are a pi-system generating the Borel sets: open intervals are countable unions and differences of half-lines with rational endpoints, and every open subset of is the union of the rational-endpoint intervals contained in it. Both measures have total mass one; [F7] proves . This proves the assertion.
Remarks
The finite-difference step is essential. Agreement near zero alone does not identify arbitrary characteristic functions. Here it first forces all Gaussian moment bounds and exponential integrability. The argument uses only the displayed deterministic sequences, finite sums, and ordinary integration; it imports no choice-bearing general Fourier uniqueness theorem.
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.
Finite Poisson NMF multiplicative-update sweeps
Definition
Input an admissible count matrix with no all-zero row or column, an inner dimension , a finite sweep count , and strictly positive initial factors and . For each , perform one complete sweep in the stated order:
-
Set .
-
For every , set
-
Recompute .
-
For every , set
The first factor block uses the current ; the second uses the new and the recomputed intermediate rates.
Return . The local well-definedness result proves that every denominator and rate in these finite sweeps is positive under the stated assumptions. This algorithm makes no likelihood-monotonicity, convergence, stationary-point, or global-optimality claim.
Strictly positive initialization keeps the Poisson NMF updates well-defined
Statement
Suppose has at least one positive entry in every row and every column. If and , then one complete Poisson NMF multiplicative-update sweep produces strictly positive updated factors and strictly positive rates at both update stages. Consequently every finite number of sweeps from a strictly positive initialization is well-defined.
Statement references
Facts & Assumptions
Given: An admissible count matrix , positive factors , and one ordered sweep of the Poisson NMF algorithm.
Poisson nonnegative matrix-factorization model: every row and column of contains a positive count.
Finite Poisson NMF multiplicative-update sweeps: each update multiplies a positive entry by a row numerator divided by a sum of positive entries; each update multiplies a positive entry by a column numerator divided by a sum of positive updated entries.
Proof
Since are strictly positive, every current rate is positive. For each row , choose with using [F1]. Then for every , the numerator has the positive term , while its denominator is positive. Thus every updated is positive.
The intermediate rates are positive. For each column , choose with using [F1]. For every , the numerator has the positive term at , and its denominator is positive. Thus every updated is positive. Repeating this argument inductively proves the claim for each finite sweep.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The Elements of Statistical Learning, second edition, corrected 12th printing
- Aapo Hyvärinen, Juha Karhunen, and Erkki Oja, Independent Component Analysis
- Daniel D. Lee and H. Sebastian Seung, Algorithms for Non-negative Matrix Factorization, NIPS 2000
- Rick Durrett, Probability: Theory and Examples, fifth edition