Set Theory & Elementary Group Theory

Peano's postulates

Peano's postulates form the foundational axiomatic system that rigorously defines the set of natural numbers $\mathbb{N}$ and underpins mathematical induction.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade

📖 Topic progress

○ Mark as complete

Definition and statement

Peano's Axioms for Natural Numbers

Let $\mathbb{N}$ be a set, $1$ (or $0$) be a distinguished element in $\mathbb{N}$, and $S: \mathbb{N} \to \mathbb{N}$ be a unary function called the successor function. Then:\\1. $1 \in \mathbb{N}$.\\2. $\forall n \in \mathbb{N}, S(n) \in \mathbb{N}$.\\3. $\forall n \in \mathbb{N}, S(n) \neq 1$.\\4. $\forall m, n \in \mathbb{N}, S(m) = S(n) \implies m = n$.\\5. If $K \subseteq \mathbb{N}$ such that $1 \in K$ and $\forall n \in [n \in K \implies S(n) \in K]$, then $K = \mathbb{N}$.

📐 Geometric Interpretation

Visualize $\mathbb{N}$ as an infinite discrete sequence of points on the positive real axis starting from $1$, where each point has a unique immediate successor spaced by unit intervals with no branching or terminating endpoints.

⚙️ Algebraic & Structural Meaning

Provides the structural algebraic foundation for defining addition, multiplication, and exponentiation recursively, establishing $\mathbb{N}$ as a discrete commutative monoid with a total ordering.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition	Domain / Interval	Necessity	What Fails If Condition Dropped
Base Element Existence	`Discrete singleton {1} or {0}`	Strictly Mandatory / Necessary	Without a designated starting element, the chain of successors has no origin point (e.g., the set of integers $\mathbb{Z}$ extending infinitely in both directions).
Successor Injectivity	`Domain and Range in $\mathbb{N}$`	Strictly Mandatory	If $S(m) = S(n)$ mapped to the same successor for distinct $m, n$, cycles or finite loops would form, violating the infinite progression of natural numbers.
Principle of Mathematical Induction (Axiom 5)	`Subset $K \subseteq \mathbb{N}$`	Essential for conclusion	Dropping the induction axiom allows models containing non-standard integers (infinitesimals or elements beyond standard infinity) that cannot be reached by finite successive increments.

Useful results and shortcuts

Use these identities and results when their conditions apply:

Successor Injectivity Test

$$S(m) = S(n) \iff m = n$$

Rule: Instantly equate arguments whenever successor functional values match in recurrence relations.

Induction Base Verification

$$P(1) \text{ true } \land [P(k) \implies P(k+1)] \implies \forall n \in \mathbb{N}, P(n)$$

Rule: Always check $n=1$ first; over 40% of incorrect options in UP TGT fail at the base case $n=1$.

Application: Standard verification technique for summation and divisibility PYQs.

Non-Cyclicity via Axiom 3

$$S(n) \neq 1, \quad \forall n \in \mathbb{N}$$

Rule: Eliminate any algebraic model proposing circular feedback loops ($S(n) = 1$ for some $n$).

Application: Directly tested in theoretical set theory multiple-choice questions.

Well-Ordering Consequence

$$S \subseteq \mathbb{N}, S \neq \emptyset \implies \exists m \in S \text{ s.t. } m \le x, \forall x \in S$$

Rule: Every non-empty subset of Peano naturals possesses a least element.

Application: Direct property identification questions in DSSSB and KVS PGT.

Recursive Addition Definition

$$a + S(b) = S(a + b)$$

Rule: Use successive shifts to evaluate small domain recursive arithmetic without full expansion.

Application: Appeared in abstract algebra foundations matching sets.

Rapid Option Elimination via Axiom 5

$$K = \mathbb{N} \iff (1 \in K \land (n \in K \implies n+1 \in K))$$

Rule: If an option misses testing $1 \in K$, it is mathematically incomplete and can be discarded instantly.

Common errors and counterexamples

These examples show how a conclusion can fail when a condition is missing:

⚠️ COMMON ERROR #01

Assuming Z satisfies Peano's Postulates

Common Pitfall: Candidates apply Peano induction principles directly to the set of all integers $\mathbb{Z}$ or rationals $\mathbb{Q}$.

Counterexample: \mathbb{Z} \text{ with } S(n) = n+1

Why it fails: Fails Axiom 3 and Well-Ordering because negative integers and zero lack a unique base element and contain no least element bounded below in certain subsets.

🛡️ Exam Defense: Peano's postulates strictly characterize $\mathbb{N}$, never $\mathbb{Z}, \mathbb{Q}, \text{ or } \mathbb{R}$.

⚠️ COMMON ERROR #02

Omitting Successor Injectivity

Common Pitfall: Assuming a set closed under a successor function automatically guarantees unique predecessor mapping.

Counterexample: S(n) = 1 \text{ for all } n \in \mathbb{N}

Why it fails: Violates Axiom 4 because $S(2) = S(3) = 1$ but $2 \neq 3$.

🛡️ Exam Defense: Always verify both distinctness from the base element and injectivity of $S$.

Comparison

Concept / Axiom	Assumptions / Domain	Key Formula / Condition	Structural Meaning	Exam Identification Clue
Axiom 1 & 3	Base Element	1 \in \mathbb{N}, \ S(n) \neq 1	Existence of unique origin and no predecessor for 1	Check starting index
Axiom 4	Successor Map	S(m) = S(n) \implies m = n	Injectivity (no merging branches)	Check uniqueness of successor
Axiom 5	Induction Principle	1 \in K \land (n \in K \implies S(n) \in K) \implies K=\mathbb{N}	exhaustiveness of the set	Proving universal statements over $\mathbb{N}$
Well-Ordering Property	Subsets of \mathbb{N}	\forall S \subseteq \mathbb{N}, S \neq \emptyset \implies \min(S) \text{ exists}	Every non-empty subset has a least element	Extremal existence problems

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

