Alphabeta Math
Pipeline-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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

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

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A standardized Laplace ICA model has signed-permutation alternatives

Example

Let S1,S2 be independent with common density f(s)=2−1/2e−2∣s∣, which has mean zero, variance one, and is non-Gaussian. Put S=(S1,S2)T, A=I2, and Q=(0−110). Then X=AS and X=(AQ)(QTS) 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.

[F1]

Square independent-component model with standardized sources: a square ICA representation has an invertible mixing matrix and mutually independent centered unit-variance sources.

Verification

1.1givenalgebra

Put a=2. Direct integration gives ∫0∞e−as ds=1/a and ∫0∞s2e−as ds=[−e−as(s2/a+2s/a2+2/a3)]0∞=2/a3. Hence ∫Rf(s) ds=1, symmetry gives mean zero, and ESj2=2(1/2)(2/a3)=1. The one-sided derivatives of f at zero are 1 and −1, unlike the smooth standard Gaussian density; since both densities are continuous, this law is non-Gaussian.

2.1F1givenstep 1.1algebra

The matrix Q is a signed permutation, so QTS=(S2,−S1)T. 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.

3.1F1step 2.1algebra∎

Since QTQ=I2, (AQ)(QTS)=AS exactly. Thus the observed law is unchanged while the source order/sign representation changes.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Two Gaussian latent factors admit a nontrivial orthogonal rotation

Example

Let p=3, q=2,

A=(100111),D=I3,R=12(1−111).

Let S have density (2π)−1exp⁡(−∥s∥2/2) on R2, and let ε be independent of S with density (2π)−3/2exp⁡(−∥e∥2/2) on R3. With X=AS+ε, the two parameterizations (A,S) and (ART,RS) have the same covariance

Cov⁡(X)=(201021113)

and the same law of X. The matrix R 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.

[F1]

Orthogonal rotation preserves the covariance factor model: replacing A,S by ART,RS for orthogonal R preserves the covariance factor model and its covariance matrix.

[F2]

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

1.1givenalgebra

The displayed densities factor as products of the one-dimensional standard Gaussian density g(x)=(2π)−1/2e−x2/2, so the coordinates of S and ε are independent. Symmetry gives EZ=0 for a coordinate Z, and (xe−x2/2)′=e−x2/2−x2e−x2/2 with vanishing boundary terms gives ∫Rx2g(x) dx=∫Rg(x) dx=1. Thus ES=Eε=0, Cov⁡(S)=I2, and Cov⁡(ε)=I3. The given independence of S and ε makes their cross-covariance zero.

2.1F1givenstep 1.1algebra

Direct multiplication gives RTR=I2 and (ART)(RS)=AS, so the transformed representation yields the same X for every outcome. By [F1], its covariance is unchanged; here AAT+I3=(201021113).

3.1F2step 1.1step 2.1algebra∎

The density of RS is (2π)−1exp⁡(−∥RTs∥2/2)∣det⁡R∣=(2π)−1exp⁡(−∥s∥2/2) because R is orthogonal and ∣det⁡R∣=1. Thus RS again has independent standard Gaussian coordinates; it remains independent of ε, and [F2] together with step 1.1 shows both parameterizations satisfy the model. Since R has four nonzero entries, it is not a signed permutation.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A positive rate matrix has NMFs beyond scale and permutation

Example

Let X be the 2×2 all-ones count matrix and set r=2. For 0<α<1, define

Wα=(α1−αα1−α),H=(1111).

Every pair (Wα,H) is strictly positive and gives rate matrix WαH=X. The factorizations for α=1/2 and α=1/3 are not related by positive component rescaling or permutation.

Facts & Assumptions

Given: The count matrix and factors defined in the example statement.

[F1]

Poisson nonnegative matrix-factorization model: the Poisson rate matrix is the product WH.

[F2]

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

1.1F1givenalgebra

Each row of Wα sums to 1, while each entry of H is 1, so (WαH)ij=α+(1−α)=1 for every cell. This verifies the common positive rate matrix.

2.1F2step 1.1algebra∎

Under the transformations in [F2], each rank-one component matrix W⋅kHk⋅ is unchanged except for reordering. At α=1/2 the multiset of component matrices is {12X,12X}, whereas at α=1/3 it is {13X,23X}. These multisets differ, so the factorizations are not related by scale or permutation.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A zero-count cell remains well-defined in a positive NMF update

Example

Let

X=(0110),W(0)=H(0)=(1111),r=2.

After one complete Poisson NMF sweep, the algorithm gives W(1)=14(1111) and H(1)=H(0). 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.

[F1]

Poisson nonnegative matrix-factorization model: every row and column has a positive count, and cell rates are the entries of WH.

[F2]

Finite Poisson NMF multiplicative-update sweeps: a sweep updates W first, recomputes the rates, then updates H using the new W.

[F3]

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

1.1F1F2givenalgebra

Initially every rate is 2. For each i,k, the W numerator is 0/2+1/2=1/2 and the denominator is 1+1=2, so Wik(1)=1/4. The recomputed intermediate rates are all 1/2.

2.1F2F3step 1.1algebra∎

For each k,j, the H numerator is 14(0/(1/2))+14(1/(1/2))=1/2 and the denominator is 1/4+1/4=1/2, hence Hkj(1)=1. Every division is by a positive rate as guaranteed by [F3], and a zero-count cell contributes 0/(1/2)=0, not an indeterminate quotient.