Skip to main content

Crate auslander

Crate auslander 

Source
Expand description

Finite-dimensional basic algebras kQ/I over a checked prime field, and their finite-dimensional right modules.

I is an admissible ideal presented by uniform relations. Each relation is a k-linear combination of parallel paths. Every algebra comes from one pipeline: completion rewrites the relations into a reduced Groebner basis and emits a certificate. An independent verifier checks that certificate before the algebra is built.

Two conventions are fixed crate-wide. Modules are right modules, written with row vectors. Paths compose left to right: a·b means first a, then b, and M(a·b) = M(a) M(b).

Partiality is typed. A dimension known only from below is Bounded::AtLeast. A resolution prefix that runs out of budget ends in ResolutionEnd::Cut with the next syzygy known to be nonzero. Nothing truncates silently.

Modules§

algebra
Bound quiver algebras kQ/I with a certificate-verified normal-word basis.
almost_split
Projectively trivial maps, stable Hom, the AR socle construction, and witnessed almost-split sequences.
approx
Minimal left add(N)-approximations, with factorization data and a radical-containment minimality witness.
ar
The AR translate τ, computed two independent ways with an automatic cross-check.
arquiver
The category radical of certified indecomposables, exhaustive indecomposable catalogs, and the valued Auslander-Reiten quiver.
basic
Basic decompositions, projective support, and exact identity for basic pairs.
certificate
Completion certificates: the data model shared by the completion engine and the verifier, with canonical JSON encoding and strict decoding.
completion
Bergman-style completion for two-sided ideals in the path algebra.
complex
Finite module complexes, with checked zero composites and exactness.
decompose
Direct-sum decomposition: verified splits, idempotent splitting, and certificates.
dynkin
Dynkin and Euclidean diagrams of a quiver’s underlying graph, their root systems, and the indecomposables of a hereditary path algebra of Dynkin type.
endo
The endomorphism algebra End(M) as a finite-dimensional algebra over F_p.
enumerate
Indecomposable enumeration for Nakayama algebras.
ext
Ext groups over minimal resolutions: dimensions, global dimension, ExtSpace and ExtClass as explicit vector space data, and Yoneda products with their chain-lift witnesses.
field
Prime fields F_p with construction-time primality checking.
hochschild
Relative normalized bar Hochschild cohomology with typed resource cuts.
hom
Morphisms of modules, the Hom functor, and kernels, images, and cokernels.
homspace
Hom_A(M, N) as an explicit vector space: fixed basis, flat coordinates, subspaces, and deterministic quotients.
indec
Modules certified indecomposable by a local endomorphism algebra.
injective
Injective envelopes and minimal injective coresolutions, dual to crate::resolution.
iso
Isomorphism testing with verified witnesses and typed obstructions.
linalg
Exact linear algebra over F_p.
module
Finite-dimensional modules over an Algebra.
monomial
Monomial ideals: their combinatorial data, and their field-free analysis.
mutation
Left mutation of a support tau-tilting pair at a module summand slot.
opposite
Opposite algebras, the k-dual functor D, and the Nakayama functor ν on maps between projectives.
order
The sealed admissible order deglex-arrowid-v1 on path words.
profile
Exact call counters for the primitives and the layers above them, behind the profiling feature.
quiver
Quivers and path words.
radical
Radical, top, socle, and Loewy series of modules.
relation
Uniform relations and presentations for bound quiver algebras kQ/I.
resolution
Projective covers and minimal projective resolutions with explicit status.
sequence
Checked short exact sequences: construction from an Ext^1 class, recovery of that class, and split status with a proof either way.
supporttau
Support tau-tilting pairs, decided by support arithmetic, and a definition-only enumerator over an exhaustive catalog.
taugraph
The budgeted mutation walk from (A, 0) and its closure certificate.
taurigid
Tau-rigidity, decided one indecomposable at a time.
tilting
Classical tilting modules with finite projective and generation bounds.
verify
Independent verification of completion certificates.