Quasiprimality relaxes primality to a single requirement: the discriminator must be a term operation. Pixley's theorem characterises exactly which finite algebras qualify.
Engineering · Mathematics11 min readKV-MATH-0242
Learning objectives
Define quasiprimality and relate it to the discriminator.
State Pixley's theorem characterising quasiprimal algebras.
Explain the role of inner isomorphisms.
Compare quasiprimal with primal and identify what is relaxed.
Determine the subalgebras and congruences of a quasiprimal algebra.
Recognise how quasiprimal algebras generate discriminator varieties.
01Quasiprimality
A finite algebra A with at least two elements is quasiprimal when the ternary discriminator on A is a term operation of A.
Primal
Every operation is a term operation
Maximal demand. Forces no subalgebras, no congruences, no automorphisms.
Quasiprimal
The discriminator is a term operation
One operation only. Allows proper subalgebras and non-trivial automorphisms, but still forces simplicity.
Key resultQuasiprimal implies simple
If the discriminator is a term operation and θ is a congruence relating distinct a and b, then applying the discriminator gives t(a, b, c) = a related to t(a, a, c) = c for arbitrary c. So every element is θ-related to a, and θ is everything. A quasiprimal algebra is therefore simple.
Simplicity is forced, but the other two consequences of primality are not. A quasiprimal algebra may have proper subalgebras and may have non-trivial automorphisms — and Pixley's theorem says exactly how these must interact.
02Pixley's theorem
The characterisation is in terms of inner isomorphisms — isomorphisms between subalgebras of A.
Key resultPixley's characterisation
A finite algebra A is quasiprimal if and only if every operation on A that preserves all inner isomorphisms of A is a term operation. Equivalently: the term operations of A are exactly the operations commuting with every isomorphism between subalgebras of A.
ProcedureReading the criterion
in: finite algebra A → out: quasiprimal or not
input: finite algebra A
compute Sub(A), the subuniverses of A
compute Iso(A), the set of isomorphisms between members of Sub(A)
(this includes automorphisms and identity maps on subalgebras)
for a candidate operation g on A:
g preserves an inner isomorphism φ : C → D when applying g
inside C and then φ agrees with applying φ then g inside D
A is quasiprimal iff every operation preserving ALL inner isomorphisms
is already a term operation
output: quasiprimality decision
This is a Galois-connection statement: term operations and inner isomorphisms are polarities of each other. Caveat: computing Iso(A) is expensive, so the practical test is usually to search directly for a discriminator term.
The theorem is a clone-theoretic statement: it identifies the clone of term operations with the clone of operations preserving a specified relational structure. This operation–relation Galois connection is the standard framework for clone theory and reappears in the algebraic approach to constraint satisfaction.
03What primality adds
Primal is quasiprimal plus the vanishing of all inner structure.
Comparing the two conditions
Feature
Primal
Quasiprimal
Discriminator is a term operation
Yes
Yes
Simple
Yes
Yes
Proper subalgebras
None
Permitted
Non-trivial automorphisms
None
Permitted
Inner isomorphisms
only identities
may be rich
Every operation a term operation
Yes
Only those preserving inner isomorphisms
Generated variety
equivalent to Boolean algebras
a discriminator variety
So primality is the case where the only inner isomorphisms are the identity maps, which makes the preservation condition vacuous and every operation a term operation. Pixley's theorem contains Foster's as the degenerate case.
04Generated varieties
A quasiprimal algebra generates a discriminator variety, and Jónsson's lemma pins down its subdirectly irreducibles precisely.
The discriminator is a term operation
So V(A) is a discriminator variety by definition, and inherits the whole structural package: arithmetical, semisimple, CEP, Boolean product representation.
Jónsson's lemma applies
V(A) is congruence-distributive and A is finite, so the subdirectly irreducibles lie in HS({A}).
Quotients are trivial
A is simple, so H({A}) contributes only A and the trivial algebra. The subdirectly irreducibles are therefore among the subalgebras of A.
Conclusion
The subdirectly irreducible members of V(A) are exactly the subalgebras of A on which the discriminator term still acts as the discriminator — a finite, computable list bounded by |A|.
Every member of V(A) is then a Boolean product of algebras from that finite list. The variety is completely described by a finite amount of data, which is as good as structure theory gets.
05Deciding quasiprimality in practice
The practical route is not Pixley's criterion but a direct search for a discriminator term.
ProcedureSearching for a discriminator term
in: finite algebra A → out: discriminator term or 'not quasiprimal'
input: finite algebra A of finite type
target: a ternary term t with t(a,b,c) = c when a = b, and = a when a ≠ b
enumerate term operations of increasing depth:
depth 0: projections
depth k+1: apply each basic operation to depth-k term operations
at each stage check whether any ternary term operation matches the target table
the clone of a finite algebra is finite, so the search terminates
output: a discriminator term, or a proof that none exists
Termination: the number of distinct ternary operations on A is |A|^(|A|³), finite, so generation stabilises. Caveat: that bound is astronomically large even for small A; practical implementations such as UACalc use much better search strategies and should be preferred to a naive enumeration.
CautionThe naive bound is not a usable algorithm
Quoting |A|^(|A|³) as the search space makes the procedure sound feasible for small algebras and it is not — for |A| = 4 that is already 4^64. Use a purpose-built tool. The sourcing policy page routes to the current ones.
06Where quasiprimality sits
The clone-theoretic hierarchy
Condition
Clone requirement
Consequence
Primal
clone = all operations
V(A) ≃ Boolean algebras
Quasiprimal
clone contains the discriminator
V(A) a discriminator variety
Functionally complete
polynomial clone = all operations
A is simple with no proper subalgebras up to constants
Demi-semi-primal and variants
weaker conditions
studied in the older literature
Arbitrary finite algebra
no condition
no general structure theory
The older literature contains a proliferation of primality variants — semiprimal, demi-semi-primal, hemiprimal and others — most of which were absorbed once quasiprimality and the discriminator were identified as the right notions. The source treats quasiprimality as the central case and the earlier taxonomy as largely superseded.
Frequently asked
Can a quasiprimal algebra have non-trivial automorphisms?
Yes — that is precisely what distinguishes it from primality. The automorphisms are inner isomorphisms from A to itself, and Pixley's theorem says term operations must commute with them. A primal algebra is rigid; a quasiprimal one need not be.
Are all quasiprimal algebras finite?
The definition as usually stated is for finite algebras, and Pixley's theorem uses finiteness essentially. Infinite algebras with a discriminator term operation exist and generate discriminator varieties, but the characterisation via inner isomorphisms does not extend unchanged.
Is quasiprimality preserved by subalgebras?
A subalgebra of a quasiprimal algebra inherits the discriminator term, so the term still acts as the discriminator on it, making the subalgebra quasiprimal too. This is why the subdirectly irreducibles of the generated variety are exactly the subalgebras.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Quasiprimal Algebras and Pixley's Theorem. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Quasiprimal Algebras and Pixley's Theorem as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—quasiprimal, algebras, pixley's, theorem, quasiprimality—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Quasiprimal Algebras and Pixley's Theorem?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about quasiprimal would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
