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.
Symmetric algebra of a vector space
Definition
For a vector space , let be the two-sided ideal of generated by
The symmetric algebra of is the commutative graded algebra
The quotient is commutative because its degree-one generators commute, and all elements are sums of products of those generators. Since the relators are homogeneous of degree two, is homogeneous. In degree , the relation space is generated by adjacent-transposition differences: an arbitrary permutation difference is a telescoping sum along adjacent transpositions, and each adjacent difference is a degree- multiple of a generator of . Thus the degree- piece is the quotient of by the span of for and . The degree-zero unit is the image of .
Depends on
Used by
- The dimension of a complete linear system Corollary
- Rational modules need not be semisimple in characteristic p Counterexample
- The simple modules of SL₂ and its fundamental representation Example
- An augmented coideal ideal of an enveloping algebra is generated by its primitive part Lemma
- The opposite Borels of a symmetrizable Kac–Moody algebra are root-degreewise dual Lie bialgebras Lemma
- The scheme-theoretic linear span of the tangent cone Lemma
- The enveloping algebra of an abelian Lie algebra is symmetric Proposition
- Universal property of the symmetric algebra Theorem
Dependency tree · two levels
12 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, §13.1, printed pp. 74–75 (standard reference, not scraped)