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.
Derivations form a Lie algebra and inner derivations an ideal
Statement
is a Lie subalgebra of under the commutator. The map is a Lie-algebra homomorphism, its image is an ideal, and .
Facts & Assumptions
Given: A Lie algebra over .
Derivations satisfy the Lie Leibniz law of Derivations of Lie algebras.
The bracket of is alternating and satisfies Jacobi (Lie algebras over a field).
The center and ideal conditions are those of Lie subalgebras, ideals, and center.
Proof
Derivations form a linear subspace of , because the Leibniz identity is linear in . For derivations , expansion of gives : the two cross terms and occur once with each sign and cancel. Hence is a derivation.
Jacobi rewritten as says . It also says , so every is a derivation and is a Lie homomorphism.
The endomorphism commutator is bilinear and alternating, and its Jacobi identity follows by expanding the six triple composites. Therefore the closed linear subspace in step 1.1 is a Lie subalgebra.
If is any derivation, then for every , ; hence . Thus the inner derivations form an ideal of .
Finally, exactly when for every , which is exactly by [L3]. For an abelian algebra the inner ideal is zero; for the zero algebra all assertions remain valid.
Depends on
Used by
- Semidirect products of Lie algebras Definition
- Adjoint and trivial representations Example
Dependency tree · two levels
6 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
- Etingof, MIT 18.745 notes, derivations in §3.2 (standard reference, not scraped)