Skip to main content

DividedPowerAlgebra

Struct DividedPowerAlgebra 

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

The divided power algebra Γ(V) on dim generators, the context object (mirroring CliffordAlgebra).

Implementations§

Source§

impl DividedPowerAlgebra

Source

pub fn new(dim: usize) -> Self

Constructs the divided-power algebra on dim generators.

Source

pub fn dim(&self) -> usize

The number of generators of this divided power algebra.

Source

pub fn zero<S: Scalar>(&self) -> DpVector<S>

The zero element.

Source

pub fn scalar<S: Scalar>(&self, s: S) -> DpVector<S>

The scalar s as an element of Γ (the empty-degree term).

Source

pub fn one<S: Scalar>(&self) -> DpVector<S>

The identity 1 = γ^{[0]}.

Source

pub fn divided_power<S: Scalar>(&self, i: usize, k: u128) -> DpVector<S>

The divided power γ_i^{[k]}.

Source

pub fn gamma1<S: Scalar>(&self, i: usize) -> DpVector<S>

The generator γ_i = γ_i^{[1]} (primitive).

Source

pub fn monomial<S: Scalar>(&self, alpha: &[u128], coeff: S) -> DpVector<S>

The monomial coeff · γ^{[α]} from a multidegree (padded / checked).

Source

pub fn add<S: Scalar>(&self, x: &DpVector<S>, y: &DpVector<S>) -> DpVector<S>

Adds two divided-power vectors.

Source

pub fn scalar_mul<S: Scalar>(&self, s: &S, x: &DpVector<S>) -> DpVector<S>

Multiplies a divided-power vector by a scalar.

Source

pub fn mul<S: Scalar>(&self, x: &DpVector<S>, y: &DpVector<S>) -> DpVector<S>

The binomial product γ^{[α]} · γ^{[β]} = Π_i \binom{α_i+β_i}{α_i} γ^{[α+β]}.

Each factor \binom{α_i+β_i}{α_i} is embedded char-faithfully: in characteristic p > 0 this applies Lucas’ theorem so the embedding is O(log_p(α_i+β_i)) regardless of the magnitude of the binomial coefficient — no O(binom) loop.

Source

pub fn coproduct<S: Scalar>(&self, x: &DpVector<S>) -> BTreeMap<DpTensorKey, S>

The deconcatenation coproduct Δγ^{[α]} = Σ_{β+γ=α} γ^{[β]} ⊗ γ^{[γ]} (sign-free — the symmetric mirror of the exterior unshuffle). Returned as a map (β, γ) → coeff over Γ ⊗ Γ.

Source

pub fn counit<S: Scalar>(&self, x: &DpVector<S>) -> S

The counit ε: Γ → S — projection to the empty-degree (scalar) part.

Source

pub fn antipode<S: Scalar>(&self, x: &DpVector<S>) -> DpVector<S>

The antipode S(γ^{[α]}) = (−1)^{|α|} γ^{[α]} — the grade involution by total degree (sign through the scalar’s own neg, so char 2 ⇒ identity).

Trait Implementations§

Source§

impl Clone for DividedPowerAlgebra

Source§

fn clone(&self) -> DividedPowerAlgebra

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for DividedPowerAlgebra

Source§

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

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

impl Eq for DividedPowerAlgebra

Source§

impl PartialEq for DividedPowerAlgebra

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for DividedPowerAlgebra

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