Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passaudited 2026-09-30
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.

Invariant symmetric polynomials on a matrix Lie algebra

Definition

Let G be either a real matrix Lie group G⊆GL⁡n(R) with real Lie algebra g, or a complex matrix Lie group G⊆GL⁡n(C) with complex Lie algebra g. In the real case let K∈{R,C} and use polynomials in real linear coordinates with coefficients in K. In the complex case take K=C and use polynomials in complex linear coordinates (with no conjugate-coordinate variables). A homogeneous degree-k polynomial P:g→K is G-invariant when P(Ad⁡gA)=P(A)(g∈G, A∈g), where the adjoint action is the one in Conjugation and the adjoint representation of a Lie group. For k≥1, its polarization is the unique symmetric multilinear map Pk:gk→K with P(A)=Pk(A,…,A). Here multilinearity is over R when g is a real Lie algebra and over C when it is a complex Lie algebra; thus a C-valued polynomial on a real Lie algebra still has a real-multilinear polarization. A complex matrix Lie group may also be regarded as a real Lie group, in which case the underlying real Lie algebra and real-multilinear convention apply; this is also the convention for real-valued coordinate polynomials on a complex matrix Lie algebra, such as z↦Re⁡z on gl1(C).

The polarization can be computed by Pk(A1,…,Ak)=1k![t1⋯tk]P(t1A1+⋯+tkAk), where the bracket extracts the coefficient of t1⋯tk. A homogeneous degree-k coordinate polynomial makes this coefficient symmetric and multilinear in the Aj; setting every Aj=A gives the coefficient k!P(A), and the same extraction proves uniqueness. Since K has characteristic zero, division by k! is valid. For k=0, the invariant polynomials are constants, viewed as symmetric 0-linear forms P0∈K. Finite sums of these homogeneous invariant polynomials form the invariant polynomial algebra; sums and products remain invariant because the adjoint action respects addition and multiplication of scalar values.

Polarization preserves invariance: simultaneous application of Ad⁡g to the arguments leaves every term in the coefficient formula unchanged. Conversely, if a symmetric Pk is invariant under simultaneous adjoint action, its diagonal A↦Pk(A,…,A) is a G-invariant polynomial. Differentiating that multilinear invariance along g(t)=exp⁡(tX) gives the infinitesimal identity ∑j=1kPk(A1,…,[X,Aj],…,Ak)=0(X∈g). Indeed, for matrices, ddt∣0Ad⁡exp⁡(tX)Aj=[X,Aj], so the chain rule gives exactly the displayed sum. For k=0 the sum is empty and equals zero.

For glr(C), every coefficient of det⁡(I−tA) is invariant under GL⁡r(C), since I−t(gAg−1)=g(I−tA)g−1 and determinant is unchanged by conjugation. Its restriction to u(r) is therefore invariant for the adjoint action of U(r). For the Pfaffian, use only so(2m) with G=SO(2m) and a fixed oriented orthonormal frame. For A=(aij)∈so(2m), define αA=12∑i,jaijei∧ej and set αAmm!=Pf⁡(A) e1∧⋯∧e2m. This is a homogeneous polynomial of degree m. If S∈O(2m), the induced action on the top exterior power multiplies the oriented volume by det⁡S; hence Pf⁡(SAST)=(det⁡S)Pf⁡(A). It is invariant under SO(2m), and a reversal of orientation changes its sign. The convention gives Pf⁡ ⁣(0a−a0)=a; for m=0 it gives the empty-matrix Pfaffian 1.

Depends on

Used by

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