The claim that every nonempty set of positive integers (or more generally every set that is well-orderable) has a least element with respect to the usual ordering; in practice often stated for the natural numbers as 'every nonempty subset of N has a least element.'

Principle

Minimal-element existence: the organizing idea is that discrete well-ordered domains admit induction and minimal-counterexample arguments because any nonempty subset contains a smallest member.

Demonstration

For example, if S is a nonempty subset of the natural numbers, then S has a least element m; this fact underlies proofs by minimal counterexample: assume a property fails, take the smallest n for which it fails, and derive a contradiction using the minimality of n.

Misapplication

Applying well-ordering to partially ordered sets without checking well-foundedness, or assuming every set of real numbers has a least element in the usual order — that fails because reals are not well-ordered by the standard order.

Consequence

Justifies induction and many forms of descent and minimization arguments on N; when combined with appropriate set-theoretic assumptions, it is equivalent to the Axiom of Choice in certain formulations and yields structural existence results.

Reversal

The negation would be the existence of a nonempty subset without a least element in the domain considered; for N this cannot happen, but in other orders (like Z or R) minimal elements need not exist and the same arguments fail.

Boundary

Valid as stated for the standard ordering on natural numbers and any well-ordered set; does not apply to arbitrary partial orders or to orders that admit descending sequences or dense orderings like the reals under <.

Semantic Tension

Tension with notions of order density and completeness: the well-ordering principle asserts discreteness and the existence of minima, whereas dense orders emphasize absence of immediate successors and lack of minima for many subsets.

Synthesis

The Well-Ordering Principle is the assertion that in well-ordered domains every nonempty subset has a least element, a property that undergirds induction, minimal-counterexample proofs and descent arguments while failing in dense or non-well-founded orders.