惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园_首页
C
Check Point Blog
B
Blog RSS Feed
G
Google Developers Blog
H
Help Net Security
博客园 - Franky
Blog — PlanetScale
Blog — PlanetScale
H
Hackread – Cybersecurity News, Data Breaches, AI and More
量子位
Recent Announcements
Recent Announcements
B
Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
D
DataBreaches.Net
小众软件
小众软件
T
The Blog of Author Tim Ferriss
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
MongoDB | Blog
MongoDB | Blog
Y
Y Combinator Blog
T
Tailwind CSS Blog
J
Java Code Geeks
MyScale Blog
MyScale Blog
雷峰网
雷峰网
有赞技术团队
有赞技术团队
博客园 - 聂微东

DEV Community

Authentication Security Deep Dive: From Brute Force to Salted Hashing (With Java Examples) Why AI Systems Don’t Fail — They Drift Spilling beans for how i learn for exam😁"Reinforcement Learning Cheat Sheet" I Replaced Chrome with Safari for AI Browser Automation. Here's What Broke (and What Finally Worked) How Python Borrows Other People's Work The $40 Architecture: Processing 1 Billion API Requests with 99.99% Uptime Vibe Coding: A Workflow Guide (From Zero to SaaS) Most webhook security guides protect the wrong side. The scary part is delivery. Headless CMS for TanStack Start: Build a Blog with Cosmic EU Age Verification App "Hacked in 2 Minutes" — What Actually Happened Comfy Cloud’s delete function does not actually remove files Running AI Models on GPU Cloud Servers: A Beginner Guide Event-driven media intelligence with AWS Step Functions and Bedrock I scored 500 AI prompts across 8 quality dimensions — here's what broke How to Call Google Gemini API from Next.js (Free Tier, No Backend Needed) The Portal Protocol: Reclaiming Human Connection in the Age of AI How to Fix Your Team's Scattered Knowledge Problem With a Self-Hosted Forum Intro to tc Cloud Functors: A Graph-First Mental Model for the Modern Cloud Designing Multi-Tenant Backends With Both Ownership and Team Access I Built a Neumorphic CSS Library with 77+ Components — Here's What I Learned PostgreSQL Performance Optimization: Why Connection Pooling Is Critical at Scale Cómo construí un SaaS multi-rubro para gestionar expensas en Argentina con FastAPI + Vue 3 🚀 I Built an Ethical Hacking Scanner Tool – Open Source Project I Replaced /usage and /context in Claude Code With a Single Statusline A Pythonic Way to Handle Emails (IMAP/SMTP) with Auto-Discovery and AI-Ready Design I Collected 8.9 Million Polymarket Price Points — Here's What I Found About How Markets Really Move EcoTrack AI — Carbon Footprint Tracker & Dashboard Everyone's Using AI. No One Agrees How. 5 self-hosted ebook managers worth trying in 2026 Building Your First AI Agent with LangChain: From Chatbot to Autonomous Assistant
Weights, Roots and Coweights of a Lie group
The Mansions of Science · 2026-06-17 · via DEV Community

DEV Community

The Mansions of Science

  1. Suppose you have a Lie group. The generators of this group, along with their commutation relations, form a Lie algebra. The maximal commuting subset of this is called a Cartan Sub-Algebra (CSA).
  2. Suppose you have a CSA with 20 generators.
  3. Given some vector space V, each of the 20 generators can be associated with 20 matrices. If you change V, you change the 20 matrices
  4. If a vector A of the vector space V is an eigenvector of every element of the CSA (let’s call them M1, M2, M3 … M19, M20), then M_i acting on A produces 20 eigenvalues. These 20 numbers, together are called a weight, L. So L = L(e1, e2, e3 … e19, e20). L(M_i) = e_i. M_i acting on A = e_i * A. A is called a weight vector.
  5. In theory, if you are given some random vector space D, you won’t know how many weights, how many L’s, exist in advance in this D-representation of the CSA. In practice, you work with vector spaces that you know something about, so it is possible to predict how many weights you will encounter in this vector space’s representation of the CSA.
  6. So in vector space V there could be 5 weights, L1 L2 L3 L4 L5. In another vector space W there could be 8 weights, N1 N2 N3 N4 N5 N6 N7 N8. In another vector space Y there could be 13 weights, P1-P13.
  7. Ok, now, let’s call the original Lie algebra T and the CSA S. T is, in fact, a vector space. If you represent S using the T-vector space, you have what is called the adjoint representation of this Lie algebra. The adjoint action, instead of being matrix multiplication, is the commutator: Adj_H(X) = [H,X]. H is an element of the CSA S. X is a vector in the Lie algebra T, the T-vector space (since T is a vector space).
  8. Now, for all H in S, a non-zero X in T and [H,X] = number(H)*X, then X is an eigenvector of all CSA (S) elements, H. You can organize these numbers by saying that L(H) = number. L is called a root. L eats a CSA element H and outputs a number. If an element H of the CSA satisfies L_j(H) = integer for all roots L, then H is called a coweight.