Consequences of Field Axioms
Consequences of Field Axioms
You know that $(-2)(-3)=6$ and that you cannot divide by zero. But why? Every familiar rule of arithmetic — subtraction, division, sign changes, cancellation — is not an assumption: it is a theorem, derived purely from the nine field axioms. This post gives full axiomatic proofs of every consequence, with every step labelled by the axiom it invokes.
🇮🇳 हिंदी में पढ़ेंThe Nine Axioms — Recalled
Everything in this post is derived from exactly these nine statements. No other properties of $\mathbb{Q}$ or $\mathbb{R}$ are used.
(M1) $xy=yx$ (M2) $(xy)z=x(yz)$ (M3) $\exists\,1\neq0\colon 1\cdot x=x$ (M4) $x\neq0\Rightarrow\exists\,x^{-1}\colon xx^{-1}=1$
(D) $x(y+z)=xy+xz$
← Algebraic Structures and Field Axioms — the nine axioms (A1–A4, M1–M4, D) are assumed known from this post; every consequence here is derived from them.
← Logic and Proof Methods — every proof here is a direct axiomatic argument or uses proof by contradiction.
Intuition — Theorems, Not Assumptions
When we work in $\mathbb{R}$ or $\mathbb{Q}$, we freely use rules like $(-a)(-b)=ab$ or "you cannot cancel if $a=0$." But these are not self-evident truths — they are theorems that follow logically from the nine axioms. Proving them from scratch has two purposes: it shows that any field (including exotic finite fields $\mathbb{F}_p$ used in cryptography) must obey exactly the same rules, and it gives practice in the axiomatic method central to all of real analysis.
Uniqueness results — show two elements satisfy the same equation, then use cancellation to prove they are equal.
Zero-product results — use $0+0=0$ (A3), distribute (D), then add inverses (A4) to cancel.
Sign rules — show $(-a)b + ab = 0$ using (D); invoke uniqueness of additive inverse.
No zero divisors — assume $ab=0$, $a\neq0$; multiply by $a^{-1}$ (M4); conclude $b=0$.
Rule of thumb: Every step in a field proof must cite an axiom label or a consequence already proved — no "it is obvious" shortcuts.
अंकगणित के सभी परिचित नियम — $a\cdot0=0$, $(-a)(-b)=ab$, शून्य-भाजक नहीं, लघुकरण नियम — प्रमेय (Theorems) हैं, अभिगृहीत नहीं। इन्हें केवल नौ Field अभिगृहीतों (A1–A4, M1–M4, D) से सिद्ध किया जाता है। प्रत्येक चरण में उपयोग किए गए अभिगृहीत का लेबल देना अनिवार्य है। घटाव $a-b:=a+(-b)$ और भाग $a/b:=a\cdot b^{-1}$ परिभाषित संक्रियाएँ हैं, मूल अभिगृहीत नहीं।
All Sixteen Consequences
Let $F$ be a field and $a, b, c, d \in F$. Every result below follows from the nine axioms alone.
Selected Full Proofs with Axiom Citations
Step 1. A3 $\;\Rightarrow\;$ $0 + 0 = 0$.
Step 2. Multiply both sides by $a$: $a(0+0)=a\cdot0$.
Step 3. D $\;\Rightarrow\;$ $a\cdot0+a\cdot0=a\cdot0$.
Step 4. Result 1 (uniqueness of $0$): the only $x$ with $a\cdot0+x=a\cdot0$ is $x=0$. Here $x=a\cdot0$, so $a\cdot0=0$. $\blacksquare$
Step 1. D: $ab + (-a)b = (a + (-a))b$.
Step 2. A4: $a + (-a) = 0$, so $(a+(-a))b = 0 \cdot b$.
Step 3. M1 + Result 6: $0\cdot b = b\cdot 0 = 0$.
Step 4. So $ab + (-a)b = 0$. By Result 2 (uniqueness of $-ab$): $(-a)b = -(ab)$. $\blacksquare$
Given: $ab = 0$ and $a \neq 0$. We prove $b = 0$.
Step 1. M4: since $a\neq0$, $a^{-1}$ exists.
Step 2. $a^{-1}(ab) = a^{-1}\cdot0$.
Step 3. M2: LHS $= (a^{-1}a)b$. M4: $a^{-1}a=1$. M3: $1\cdot b=b$. So LHS $= b$.
Step 4. Result 6: RHS $= a^{-1}\cdot0=0$. Hence $b=0$. $\blacksquare$
Given: $ab = ac$ and $a \neq 0$. We prove $b = c$.
Step 1. M4: $a^{-1}$ exists. Multiply: $a^{-1}(ab) = a^{-1}(ac)$.
Step 2. M2, M4, M3: both sides simplify — LHS $=b$, RHS $=c$. Hence $b=c$. $\blacksquare$
Note: If $a=0$: $0\cdot b=0=0\cdot c$ for all $b,c$ — cancellation fails. The condition $a\neq0$ is essential.
Solved Examples
Apply Result 6 ($a\cdot0=0$ for all $a\in F$) with $a=0$:
$$0 \cdot 0 = 0. \quad \blacksquare$$
No additional work is needed; this is an immediate substitution into an already-proved consequence.
Setting $x = 0$: $e + 0 = 0$.
By A3: $e + 0 = e$, so $e = 0$.
Alternatively, using Result 1 directly: $e + 0 = 0$ means $e + 0 = 0$; since also $0 + 0 = 0$ (A3), we have $e + 0 = 0 + 0$, so by additive cancellation (Result 11): $e = 0$. $\blacksquare$
Step 1. Prove $(-a)b = -(ab)$ (Result 7):
$ab + (-a)b \stackrel{\text{D}}{=} (a+(-a))b \stackrel{\text{A4}}{=} 0\cdot b \stackrel{\text{M1, R6}}{=} 0$. So $(-a)b = -(ab)$ by Result 2.
Step 2. Apply Step 1 with $b \leftarrow (-b)$: $(-a)(-b) = -(a(-b))$.
Step 3. Apply Step 1 again (with original $a, -b$): $a(-b) = -(ab)$.
Step 4. $(-a)(-b) = -(-(ab)) \stackrel{\text{R5}}{=} ab$. $\blacksquare$
Let $b, d \neq 0$. Prove: (i) $\dfrac{a}{b}+\dfrac{c}{d}=\dfrac{ad+bc}{bd}$; (ii) $\dfrac{a}{b}\cdot\dfrac{c}{d}=\dfrac{ac}{bd}$.
Proof of (i).
$\dfrac{a}{b}+\dfrac{c}{d} = ab^{-1}+cd^{-1}$ (by definition, Result 14).
Insert $1=dd^{-1}=bb^{-1}$ via M4 and M3:
$= ab^{-1}(dd^{-1}) + cd^{-1}(bb^{-1})$
$\stackrel{\text{M1,M2}}{=} (ad)(b^{-1}d^{-1}) + (cb)(d^{-1}b^{-1})$
$\stackrel{\text{M1}}{=} (ad)(bd)^{-1} + (bc)(bd)^{-1}$ (since $(bd)^{-1}=b^{-1}d^{-1}$ by M1)
$\stackrel{\text{D}}{=} (ad+bc)(bd)^{-1} = \dfrac{ad+bc}{bd}$. $\blacksquare$
Proof of (ii).
$\dfrac{a}{b}\cdot\dfrac{c}{d} = (ab^{-1})(cd^{-1}) \stackrel{\text{M1,M2}}{=} ac\cdot b^{-1}d^{-1} = ac(bd)^{-1} = \dfrac{ac}{bd}$. $\blacksquare$
Quick Revision Cards
📊 A — Consequences 1–10
- $a+b=a \Rightarrow b=0$ (uniq. $0$)
- $a+b=0 \Rightarrow b=-a$ (uniq. $-a$)
- $-(-a)=a$
- $a\cdot0=0$; $0\cdot0=0$
- $(-a)b=-(ab)$; $(-a)(-b)=ab$
- $ab=0\Rightarrow a=0$ or $b=0$
- $(-1)a=-a$
⚙️ B — Consequences 11–16 & Traps
- Additive cancel: $a+b=a+c\Rightarrow b=c$ (always)
- Mult. cancel: $ab=ac$, $a\neq0\Rightarrow b=c$
- $a-b:=a+(-b)$; $a/b:=ab^{-1}$
- $a/b+c/d=(ad+bc)/(bd)$
- $a/b\cdot c/d=ac/(bd)$
- $(ab)^{-1}=b^{-1}a^{-1}=a^{-1}b^{-1}$
🎯 C — Exam Tips
- 🔵 CSIR NET: "Prove $a\cdot0=0$" — cite D on $0+0=0$; cancel. Full marks need axiom labels.
- 🟢 GATE: Mult. cancel requires $a\neq0$; add. cancel has no such condition — MCQ trap.
- 🟠 IIT JAM: Fraction rules are derived, not assumed — know the full proof from axioms.
- 🔴 B.Sc. Raj.: List results 1–10 as a theorem; cite axiom at every step.
Common Mistakes
❌ Errors to Avoid
Wrong: Using "$a-b=0\Rightarrow a=b$" to prove cancellation (this is what we are trying to prove). | Correct: Start from $a+b=a+c$; add $-a$ using A4; simplify with A2, A4, A3 to reach $b=c$.
Wrong: From $ab=ac$ concluding $b=c$ without checking $a\neq0$. | Correct: If $a=0$, then $0\cdot b=0=0\cdot c$ for any $b,c$, so cancellation fails completely. The condition is not cosmetic.
Wrong: "We use the subtraction axiom $a-b=a+(-b)$." | Correct: There is no subtraction axiom. $a-b$ is a definition — it abbreviates $a+(-b)$. Similarly $a/b$ abbreviates $a\cdot b^{-1}$.
Wrong: Dividing by zero in an argument. | Correct: $b^{-1}$ is defined only for $b\neq0$ (axiom M4). In any field, $0\cdot x=0\neq1$ for all $x$, so $0$ has no multiplicative inverse and $a/0$ is undefined.
Real-World Applications
Computer Algebra Systems
Every CAS (Mathematica, SageMath, SymPy) uses $(-a)(-b)\to ab$ and $a\cdot0\to0$ as rewrite rules applied millions of times per second in symbolic computation.
Linear Algebra over Fields
Row reduction, determinants, and eigenvalues work over any field. No-zero-divisors ensures $AB=0$ with $A$ invertible forces $B=0$ — the foundation of rank-nullity theory.
Rational Function Arithmetic
Results 15 and 16 (fraction addition and multiplication) are the exact rules for adding and multiplying rational functions. Partial fraction decomposition depends on uniqueness of field inverses.
Coding Theory (AES/BCH)
Operations in $\mathbb{F}_{2^n}$ (used in AES, BCH codes) implement exactly these derived rules. No-zero-divisors guarantees that encoded messages can always be uniquely recovered.
Summary Table & Key Principle
| # | Result | Key proof step | Rudin ref. |
|---|---|---|---|
| 1–2 | Uniqueness of $0$ and $-a$ | Add $-a$; A2, A4, A3 | P1.14(i–ii) |
| 3–4 | Uniqueness of $1$ and $a^{-1}$ | Multiply by $a^{-1}$; M2, M4, M3 | P1.14(iii–iv) |
| 5 | $-(-a)=a$ | $(-a)+a=0$; invoke Result 2 | P1.14(v) |
| 6 | $a\cdot0=0$ | D on $0+0=0$; Result 1 | P1.14(vi) |
| 7–8 | $(-a)b=-(ab)$; $(-a)(-b)=ab$ | D, A4, Result 6; then Result 5 | P1.14(vii) |
| 9 | No zero divisors | Multiply by $a^{-1}$; M4 | P1.14(viii) |
| 10 | $(-1)a=-a$ | $a+(-1)a=0$; Result 2 | P1.15 |
| 11–12 | Additive and mult. cancellation | Add/mult. by inverse; A4/M4 | P1.14 |
| 13–14 | Subtraction and division defined | Definitions: $a-b:=a+(-b)$; $a/b:=ab^{-1}$ | P1.15 |
| 15–16 | Fraction arithmetic | D, M1, M2, $(bd)^{-1}=b^{-1}d^{-1}$ | P1.15–16 |
The Key Principle:
Every familiar arithmetic rule is a theorem, not an axiom.
The nine field axioms (A1–A4, M1–M4, D) logically force all sixteen consequences — nothing is assumed beyond them.
Cross-References & Related Posts
← Direct prerequisite: Algebraic Structures and Field Axioms — the nine axioms from which all sixteen consequences here are derived.
← Proof toolkit: Logic and Proof Methods — every proof here is a direct axiomatic argument or uses proof by contradiction.
→ Next Topic: Foundations of Real Numbers.</p>
📖 Further Reading: Rudin, Ch. 1, Prop. 1.14–1.16; Apostol, Ch. 1, §§1.3–1.5; Bartle & Sherbert, Ch. 2, §2.1.
How did you find this post?
Tap a reaction — counts update in real time across all devices.
Have a question, doubt, or thought about this post? Choose how you want to join the discussion below.
💬 Comment on Telegram — No account neededRequires a free GitHub account — takes 30 seconds to create with just an email address.