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.
Finite matrices cannot satisfy exact canonical commutation relations
Statement refuted
For every positive integer and every , there exist matrices such that .
Facts & Assumptions
Given: A positive integer , , arbitrary complex matrices , and for .
The proposed pair, if it existed, would satisfy .
Counterexample
By the definition of matrix multiplication, and . Interchanging the finite indices in the second sum and commuting complex scalars makes the sums equal, so .
Taking the trace in [A1] gives , which is impossible because and . Therefore the proposed universal existence statement is false.
Remarks
This proof concerns bounded finite matrices. It does not differentiate a Weyl relation for unbounded generators or supply a domain argument for such a differentiation.
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.