Skip to main content

Su3Algebra

Struct Su3Algebra 

Source
pub struct Su3Algebra(/* private fields */);
Expand description

Lie algebra su(3) - 8-dimensional space of traceless anti-Hermitian 3×3 matrices

Elements are represented by 8 real coefficients [a₁, a₂, …, a₈] corresponding to the linear combination:

X = i·∑ⱼ aⱼ·λⱼ

where λⱼ are the Gell-Mann matrices (j = 1..8).

§Basis Elements

The 8 Gell-Mann matrices form a basis for su(3). They satisfy:

  • Hermitian: λⱼ† = λⱼ
  • Traceless: Tr(λⱼ) = 0
  • Normalized: Tr(λⱼ λₖ) = 2δⱼₖ

§Examples

use lie_groups::su3::Su3Algebra;
use lie_groups::traits::LieAlgebra;

// First basis element (λ₁)
let e1 = Su3Algebra::basis_element(0);
assert_eq!(*e1.components(), [1.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0]);

Implementations§

Source§

impl Su3Algebra

Source

pub fn new(components: [f64; 8]) -> Self

Create a new su(3) algebra element from components.

The 8 components correspond to coefficients in the Gell-Mann basis: X = i·∑ⱼ aⱼ·λⱼ

Source

pub fn components(&self) -> &[f64; 8]

Returns the components as a fixed-size array reference.

Source§

impl Su3Algebra

Source

pub fn to_matrix(&self) -> Array2<Complex64>

Convert algebra element to 3×3 anti-Hermitian matrix

Returns X = i·∑ⱼ aⱼ·(λⱼ/2) where λⱼ are Gell-Mann matrices. Convention: tr(Tₐ†Tᵦ) = ½δₐᵦ where Tₐ = iλₐ/2.

Source

pub fn from_matrix(matrix: &Array2<Complex64>) -> Self

Extract algebra element from 3×3 anti-Hermitian matrix

Inverse of to_matrix(). Uses the normalization Tr(λⱼ λₖ) = 2δⱼₖ.

Given X = i·∑ⱼ aⱼ·(λⱼ/2), we have Tr(X·λⱼ) = i·aⱼ, so aⱼ = -i·Tr(X·λⱼ).

Source

pub fn gell_mann_matrix(j: usize) -> Array2<Complex64>

Get the j-th Gell-Mann matrix (j = 0..7 for λ₁..λ₈)

Returns the Hermitian Gell-Mann matrix λⱼ (not i·λⱼ).

Trait Implementations§

Source§

impl AbsDiffEq for Su3Algebra

Source§

type Epsilon = f64

Used for specifying relative comparisons.
Source§

fn default_epsilon() -> Self::Epsilon

The default tolerance to use when testing values that are close together. Read more
Source§

fn abs_diff_eq(&self, other: &Self, epsilon: Self::Epsilon) -> bool

A test for equality that uses the absolute difference to compute the approximate equality of two numbers.
Source§

fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool

The inverse of AbsDiffEq::abs_diff_eq.
Source§

impl Add<&Su3Algebra> for &Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the + operator.
Source§

fn add(self, rhs: &Su3Algebra) -> Su3Algebra

Performs the + operation. Read more
Source§

impl Add<&Su3Algebra> for Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the + operator.
Source§

fn add(self, rhs: &Su3Algebra) -> Su3Algebra

Performs the + operation. Read more
Source§

impl Add<Su3Algebra> for &Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the + operator.
Source§

fn add(self, rhs: Su3Algebra) -> Su3Algebra

Performs the + operation. Read more
Source§

impl Add for Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the + operator.
Source§

fn add(self, rhs: Self) -> Self

Performs the + operation. Read more
Source§

impl Casimir for Su3Algebra

Source§

fn higher_casimir_eigenvalues(irrep: &Self::Representation) -> Vec<f64>

Cubic Casimir eigenvalue for SU(3).

For representation (p, q), the cubic Casimir eigenvalue is:

c₃(p,q) = (1/18)(p - q)(2p + q + 3)(p + 2q + 3)
§Properties
  • Conjugation: c₃(p,q) = -c₃(q,p). Conjugate representations have opposite c₃.
  • Self-conjugate representations: c₃ = 0 when p = q (e.g., adjoint (1,1)).
  • Physical interpretation: In QCD, distinguishes quarks (positive c₃) from antiquarks (negative c₃) beyond the quadratic Casimir.
§Examples
(0,0): c₃ = 0         (trivial)
(1,0): c₃ = 10/9      (fundamental)
(0,1): c₃ = -10/9     (antifundamental)
(1,1): c₃ = 0         (adjoint, self-conjugate)
(2,0): c₃ = 70/9      (symmetric tensor)
§Reference

