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.
BCH truncation fails when higher commutators do not vanish
Counterexample
Assume . In the upper-unitriangular subgroup of , put the strictly upper-triangular Lie-algebra elements
Then the quadratic truncation does not satisfy . The omitted cubic BCH term is .
Facts & Assumptions
Given: The displayed matrices and .
Matrix units are defined by their entries, and matrix multiplication is the usual finite row-by-column sum; hence . Matrix units and the Kronecker delta. Rectangular matrix multiplication and the identity matrix , including zero-sized shapes.
For matrix Lie groups, the Lie-group exponential is the matrix exponential. Matrix exponential as the Lie-group exponential.
Countable choice is inherited through the matrix-Lie-group exponential interface [F2]; the finite polynomial calculation below uses no further choice. The Axiom of Countable Choice ().
Refutation
By [F1], , , and . Every product of four strictly upper-triangular matrices is zero. The coefficient of the surviving cubic commutator will be determined directly below, without applying a local BCH theorem outside its neighbourhood.
The failure can be checked without relying on formal uniqueness. Since , , direct multiplication gives .
For , [F1] gives , , and . Hence .
The coefficients in steps 1.2 and 1.3 are respectively and , so . Moreover annihilates every strictly upper-triangular matrix on either side, so it commutes with and has square zero. Hence The exponential is injective on strictly upper-triangular matrices: for , its polynomial inverse is , and direct finite expansion gives . Thus is the exact logarithm and the omitted term is precisely . The matrix calculation is choice-free; is stated only for [F2]. No endpoint, metric, or biconditional occurs.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 results within two dependency steps 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.
Sources
- Michael Müger, Notes on the Baker-Campbell-Hausdorff-Dynkin theorem (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)