False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

FALSE: every maximal element is a greatest element

Statement

FALSE. In every poset, a maximal element is a greatest element: if $m$ has nothing strictly above it, then every element is below $m$ (Maximal element and greatest element).

The statement is plausible because it is true in every totally ordered set, which is where most intuition about order is formed. What defeats it is a maximal element that is not above everything, which only a partial order permits; and since Zorn's lemma delivers maximal elements and nothing more, believing this is the standard way to misapply it.

Facts & Assumptions

Given: The definitions of maximal and greatest element in a poset.

[A1]

$m$ is maximal when there is no $x$ with $m < x$ ; $m$ is greatest when $x \leq m$ for every $x$ (Maximal element and greatest element).

[L1]

A partial order is a reflexive, antisymmetric, transitive relation, and it need not make every two elements comparable (Partial order and partially ordered set).

Refutation

technique · direct

1.1

Let $P = {a, b}$ with $a \neq b$ , and let $\leq$ relate each element only to itself, so that the relation is ${(a, a), (b, b)}$ .

construct

2.1

This relation is reflexive by construction, antisymmetric because $u \leq v$ and $v \leq u$ only occur when $u = v$ , and transitive because $u \leq v$ and $v \leq w$ only occur when $u = v = w$ ; so $(P, \leq)$ is a poset.

step 1.1L1

2.2

But $b \leq a$ fails, so $a$ is not greatest; and $a \leq b$ fails, so $b$ is not greatest.

step 1.1A1

3.1

There is no $x \in P$ with $a < x$ : the only $x$ with $a \leq x$ is $a$ itself, and $a < a$ is false. So $a$ is maximal, and by the same argument so is $b$ .

step 1.1step 2.1A1

4.1

So $(P, \leq)$ has maximal elements and no greatest element, refuting the claim.

step 3.1step 2.2∎

Remarks

The counterexample is as small as it can be. The empty poset has no maximal element and satisfies the claim vacuously; a one-element poset satisfies it outright, since its single element is maximal and is greatest by reflexivity. So two elements is the minimum, and the antichain above achieves it.
Incomparability alone is not what refutes the claim. A poset can contain incomparable elements and still have a greatest one: take $P = {a, b, c}$ with $a < c$ and $b < c$ and nothing else, where $a$ and $b$ are incomparable while $c$ is above everything. What a refutation needs is a maximal element that is not greatest, which is a strictly stronger demand than the presence of an incomparable pair.
The same phenomenon at scale: ordering the proper subsets of a set by inclusion, every subset missing exactly one point is maximal, and when the set has at least two points there are several such subsets and no greatest one.
Why this matters for Zorn. Zorn's lemma concludes that a maximal element exists. Applications must therefore be arranged so that maximality alone is decisive, typically by making "nothing is strictly above it" mean "it cannot be extended". Reading the conclusion as "there is a greatest element" is not a harmless slip: it is a strictly stronger claim that the lemma does not support.
A greatest element, when one exists, is maximal and is unique. Only the converse fails.

Depends on

Used by

Two maximal elements and no greatest element Counterexample

Dependency tree · one level

2 results within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Greatest element and least element (Wikipedia) (standard reference, not scraped)
Maximal and minimal elements (Wikipedia) (standard reference, not scraped)
Partially ordered set (Wikipedia) (standard reference, not scraped)