Skip to main content

Alcove

Struct Alcove 

Source
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

Source

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

Construct the fundamental alcove at level k = 1.

The fundamental alcove is:

A = {λ : ⟨λ, αᵢ⟩ ≥ 0, ⟨λ, θ⟩ ≤ 1}
Source

pub fn at_level(root_system: &RootSystem, level: f64) -> Self

Construct an alcove at a specified level k.

§Arguments
  • root_system - The root system
  • level - Affine level k (positive integer for integrable modules)
Source

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

Check if a weight is in the alcove.

§Arguments
  • weight - Weight λ ∈ 𝔥* to test
  • strict - If true, use strict inequalities
§Returns

True if λ is in the alcove

Source

pub fn level(&self) -> f64

Get the level of the alcove.

Source

pub fn highest_root(&self) -> &Root

Get the highest root defining the upper wall.

Source

pub fn vertices(&self) -> Vec<Root>

Compute vertices of the fundamental alcove.

For type A_n, the fundamental alcove is a simplex with n+1 vertices: the origin and the fundamental weights {ω₁, …, ωₙ}.

§Returns

Vector of vertices (as Roots in 𝔥*)

Trait Implementations§

Source§

impl Clone for Alcove

Source§

fn clone(&self) -> Alcove

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 Alcove

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