Skip to main content

WeylChamber

Struct WeylChamber 

Source
pub struct WeylChamber { /* private fields */ }
Expand description

Weyl chamber for a root system.

A Weyl chamber is a connected component of the complement of the reflecting hyperplanes in the dual Cartan space ๐”ฅ*. The fundamental Weyl chamber (or dominant chamber) is defined by the simple roots:

C = {ฮป โˆˆ ๐”ฅ* : โŸจฮป, ฮฑแตขโŸฉ โ‰ฅ 0 for all simple roots ฮฑแตข}

ยงMathematical Background

  • The Weyl group W acts on ๐”ฅ* by reflections through root hyperplanes
  • W partitions ๐”ฅ* into finitely many Weyl chambers
  • All chambers are isometric under W
  • The fundamental chamber parametrizes dominant weights (highest weights of irreducible representations)

ยงExample

use lie_groups::root_systems::{RootSystem, WeylChamber, Root};

let root_system = RootSystem::type_a(2); // SU(3)
let chamber = WeylChamber::fundamental(&root_system);

// Fundamental weight ฯ‰โ‚ = (2/3, -1/3, -1/3) is dominant (traceless for SU(3))
let omega1 = Root::new(vec![2.0/3.0, -1.0/3.0, -1.0/3.0]);
assert!(chamber.contains(&omega1, false)); // Non-strict since on boundary

// Negative weight is not dominant
let neg = Root::new(vec![-1.0, 0.0, 1.0]);
assert!(!chamber.contains(&neg, false));

ยงReferences

  • Humphreys, Introduction to Lie Algebras, ยง10.2
  • Hall, Lie Groups, ยง8.4

Implementationsยง

Sourceยง

impl WeylChamber

Source

pub fn fundamental(root_system: &RootSystem) -> Self

Construct the fundamental Weyl chamber for a root system.

The fundamental chamber is bounded by hyperplanes perpendicular to the simple roots:

C = {ฮป : โŸจฮป, ฮฑแตขโŸฉ โ‰ฅ 0 for all simple ฮฑแตข}
Source

pub fn contains(&self, weight: &Root, strict: bool) -> bool

Check if a weight is in the Weyl chamber.

ยงArguments
  • weight - Weight ฮป โˆˆ ๐”ฅ* to test
  • strict - If true, use strict inequality (โŸจฮป, ฮฑแตขโŸฉ > 0); else non-strict (โ‰ฅ 0)
ยงReturns

True if ฮป is in the chamber (dominant weight)

Source

pub fn project(&self, weight: &Root) -> Root

Project a weight onto the closure of the fundamental Weyl chamber.

Uses the Weyl group to map an arbitrary weight to its unique dominant representative (closest point in the chamber).

ยงAlgorithm

Iteratively reflect through violated hyperplanes until all simple root pairings are non-negative.

Source

pub fn simple_roots(&self) -> &[Root]

Get the simple roots defining the chamber walls.

Trait Implementationsยง

Sourceยง

impl Clone for WeylChamber

Sourceยง

fn clone(&self) -> WeylChamber

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 WeylChamber

Sourceยง

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

Formats the value using the given formatter. Read more

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, 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