Minimal, maximal, least & greatest elements
These four words are the most confused pair of pairs in order theory. An element is minimal if nothing is strictly below it; it is least if it is below everything. Minimal elements can be many and often are; a least element is unique when it exists and frequently does not. In a Hasse diagram, minimal elements are those with no downward edges — the bottom row.
✓ Unlimited questions · marked criterion by criterion · no card needed
Method: how to approach it
The order below is what examiners expect to see, and each step carries its own marks.
- Minimal — look downa is minimal if no b satisfies b ⊏ a. In the diagram, a has no edges going down.
- Least — compare with everythinga is least if a ⊑ b for every b in the poset. It must be comparable to all elements.
- Maximal and greatest — mirror the aboveMaximal means nothing strictly above; greatest means above everything.
- Check uniquenessLeast and greatest are unique when they exist, by antisymmetry. Minimal and maximal elements need not be.
Worked example
For the divisors of 12 excluding 1, ordered by divisibility, find the minimal, maximal, least and greatest elements.
- Elements: 2, 3, 4, 6, 12.
- Minimal: 2 (nothing in the set divides it properly) and 3 — two minimal elements.
- Least: would need to divide everything, including both 2 and 3. No element does.
- Maximal: only 12; and since 12 is a multiple of every element, it is also greatest.
Answer. Minimal: 2 and 3. Least: none. Maximal: 12. Greatest: 12.
Where marks get dropped
These are the specific errors that cost credit on minimal, maximal, least & greatest elements questions — QED's rubric penalises each of them separately.
- Using "minimal" and "least" interchangeably. The example has two minimal elements and no least element — the distinction is exactly what is being tested.
- Assuming a finite poset has a least element. Every finite non-empty poset has at least one minimal element, but a least element may not exist.
- Forgetting that a greatest element is automatically the unique maximal one, so finding two maximal elements proves no greatest exists.
Practise this until it is automatic
Unlimited fresh questions
QED generates new minimal, maximal, least & greatest elements problems on demand at warm-up, exam and challenge level, so you can drill this one skill until it stops costing you marks.
Marked like an examiner
Every answer is scored against a point-by-point rubric with partial credit, so you see exactly which step of the method broke down — not just a tick or a cross.
Answer in real notation
A one-tap symbol palette, a visual equation editor and a truth-table builder — or photograph your handwritten working and QED converts it to LaTeX.
Saved to your library
Every question you generate is kept and re-takeable as a timed exam, and your Orderings & Lattices mastery is tracked so you know when this is exam-ready.
Minimal, maximal, least & greatest elements — frequently asked questions
Can a poset have several least elements?
No. If a and b are both least then a ⊑ b and b ⊑ a, so antisymmetry gives a = b. Uniqueness is automatic.
Does every finite poset have a maximal element?
Yes, provided it is non-empty: walk upward from any element and the process must terminate. Infinite posets like ℤ can fail to have one.
What are top and bottom?
Alternative names for greatest and least, written ⊤ and ⊥. A bounded poset has both, which is required for a complemented lattice.
The rest of Orderings & Lattices
Partial orders, Hasse diagrams, bounds, lattices. Each subtopic below has its own method, worked example and mark-losing traps.
- 1Partial vs total orders
- 2Hasse diagrams
- 3Minimal, maximal, least & greatest elements
- 4Upper & lower bounds, supremum & infimum
- 5Lattices: divisibility & subset orders
- 6Chains, antichains & comparability
- 7Topological sorting
- 8Well-orderings & the least-element principle
- 9Distributive & complemented lattices
- 10Product & lexicographic orders
- 11Dilworth’s theorem & chain covers
- 12Order isomorphism & comparing posets
- 13Scheduling with precedence constraints
Ready to make minimal, maximal, least & greatest elements exam-proof?
Generate your first questions free — no card, no setup, no personal data stored. Practise until the method is second nature.
Start practising free →