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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · one level
2 results within one dependency step 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.