Algebra you
can check.

Change a matrix, browse a basis, decompose a complex, and reduce a monomial to its unique normal form.

Four constructions connect exterior algebra and standard monomials to gentle representations. Every displayed identity is recomputed with exact integer arithmetic.

The manuscript supplies the proofs and general theorems. These finite calculations make their inputs and conclusions inspectable.

Open the research monograph →
01

Six minors, one relation.

The two rows of a 2 × 4 matrix determine an exterior product. Its six coordinates obey a quadratic relation.

Edit the matrix

Enter integers from −9 to 9. Columns are numbered 1–4.

pij = m1im2j − m1jm2i, for i < j.

Exterior coordinates

p12p34 − p13p24 + p14p23 = 0

Why this identity matters

Expanding the three products cancels every term in pairs. The result is a polynomial identity over every commutative ring. A nonzero exterior product gives a projective point of Gr(2,4) over a field; zero minors give the zero exterior product, which is not a projective point. The displayed row rank is computed over ℚ and can change after reduction modulo a prime.

Straightening rewrites products that violate a chosen tableau order using relations such as this one. A basis theorem also needs a proof of independence, beyond the ability to rewrite expressions.

Source: manuscript, “Two-row tableaux and the Plücker algebra.” Read the proof.

02

A basis in fifteen fillings.

For shape (3,2) and entries 1, 2, 3, semistandard means weakly increasing rows and strictly increasing columns.

Selected filling

Rows are weakly increasing
Columns are strictly increasing
Weight monomial

The exponent of xᵢ counts entries equal to i. Summing these fifteen weight monomials gives the Schur character s(3,2)(x₁,x₂,x₃).

Hook–content dimension

Hook lengths and characteristic assumptions

The hook–content product is ∏(i,j)∈λ(3+j−i)/hij. For shape (3,2), the hook lengths are 4, 3, 1 in the first row and 2, 1 in the second; the corresponding contents plus 3 are 3, 4, 5 and 2, 3. Thus 360/24 = 15 as an integer identity.

The integral Schur module has this tableau basis; its rank remains 15 after base change, including to positive characteristic. Irreducibility and semisimple representation decompositions are additional characteristic-zero results. Dividing by the hook product 24 inside a field of characteristic 2 or 3 is not a valid substitute for the integral construction.

Source: manuscript, “Partitions and a characteristic-free Schur presentation,” including the Akin–Buchsbaum–Weyman basis theorem. Read the theorem and qualifications.

03

A relation determines the modules.

For the quiver 1 → 2 → 3 with ba = 0, a representation is a complex kp → kq → kr. Its two ranks determine its decomposition over any field.

Teal arrows are M₁₂ summands; ochre arrows are M₂₃ summands. Unjoined basis points are simple modules. This diagram specifies actual canonical matrices.

Allowable rank pairs

0 ≤ u ≤ min(p,q), 0 ≤ v ≤ min(q,r), and u+v ≤ q. Select a pair to change the decomposition.

Inspect U, V, and the zero composite

In this chosen basis, U has an identity in its first u positions. V uses the next v middle coordinates, so VU is exactly zero. Zero-dimensional spaces are allowed.

The multiplicities are M₁₂ᵘ ⊕ M₂₃ᵛ ⊕ S₁ᵖ⁻ᵘ ⊕ S₂ᑫ⁻ᵘ⁻ᵛ ⊕ S₃ʳ⁻ᵛ. Choosing bases of im U, a complement in ker V, and a complement to ker V proves this decomposition. Each of these five modules has endomorphism ring k and is indecomposable.

Source: manuscript, “Complete module decomposition for the two-arrow relation.” The (1,2,1) equation is x₁y₁+x₂y₂=0: explore its four-dimensional real cone.

04

Two rewrites, one normal form.

Eight monomial generators map into ten underlying variables. Reduce paired Y and Z factors while preserving every exponent.

Y₁Y₂ = B₁X₁X₂
Z₁Z₂ = B₁B₂

The first factor is B₁. Direct multiplication corrects B₂ in the printed relation of Carroll–Weyman, arXiv v1, Example 8.20. Set input exponents from 0 to 12; reduction can produce larger exponents.

Input monomial

Unique reduced monomial

Exact exponent preservation in the ten underlying variables
Expressiona₁a₂a₃a₄a₅b₁b₂b₃b₄b₅
Why reduction terminates and the correction is necessary

Each rewrite removes two Y factors or two Z factors. The right sides create neither Y nor Z, so both reductions terminate and commute. A reduced monomial contains neither both Y₁,Y₂ nor both Z₁,Z₂. The integer kernel calculation in the manuscript proves that two reduced monomials with the same ten-coordinate vector are identical; this establishes uniqueness beyond the displayed finite examples.

The grading comes from the underlying variables: deg Xᵢ = 2, deg Yᵢ = 4, deg Zᵢ = 3, deg B₁ = 4, deg B₂ = 2. The relations have degrees 8 and 6. Treating all eight generator symbols as degree one would not preserve these relations.

Primary source: Carroll–Weyman, Semi-Invariants for Gentle String Algebras, Example 8.20. Correction and full normal-form proof: manuscript, “A matching semigroup with two explicit binomial relations.”

Follow the maps between constructions.

Minors are exterior coordinates. Tableaux organize Schur bases and straightening. The relation ba=0 turns a gentle representation into a complex. Matching equations then give a concrete semi-invariant semigroup with a verified presentation. Each transition retains its field, grading, and proof assumptions.

Read the complete proofs · Explore the complex variety in 4D · Follow a cellular complex into a quantum code