IdealDecomposition

Struct IdealDecomposition 

Source
pub struct IdealDecomposition<R: Field> { /* private fields */ }
Expand description

A verified finite family of top-dimensional minimal components.

The source and every component retain one exact polynomial-ring context. When present, frobenius_permutation[i] is the component obtained by applying coefficient Frobenius to component i.

Implementations§

Source§

impl<R: Field> IdealDecomposition<R>

Source

pub fn source(&self) -> &Ideal<PolynomialRing<R>>

The radical ideal reconstructed by intersecting the components.

Source

pub fn components(&self) -> &[Ideal<PolynomialRing<R>>]

Canonically ordered top-dimensional minimal components.

Source

pub fn frobenius_permutation(&self) -> Option<&[usize]>

Verified coefficient-Frobenius action, when the base carries one.

Source

pub fn verify(&self) -> Result<(), DecompositionError>

Recheck component contexts, dimensions, intersection, and permutation shape.

Source§

impl IdealDecomposition<RationalFunctionField<FiniteField>>

Source

pub fn verify_frobenius(&self) -> Result<(), DecompositionError>

Recompute the absolute coefficient-Frobenius image of every component.

Source

pub fn to_json(&self) -> Result<String, NoetherError>

Serialize the source, components, and verified Frobenius permutation.

Source

pub fn from_json(value: &str) -> Result<Self, NoetherError>

Deserialize and reverify the component intersection and Frobenius action.

Trait Implementations§

Source§

impl<R: Clone + Field> Clone for IdealDecomposition<R>

Source§

fn clone(&self) -> IdealDecomposition<R>

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<R: Field> Debug for IdealDecomposition<R>

Source§

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

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

impl<R: PartialEq + Field> PartialEq for IdealDecomposition<R>

Source§

fn eq(&self, other: &IdealDecomposition<R>) -> 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<R: Field> SemanticType for IdealDecomposition<R>

Source§

const TYPE_ID: &'static str = "noether/commalg/IdealDecomposition@1"

Versioned, language-neutral semantic identity.
Source§

fn canonical_bytes(&self) -> Result<Vec<u8>, NoetherError>

Serialize without backend- or language-specific identity.
Source§

fn describe() -> &'static TypeDescription

Return static discovery metadata for the type.
Source§

impl<R: Eq + Field> Eq for IdealDecomposition<R>

Source§

impl<R: Field> StructuralPartialEq for IdealDecomposition<R>

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> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
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.