Georgi, “Lie Algebras in Particle Physics” (1999), Chapter 7.

Source§

type Representation = Su3Irrep

Type representing irreducible representations of this algebra. Read more
Source§

fn quadratic_casimir_eigenvalue(irrep: &Self::Representation) -> f64

Eigenvalue of the quadratic Casimir operator in a given irrep. Read more
Source§

fn rank() -> usize

Dimension of the Cartan subalgebra (rank of the algebra). Read more
Source§

fn num_casimirs() -> usize

Number of independent Casimir operators. Read more
Source§

impl Clone for Su3Algebra

Source§

fn clone(&self) -> Su3Algebra

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Su3Algebra

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Display for Su3Algebra

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl LieAlgebra for Su3Algebra

Source§

fn bracket(&self, other: &Self) -> Self

Lie bracket for su(3): [X, Y] = XY - YX

Computed using structure constants fᵢⱼₖ for O(1) performance.

§Mathematical Formula

For X = i·∑ᵢ aᵢ·(λᵢ/2) and Y = i·∑ⱼ bⱼ·(λⱼ/2):

[X, Y] = -i·∑ₖ (∑ᵢⱼ aᵢ·bⱼ·fᵢⱼₖ)·(λₖ/2)
§Performance

Uses pre-computed table of non-zero structure constants.

  • Old implementation: O(512) iterations with conditional checks
  • New implementation: O(54) direct lookups
  • Speedup: ~10× fewer operations
§Complexity

O(1) - constant time (54 multiply-adds)

§Properties
  • Antisymmetric: [X, Y] = -[Y, X]
  • Jacobi identity: [X, [Y, Z]] + [Y, [Z, X]] + [Z, [X, Y]] = 0
Source§

const DIM: usize = 8

Dimension of the Lie algebra as a compile-time constant. Read more
Source§

fn zero() -> Self

Zero element (additive identity) 0 ∈ 𝔤. Read more
Source§

fn add(&self, other: &Self) -> Self

Add two algebra elements: v + w Read more
Source§

fn scale(&self, scalar: f64) -> Self

Scalar multiplication: α · v Read more
Source§

fn norm(&self) -> f64

Euclidean norm of the coefficient vector: ||v|| = √(Σᵢ vᵢ²) Read more
Source§

fn basis_element(i: usize) -> Self

Get the i-th basis element of the Lie algebra. Read more
Source§

fn from_components(components: &[f64]) -> Self

Construct algebra element from basis coordinates. Read more
Source§

fn to_components(&self) -> Vec<f64>

Extract basis coordinates from algebra element. Read more
Source§

fn inner(&self, other: &Self) -> f64

Inner product on coefficient space: ⟨v, w⟩ = Σᵢ vᵢ wᵢ Read more
Source§

impl Mul<Su3Algebra> for f64

Source§

type Output = Su3Algebra

The resulting type after applying the * operator.
Source§

fn mul(self, rhs: Su3Algebra) -> Su3Algebra

Performs the * operation. Read more
Source§

impl Mul<f64> for Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the * operator.
Source§

fn mul(self, scalar: f64) -> Self

Performs the * operation. Read more
Source§

impl Neg for Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the - operator.
Source§

fn neg(self) -> Self

Performs the unary - operation. Read more
Source§

impl PartialEq for Su3Algebra

Source§

fn eq(&self, other: &Su3Algebra) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl RelativeEq for Su3Algebra

Source§

fn default_max_relative() -> Self::Epsilon

The default relative tolerance for testing values that are far-apart. Read more
Source§

fn relative_eq( &self, other: &Self, epsilon: Self::Epsilon, max_relative: Self::Epsilon, ) -> bool

A test for equality that uses a relative comparison if the values are far apart.
Source§

fn relative_ne( &self, other: &Rhs, epsilon: Self::Epsilon, max_relative: Self::Epsilon, ) -> bool

The inverse of RelativeEq::relative_eq.
Source§

impl Sub for Su3Algebra

Source§

type Output = Su3Algebra

The resulting type after applying the - operator.
Source§

fn sub(self, rhs: Self) -> Self

Performs the - operation. Read more
Source§

impl AntiHermitianByConstruction for Su3Algebra

su(3) algebra elements are anti-Hermitian by construction.

The representation uses {iλⱼ} where λⱼ are Hermitian Gell-Mann matrices.

Source§

impl Copy for Su3Algebra

Source§

impl StructuralPartialEq for Su3Algebra

Source§

impl TracelessByConstruction for Su3Algebra

su(3) algebra elements are traceless by construction.

The representation Su3Algebra::new([f64; 8]) stores coefficients in the Gell-Mann basis {iλ₁, …, iλ₈}. All Gell-Mann matrices are traceless.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> ClosedNeg for T
where T: Neg<Output = T>,

Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,