Minimal generating sets in a general algebra need not have equal size. The Irredundant Basis Theorem says the sizes they can take form an interval, with no gaps.
Engineering · Mathematics10 min readKV-MATH-0212
Learning objectives
Define an irredundant basis and give an algebra with bases of different sizes.
State the exchange property and identify where it fails.
State the Irredundant Basis Theorem precisely.
Explain why 'no gaps' is the strongest available conclusion.
Relate the theorem to the closure-operator setting in which it is proved.
01Irredundant bases
A subset X of an algebra A is an irredundant basis when Sg(X) = A and no proper subset of X generates A. Equivalently, X generates and every element of X is needed.
CautionIrredundant is weaker than independent
Irredundance says no element is superfluous. Independence, in the vector space sense, says no element lies in the closure of the others — which for closure operators is the same thing — but crucially neither implies that all irredundant bases have the same size. That further conclusion needs the exchange property, which general algebras lack.
The vector space case is anomalous, not typical. There, the exchange property forces every basis to have the same cardinality, and dimension is well defined. Remove the exchange property and dimension simply does not exist as an invariant.
02The exchange property and its failure
Exchange: a ∈ Sg(X ∪ {b}) and a ∉ Sg(X) ⟹ b ∈ Sg(X ∪ {a})
Holds for linear span, for algebraic closure in field theory, and for very little else in general algebra.
A closure operator with the exchange property is called a matroid or a pregeometry, and for those the cardinality of an irredundant basis is an invariant. Subuniverse generation in an arbitrary algebra is not a matroid, and irredundant bases of different sizes coexist routinely.
Take a semilattice or a groupoid
Small finite examples with two irredundant generating sets of different cardinality are easy to construct once the exchange property is abandoned.
Observe there is no dimension
The size of a minimal generating set is not an invariant of the algebra, so no notion of rank survives.
Ask what does survive
The set of achievable sizes. That set turns out to be constrained, and the constraint is the theorem.
03The theorem
Let IrB(A) denote the set of cardinalities of irredundant bases of A. The theorem asserts that for a finitely generated algebra this set contains no gaps.
Key resultThe Irredundant Basis Theorem
If A is a finitely generated algebra and IrB(A) is the set of sizes of its irredundant bases, then IrB(A) is a set of consecutive integers — an interval. If bases of size m and size n exist with m < n, then bases of every intermediate size exist too.
The result is stated and proved in the source at the level of closure operators rather than algebras, which is the right generality: nothing about the algebraic structure is used beyond the fact that generation is a finitary closure operator. That abstraction is characteristic of the subject's method.
04Why 'no gaps' is the right conclusion
Strongest false claim
All bases equal size
Refuted by explicit small examples. The exchange property fails, so nothing forces uniqueness of cardinality.
Strongest true claim
The sizes form an interval
Cannot be improved: for any prescribed interval one can construct an algebra realising exactly that set of basis sizes.
That the bound is attained is what makes the theorem sharp rather than merely true. It also illustrates a recurring pattern: when a classical invariant fails to generalise, the correct replacement is often a constraint on the set of possible values rather than a single value.
05Proof strategy
ProcedureFilling a gap between two irredundant basis sizes
in: two irredundant bases of different size → out: bases of all intermediate sizes
input: finitely generated A with irredundant bases X, Z, |X| = m < n = |Z|
goal: produce an irredundant basis of size k for each m < k < n
start from X and adjoin elements of Z one at a time
after each adjunction, prune to an irredundant subset that still generates
each step changes the size by at most one
so every intermediate cardinality is realised along the way
output: irredundant basis of size k
Correctness: the pruning step preserves generation, and adjunction increases size by exactly one, so the size sequence cannot jump. Caveat: finiteness of the generating set is essential — the argument uses that the process terminates.
Frequently asked
Does the theorem hold for infinitely generated algebras?
The clean interval statement is for the finitely generated case. In the infinite setting cardinal arithmetic swamps the combinatorics and the question changes character. The source states and proves the finitely generated version, which is where the content lies.
Do vector spaces satisfy the theorem trivially?
Yes — IrB(V) is a single number, namely the dimension, and a one-element set is trivially an interval. The theorem is only informative where the exchange property fails, which is to say almost everywhere else.
Is there an algorithm to compute IrB(A) for a finite algebra?
For a finite algebra one can in principle enumerate subsets and test generation, so the set is computable, but the search is exponential in |A|. The theorem helps in practice by reducing the problem to finding the extremes: once the minimum and maximum irredundant basis sizes are known, every value between them is realised and need not be searched for separately.
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 The Irredundant Basis 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 The Irredundant Basis Theorem as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—irredundant, basis, theorem, exchange, property—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 The Irredundant Basis 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 irredundant 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 — Linear Algebra — Massachusetts Institute of Technology. Used for systems, vector spaces, determinants, eigenvalues and matrices. Accessed 2026-08-13.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