Which of the following axioms of Peano ensures that there are no 'loops' or finite cycles in the set of natural numbers $\mathbb{N}$?

(A) Axiom 1: $1 \in \mathbb{N}$(B) Axiom 3: $S(n) \neq 1$ for any $n \in \mathbb{N}$(C) Axiom 4: $S(m) = S(n) \implies m = n$(D) Axiom 2: $S(n) \in \mathbb{N}$

📚 Method A: Formal Textbook Derivation

Axiom 3 states that $1$ is not the successor of any natural number, ensuring that the chain of successors never loops back to the beginning element $1$.

⚡ Method B: 25-Second Exam Shortcut

Keyword 'loops back to 1' directly points to Axiom 3 ($S(n) \neq 1$).

💡 Tip: Memorize the numbering and exact statement of all 5 Peano postulates as standard theory questions carry direct 4 marks in UP PGT.

CANONICAL PROBLEM 02 Dual-Method Breakdown

If $S$ is the successor function satisfying Peano's postulates, and $S(m) = S(n)$, then:

(A) $m$ may or may not equal $n$(B) $m = n$(C) $m = S(n)$(D) $n = S(m)$

📚 Method A: Formal Textbook Derivation

By Peano's fourth postulate, the successor function $S$ is injective. Therefore, $S(m) = S(n) \implies m = n$.

⚡ Method B: 25-Second Exam Shortcut

Injectivity axiom directly yields $m = n$.

💡 Tip: Watch out for distractor options confusing injectivity with recursive addition.

Practice questions

Choose an answer to check it and see the solution:

How many primitive undefined terms/notions are assumed in Peano's original formulation?

A 1

B 2

C 3

D 4

Derivation & Analysis:

Peano's system takes three primitive notions as undefined: the set $\mathbb{N}$, the constant $0$ or $1$, and the successor function $S$.

Which of Peano's postulates is equivalent to the Principle of Mathematical Induction?

A Postulate 2

B Postulate 3

C Postulate 4

D Postulate 5

Derivation & Analysis:

Postulate 5 is the induction axiom, stating that any inductive subset containing 1 and closed under successors is equal to all of $\mathbb{N}$.

If $K \subseteq \mathbb{N}$ such that $1 \in K$ and $n \in K \implies S(n) \in K$, then:

A $K = \emptyset$

B $K = \mathbb{N}$

C K is finite

D K is a proper subset of $\mathbb{N}$

Derivation & Analysis:

By Peano's induction postulate (Axiom 5), any such subset $K$ must coincide with the entire set $\mathbb{N}$.

Peano's fourth postulate states that the successor function $S: \mathbb{N} \to \mathbb{N}$ is:

A Surjective only

B Bijective

C Injective

D Many-to-one

Derivation & Analysis:

Postulate 4 ($S(m) = S(n) \implies m = n$) defines the injectivity (one-to-one property) of the successor function.

Which of the following sets violates Peano's third postulate ($S(n) \neq 1$)?

A $\mathbb{N}$ with standard successor

B A set with a circular cycle where $S(3) = 1$

C The set of positive integers starting at 1

D The set of all prime numbers with indexed successor

Derivation & Analysis:

A circular cycle where $S(3) = 1$ directly violates the axiom that no natural number has $1$ as its successor.

Can the set of all real numbers $\mathbb{R}$ satisfy Peano's postulates with standard successor $S(x) = x+1$?

A Yes, completely

B No, because induction and well-ordering fail for $\mathbb{R}$

C Yes, if we start at 0

D Only for positive reals

Derivation & Analysis:

Real numbers contain fractions and infinitesimals between integers; thus induction (Axiom 5) and discrete well-ordering fail.

What is the primary role of Peano's postulates in modern mathematics?

A To define real analysis

B To provide an axiomatic foundation for natural numbers and arithmetic

C To solve differential equations

D To construct complex manifolds

Derivation & Analysis:

Peano's postulates rigorously axiomatize the natural number system and provide the foundation for arithmetic operations.

If $S(n)$ denotes the successor of $n$ in Peano arithmetic, what is the recursive definition of addition $a + S(b)$?

A S(a) + b

B S(a + b)

C a + b

D a $\cdot$ S(b)

Derivation & Analysis:

Addition is defined recursively by $a + 1 = S(a)$ and $a + S(b) = S(a + b)$.

Which property of $\mathbb{N}$ is intimately tied to Peano's induction axiom?

A Completeness

B Well-ordering property

C Compactness

D Differentiability

Derivation & Analysis:

The induction principle in Peano arithmetic is logically equivalent to the well-ordering property of natural numbers.

Q10

In Peano's axioms, if $S(n) = S(m)$, what can be deduced regarding $n$ and $m$?

A $n > m$

B $n = m$

C $n \neq m$

D $n + m = 1$

Derivation & Analysis:

Direct application of the injectivity postulate (Axiom 4) yields $n = m$.

Common questions

Historically and in Giuseppe Peano's original formulation, 0 was the starting element. However, in modern set-theoretic foundations and many competitive exam syllabi (like UP PGT), 1 is frequently taken as the starting element. Both systems are isomorphic and fully valid.

Peano's postulates construct a discrete, countable set with a discrete successor function and well-ordering. The real numbers $\mathbb{R}$ are uncountably infinite, dense, and continuous, lacking a discrete successor function.

Memorize the exact numbering and statements of all five axioms, specifically noting that Axiom 3 prevents loops and Axiom 4 ensures injectivity.

← Previous Topic

Principle of mathematical induction

Next Topic →

Rules of set algebra