Representations of SLβ‚‚

Research Depth 61 in the knowledge graph I know this Set as goal
sl2 highest-weight casimir-element weight-space raising-lowering

Core Idea

The representation theory of SLβ‚‚(β„‚) (or equivalently its Lie algebra 𝔰𝔩₂(β„‚)) is the fundamental example in Lie theory. The Lie algebra 𝔰𝔩₂ is spanned by three elements e, f, h with [h,e] = 2e, [h,f] = βˆ’2f, [e,f] = h. The finite-dimensional irreducible representations are classified by a single non-negative integer n: for each n β‰₯ 0, there is a unique (n+1)-dimensional irreducible representation V(n) with highest weight n. The representation V(n) has a basis of weight vectors v_n, v_{nβˆ’2}, …, v_{βˆ’n} on which e raises weight by 2, f lowers weight by 2, and h acts by the weight.

Explainer

The Lie algebra 𝔰𝔩₂(β„‚) consists of 2Γ—2 traceless complex matrices. It is 3-dimensional with standard basis: e = [[0,1],[0,0]] (strictly upper triangular), f = [[0,0],[1,0]] (strictly lower triangular), and h = [[1,0],[0,βˆ’1]] (diagonal). The commutation relations are [h,e] = 2e, [h,f] = βˆ’2f, [e,f] = h. These relations, not the specific matrices, determine the representation theory. The element h generates a Cartan subalgebra, e is a raising operator, and f is a lowering operator.

A representation V of 𝔰𝔩₂ decomposes into weight spaces V = βŠ•_Ξ» V_Ξ», where V_Ξ» = {v ∈ V : hΒ·v = Ξ»v}. The commutation relations force e to raise weights by 2 (if v ∈ V_Ξ», then eΒ·v ∈ V_{Ξ»+2}) and f to lower weights by 2. In a finite-dimensional representation, there must be a highest weight vector v_Ξ» with eΒ·v_Ξ» = 0 (since weights are bounded above). Starting from v_Ξ» and applying f repeatedly generates v_Ξ», fΒ·v_Ξ», fΒ²Β·v_Ξ», … until reaching the lowest weight. If the highest weight is n, this chain has length n+1, producing an (n+1)-dimensional space with weights n, nβˆ’2, …, βˆ’n.

The classification theorem states: for each integer n β‰₯ 0, there is a unique irreducible representation V(n) of dimension n+1, and every finite-dimensional representation is a direct sum of these. The proof uses the Casimir element C = hΒ² + 2h + 4fe ∈ U(𝔰𝔩₂), which lies in the center of the universal enveloping algebra and acts as the scalar n(n+2) on V(n). Since this scalar is distinct for each n, the Casimir separates irreducibles. Complete reducibility follows from the fact that SU(2) (the compact real form) is compact, so the analogue of Maschke's theorem applies.

The Clebsch-Gordan formula describes tensor products: V(m) βŠ— V(n) β‰… V(m+n) βŠ• V(m+nβˆ’2) βŠ• Β·Β·Β· βŠ• V(|mβˆ’n|), a multiplicity-free direct sum. This is the mathematical content of angular momentum addition in quantum mechanics (with V(n) corresponding to spin n/2). The formula can be proved by comparing characters or by explicitly constructing highest weight vectors in the tensor product. The entire structure β€” weight space decomposition, highest weight classification, Casimir element, Clebsch-Gordan decomposition β€” generalizes to all semisimple Lie algebras, with 𝔰𝔩₂ providing the blueprint for the general theory via the root system.

Practice Questions 5 questions

Prerequisite Chain

Counting to 10 β†’ Counting to 20 β†’ Understanding Zero β†’ The Number Zero β†’ Counting to Five β†’ One-to-One Correspondence β†’ Combining Small Groups Within 5 β†’ Addition Within 10 β†’ Addition Within 20 β†’ Two-Digit Addition Without Regrouping β†’ Two-Digit Addition with Regrouping β†’ Addition Within 100 β†’ Repeated Addition as Multiplication β†’ Multiplication Facts Within 100 β†’ Division as Equal Sharing β†’ Division as Grouping (Measurement Division) β†’ Division: Grouping (Repeated Subtraction) Model β†’ Division: Fair Sharing Model β†’ Division as Equal Sharing β†’ Division as Grouping β†’ Basic Division Facts β†’ Division Facts Within 100 β†’ Two-Digit by One-Digit Division β†’ Division with Remainders β†’ Remainders and Quotients in Division β†’ Division Word Problems β†’ Introduction to Long Division β†’ Factors and Multiples β†’ Prime and Composite Numbers β†’ Equivalent Fractions β†’ Relating Fractions and Decimals β†’ Decimal Place Value β†’ Integers and the Number Line β†’ Opposites and Additive Inverses β†’ Absolute Value β†’ Adding Integers β†’ Subtracting Integers β†’ Multiplying Integers β†’ Dividing Integers β†’ Unit Rates β†’ Proportions β†’ Percent Concept β†’ Converting Between Fractions, Decimals, and Percents β†’ Operations with Rational Numbers β†’ Two-Step Equations β†’ Solving Multi-Step Equations β†’ Equations with Variables on Both Sides β†’ Literal Equations β†’ Slope-Intercept Form β†’ Point-Slope Form β†’ Writing Linear Equations β†’ Parallel and Perpendicular Line Slopes β†’ Graphing Linear Equations β†’ Systems of Equations β€” Graphing Method β†’ Systems of Equations β€” Elimination Method β†’ Systems of Three Variables β†’ Matrices Introduction β†’ Linear Transformations β†’ Group Representations β†’ Equivalence of Representations β†’ Reducibility and Irreducibility β†’ Representations of SLβ‚‚

Longest path: 62 steps · 278 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.