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.
Baker–Campbell–Hausdorff series
Definition
Let be a finite-dimensional real Lie algebra and let . For a nonempty word in the two letters , define its right-nested commutator by
Equivalently, when , this is in the notation of Adjoint representation of a Lie algebra.
For , the degree- Dynkin polynomial is
Here means a block of copies of followed by copies of ; it is word notation, not multiplication in . For fixed both sums are finite, so is well defined using only the vector space operations and Lie bracket supplied by Finite-dimensional Lie algebra.
The formal Baker–Campbell–Hausdorff series is the degree-indexed formal sum
It begins
Indeed, the part has the two one-letter blocks and gives . In degree two, the block contributes ; the two mixed words contribute , and all repeated-letter brackets vanish. Direct collection of the finite degree-three sum gives the two displayed terms.
Until convergence is proved, means this formal sequence of homogeneous Lie polynomials, not an element obtained by summing infinitely many vectors. Wherever the series converges, the same notation denotes its sum. The next convergence lemma justifies this analytic meaning on a neighborhood of .
For the zero Lie algebra every is zero. For a one-dimensional real Lie algebra the bracket vanishes, so the formal series is . No metric, nondegeneracy, interval, endpoint, choice principle, or biconditional is part of this definition.
Depends on
Used by
Dependency tree · two levels
5 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)