For a nonempty inclusion chain of group operations on subsets of a fixed set, the union is a group operation on the union of their carriers. Any finite list of carrier elements lies in one chain member, so its multiplication and associativity agree there. Nested identities coincide because the only idempotent of a group is its identity; inverses remain valid in larger members. Thus the union supplies the chain upper bound required by Zorn's lemma.
Convex domination form of the Hahn-Banach theorem Created 2026-10-14 Updated 2026-10-25
A linear functional dominated by a finite real convex function on a vector subspace extends with the same domination to the whole real vector space. To add , choose between the supremum of and the infimum of , over and . Convexity, applied to , makes every lower candidate at most every upper candidate. The candidates at bound the interval by finite numbers. Chain unions preserve domination, so Zorn's lemma gives a full extension. No homogeneity of is assumed.
Assuming the axiom of choice, Cauchy's functional equation has solutions that are not linear maps over the real numbers. Regard as a vector space over the rational numbers. Because is an irrational number, and are linearly independent over . Zorn's lemma extends them to a Hamel basis ; assigning arbitrary real outputs to its basis vectors and extending by finite rational linear combinations gives an additive function.[ref]
For a particular choice, assign and for every . Every real number has a unique finite linear combination with finite and . Define
where the coefficient is zero if . The uniqueness of the Hamel basis representation makes this definition unambiguous, and adding the coefficients proves . On the rational two-dimensional vector subspace spanned by and , the rule is particularly simple:
For instance, and give , , and . Thus the map still preserves addition, even though rules out being a linear map over the real numbers.
The rational approximants from additive function continuous at one point is linear expose the failure of continuity: but . Moreover while . The map is continuous nowhere, since continuity at any point would imply additive function continuous at one point is linear. It is unbounded on every interval of positive length by additive function bounded on an interval is linear.
The axiom of choice is used to obtain the Hamel basis; the coefficient rule does not provide an explicit way to find the representation of an arbitrary real number. A plot sampled only at rational numbers would show exactly the same values as , so that plot cannot reveal this discontinuous additive function.
Ellis–Numakura lemma Created 2026-09-28 Updated 2026-11-05
Choose an inclusion-minimal nonempty compact subsemigroup , using Zorn's lemma and the finite intersection property. For , the set is a nonempty compact subsemigroup, so minimality gives . Hence is nonempty. It is a compact closed subset of by continuity and the Hausdorff space assumption, and is a subsemigroup because for . Minimality gives , so .[ref]
Reversing multiplication gives the same conclusion for a right-topological semigroup. Joint continuity of multiplication is not needed.
Existence of minimal primes over a proper ideal Created 2026-10-06 Updated 2026-10-14
Every proper ideal of a unital commutative ring is contained in a minimal prime over that ideal. A maximal ideal supplies a prime containing it, and an intersection of a decreasing chain of primes is still prime. Zorn's lemma, with reverse inclusion, therefore supplies a minimal member. No Noetherian assumption is needed.
Apply Zorn's lemma to subsets of a field extension with algebraic independence, ordered by inclusion. The union of a chain is independent because any polynomial relation involves only finitely many distinct elements, all of which lie in one member of the chain. A maximal independent set is a transcendence basis: if any element were transcendental over , adjoining it would preserve independence, by clearing denominators, contradicting maximality. Tuple entries must be distinct in the set-based independence definition; otherwise the nonzero polynomial vanishes on a repeated pair and excludes every nonempty set.
For an explicit basis extension in , start with , where . Its linear span is the line . Adding preserves linear independence, because is outside that line, and gives a basis. Every vector has the finite linear combination
The vector cannot be added while preserving linear independence: it is already in the linear span. Many choices outside the line work, so maximality does not select a unique basis.
Figure 1.
Extending one independent vector to a basis of the real plane
. Left: u spans only the blue line, and 2u is redundant. Right: adding w outside that line yields a basis spanning the entire plane. This finite-dimensional illustration is not a proof of basis existence in arbitrary dimension. Details.
For a finite-dimensional vector space with a supplied finite spanning set, a greedy algorithm scans the list, retaining each vector precisely when it is outside the linear span of those already retained. Starting with a linearly independent , the same scan adjoins only the needed vectors. Retained vectors remain linearly independent, and every skipped vector is in the final linear span, so the result is a basis containing . Finite reasoning needs no axiom of choice.
For an arbitrary vector space, this finite stopping argument is unavailable. Accepting Zorn's lemma asserts existence of a maximal element once every chain in a partial order has an upper bound; it supplies no general computational recipe. Over ZF, Zorn's lemma, the axiom of choice and the well-ordering theorem are equivalent. Particular infinite vector spaces can still have explicit bases, such as for the vector space of univariate polynomials over a specified field; infinity alone does not force a nonconstructive argument.[ref]
Every injection from an ordinal into a set has domain strictly below the Hartogs number . Therefore all partial injections with ordinal domain and range in form a set of graphs contained in . Under extension, the union of a chain remains a partial injection of this kind. Zorn's lemma then supplies a maximal one, and extending at an unused range element shows that it must be a bijection onto . This gives the well-ordering theorem with the set-sizedness of the poset made explicit.
A real linear functional on a vector subspace, dominated by a sublinear function , can be extended across one new vector by setting . The displayed lower and upper bounds are compatible because . A value between them preserves domination for both signs of . Chain unions and Zorn's lemma then yield the full Hahn-Banach theorem.
A semisimple module is a direct sum of simple modules. An algebra is semisimple when all its modules are semisimple. Suppose the left regular module is semisimple. Every module is a quotient of a free module , by sending its basis elements to a generating set of . This free module is a direct sum of simple modules.
A quotient of a direct sum of simple modules is semisimple: the images of its simple summands are simple or zero and span the quotient. Choose a maximal direct sum among these simple images, allowing all simple submodules in the choice. If it does not span the whole quotient, some simple image is not contained in it. Its intersection with that direct sum is zero by simplicity, so it could be added, contradicting maximality. For infinite index sets, Zorn's lemma supplies the maximal direct sum; in finite dimension the construction terminates directly.
Hence every is semisimple, and is a semisimple algebra. This proves semisimplicity from the regular module.
The radical of an ideal is
We first establish the properties needed below. If , every term of the binomial theorem expansion of contains either or , so . Also and . Thus is an ideal. The definition gives and shows that implies . Finally, if , then for some , so . Hence ; in other words, is a radical ideal.
We prove the stronger fact that the radical of an ideal is the intersection of the prime ideals containing it:
If and is a prime ideal, then for some , and repeated application of the definition of a prime ideal gives . This proves one inclusion.
Conversely, fix . The multiplicatively closed set is disjoint from . Consider the ideals containing and disjoint from . This collection is nonempty, and the union of any chain in it is another such ideal. By Zorn's lemma, there is a maximal member . It is proper because .
To prove that is a prime ideal, suppose but . Maximality forces both and to meet . Thus, for some ,
Multiplication gives , since every term lies in , including . This contradicts disjointness from . Therefore is a prime ideal containing and avoiding . This proves the other inclusion, including the required prime ideal avoiding a multiplicative subset argument without using any unproved facts about the nilradical.
If , the displayed intersection represents as required. Conversely, an intersection of ideals that are all prime ideals is a radical ideal: if belongs to every one of them, then so does . Consequently
The unit ideal is included by interpreting the empty intersection as .
The Krull dimension of a commutative ring is
The length of a prime chain counts strict inclusions, rather than the number of prime ideals.
Let be a principal ideal domain that is not a field. We first show that every nonzero prime ideal is a maximal ideal. Write such a prime ideal as with , and suppose . Then for some . Since , either , in which case , or . In the second case for some , and gives by multiplicative cancellation in an integral domain. Thus . This proves maximality.
Since is an integral domain, is a prime ideal, and every other prime ideal is maximal. Consequently every prime chain has length at most one. For the opposite inequality, choose a nonzero nonunit , which exists because is not a field. The proper principal ideal is contained in a maximal ideal ; existence follows from Zorn's lemma applied to the proper ideals containing . A maximal ideal is a prime ideal, since its quotient ring is a field. Therefore is a prime chain of length one. Thus the Krull dimension of a principal ideal domain that is not a field is
Zorn's lemma states that a nonempty partially ordered set in which every chain has an upper bound contains a maximal element. Here a chain means a subset totally ordered by the inherited order; it need not have a greatest member.
View every partial function as its graph, a subset of . The family is a set by axiom of separation from the power set of this product. Let be a chain and put . If two members of the union assign values to the same input, the chain property makes one graph contain the other, so those values agree. Thus is a partial function.
If and , choose a chain member containing in its domain. Its rational-scalar closure gives . If , choose two chain members containing them; the larger one contains both, and therefore contains with value . Hence satisfies the required additive identity and domain closure. Consequently
and it is an upper bound for the chain. For the empty chain its union is the empty function, which satisfies the defining logical implications vacuously, so this case is covered too.
A nonempty weakly linear function has a domain closed under rational scalars and addition, hence a vector subspace of over . Additivity first gives and , then for integers . If with , rational closure puts in and
Thus : it is a -linear map. The empty function is not maximal because it extends to the function on with value zero.
Suppose a maximal had proper domain . Choose and any prescribed real value , for instance . Every element of has a unique expression : if two expressions coincide and the coefficients differ, then would belong to . Define
Uniqueness makes this well-defined. The displayed logical formula and the -linearity of show directly that is additive and has a domain closed under rational scalars. Hence it is a weakly linear function and extends . It is a proper extension because is now in its domain, contradicting maximality. Therefore
Part (a) and Zorn's lemma guarantee the existence of maximal extensions as well as this description of their domains.
Irrationality of makes the expression unique for rational : equality of two such expressions with different would express as a rational number. Therefore the rule selecting the coefficient defines a function on . Its domain is a vector subspace over , and direct coefficient addition and rational scaling show it is -linear, hence weakly linear. In particular
Use Zorn's lemma on the nonempty family of weakly linear extensions of this particular function. Chain unions remain extensions by (a); hence there is a maximal extension . Any further extension in would also contain the original function, so this is maximal in . Part (b) therefore gives .
A real-linear map is multiplication by its value at . Were real-linear, it would satisfy
contradicting the inherited value . Thus a weakly linear function on all of need not be real-linear. Its rational homogeneity of an additive function is insufficient for real homogeneity. This particular extension is also discontinuous: rational numbers approaching have value zero, while the value at their limit is one.
Hartogs theorem says that for every set there is a least ordinal for which no injection exists. This does not require the axiom of choice. Form the set of well-orderings of subsets of . It can be defined by the axiom schema of specification inside
recording a subset and its well-order. Each member of has a unique ordinal order type. Axiom schema of replacement is used to collect those order types into a set
Every member of an ordinal in is the order type of an initial segment of the corresponding well-ordering, so also belongs to . Thus is a transitive set of ordinals and is itself an ordinal. An ordinal belongs to exactly when it injects into : use a bijection to a well-ordered subset in one direction, and transport the ordinal order along the injection in the other. If injected into , this characterization would give , impossible for an ordinal. All smaller ordinals lie in and do inject into . Therefore . Apart from the standard order-type theorem, the explicit collection of all order types is the Axiom schema of replacement step; no axiom of choice of a representative ordering for each type is needed.
Zorn's lemma states that a nonempty partially ordered set in which every chain has an upper bound has a maximal element. Use the Hartogs bound on partial ordinal injections to obtain a set-sized partially ordered set. Consider the partial injections into whose domains are ordinals. Hartogs theorem bounds every such domain strictly below . Their graphs of a function therefore form a set
obtained by the axiom schema of specification from . Order by extension. It is nonempty because it contains the empty function. A chain has as an upper bound the union of its graphs of a function: extension makes this a function, injectivity is preserved, and its domain is an union of ordinals and hence an ordinal. Its range is contained in , so Hartogs theorem forces its domain to be strictly below ; thus it belongs to . The empty chain also has the empty function as an upper bound.
By Zorn's lemma choose a maximal . If an element lay outside its range, appending would give a larger injection on . Such an injection itself guarantees by Hartogs theorem, so it is a legitimate member of , contradicting maximality in a partially ordered set. Therefore is surjective, and
For this single extension one only selects an element of one specified nonempty set; no additional simultaneous choices are hidden in the argument. Zorn's lemma is the form of the axiom of choice used to obtain maximality in a partially ordered set.
Finally work with cardinals, represented by initial ordinals, and put . It is infinite by hypothesis. Nonzeroness of each factor gives an injection of the larger cardinal into the Cartesian product by holding a coordinate of the other fixed. The supplied infinite-ordinal square result gives . Hence
For the sum, use disjoint union:
The last injection exists because is infinite and contains two distinct elements. Cantor-Schröder-Bernstein theorem turns both pairs of bounds into equalities, proving
These final operations are cardinal sum and multiplication, measuring disjoint unions and Cartesian products. They are not the noncommutative ordinal arithmetic considered in question 5.
Apply Zorn's lemma using the chain upper bounds just proved, obtaining a maximal partial group operation on a nonempty carrier . Suppose . Then choose a subset and a bijection . The set can be identified with by sending to and to .
Use group extension by a duplicate carrier to transport the direct-product group operation along this bijection. Its restriction to is exactly the original , because . It therefore gives a strictly larger member of , contradicting maximality. Thus . Cardinal comparability, allowed as a consequence of Zorn's lemma, leaves the strict opposite inequality:
The argument uses choice through Zorn's lemma and cardinal comparability; the extension itself is an explicit transported direct-product operation once the bijection with is chosen.
Zorn's lemma states that a nonempty partially ordered set in which every chain has an upper bound has a maximal element. Order the partial group operations by inclusion of their graphs. The collection is a set, since its members are subsets of . It is nonempty: choose and put the one-element group operation on .
To construct a chain union of partial group operations, for the given nonempty chain, let and let be the union of the corresponding group carriers. Comparability guarantees agreement wherever two operations are both defined, so is a function. Its domain is : any two elements of lie together in one carrier, by taking the larger of the two chain members containing them. Their product then lies in that carrier and hence in .
Any three elements similarly lie together in one chain member, where associativity holds; therefore associativity holds for . The identities of nested nonempty groups agree: the smaller identity remains an idempotent under the larger group operation, whose only idempotent is its identity. Hence the whole chain has a common identity. Each element's inverse in a carrier remains its inverse in every larger carrier, so it is an inverse in the union as well. Thus satisfies all group axioms and
It is an upper bound for the chain. The empty chain also has an upper bound because is nonempty, completing the hypothesis needed for Zorn's lemma.
Order the consistent sets of sentences extending by inclusion. This collection is nonempty. The union of a chain is consistent: any derivation of a contradiction uses finitely many assumptions, which all lie in one member of the chain. Zorn's lemma therefore supplies a maximal member, which is a maximal consistent extension of .
For a countable language one can instead enumerate all sentences and successively add either a sentence or its negation while preserving consistency. At least one choice is consistent, since inconsistency of both extensions, together with the deduction theorem for propositional logic and classical reasoning, would make the previous stage inconsistent. The union of the stages is consistent by finite use of assumptions and decides every sentence, so it is maximal consistent.
The chain proof covers arbitrary set-sized languages; no restriction on the language cardinality was printed here. The later prohibition on choice applies to the cardinal-arithmetic question, not this logic construction.
The four principles are:
In the last assertion the upper bound belongs to the partially ordered set; it need not belong to the chain.