pub struct Alcove { /* private fields */ }Expand description
Fundamental alcove for an affine root system.
An alcove is a bounded region in the Cartan space defined by affine hyperplanes (root hyperplanes shifted by integer levels). The fundamental alcove is:
A = {λ ∈ 𝔥* : ⟨λ, αᵢ⟩ ≥ 0 for all simple αᵢ, and ⟨λ, θ⟩ ≤ 1}where θ is the highest root (longest root in the positive system).
§Mathematical Background
- Alcoves tile 𝔥* under the affine Weyl group Wₐff
- The fundamental alcove parametrizes integrable highest-weight modules at level k (conformal field theory, loop groups)
- Vertices of the alcove are fundamental weights
§Example
use lie_groups::root_systems::{RootSystem, Alcove, Root};
let root_system = RootSystem::type_a(2); // SU(3)
let alcove = Alcove::fundamental(&root_system);
// Weight inside alcove
let lambda = Root::new(vec![0.3, 0.3, -0.6]);
// (need to verify ⟨λ, αᵢ⟩ ≥ 0 and ⟨λ, θ⟩ ≤ 1)§References
- Kac, Infinite Dimensional Lie Algebras, §6.2
- Humphreys, Reflection Groups and Coxeter Groups, §4.4
Implementations§
Source§impl Alcove
impl Alcove
Sourcepub fn fundamental(root_system: &RootSystem) -> Self
pub fn fundamental(root_system: &RootSystem) -> Self
Construct the fundamental alcove at level k = 1.
The fundamental alcove is:
A = {λ : ⟨λ, αᵢ⟩ ≥ 0, ⟨λ, θ⟩ ≤ 1}Sourcepub fn at_level(root_system: &RootSystem, level: f64) -> Self
pub fn at_level(root_system: &RootSystem, level: f64) -> Self
Construct an alcove at a specified level k.
§Arguments
root_system- The root systemlevel- Affine level k (positive integer for integrable modules)
Sourcepub fn highest_root(&self) -> &Root
pub fn highest_root(&self) -> &Root
Get the highest root defining the upper wall.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Alcove
impl RefUnwindSafe for Alcove
impl Send for Alcove
impl Sync for Alcove
impl Unpin for Alcove
impl UnsafeUnpin for Alcove
impl UnwindSafe for Alcove
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.