Layer 2 — Number Systems: From Counting to Completeness¶

Key Metrics

Attribute	Value
Position	Layer 2 — the objects we reason about
Dependencies	Set Theory (Layer 1), Logic (Layer 0)
Enables	Algebra (Layer 3), Geometry (Layer 4), Analysis (Layer 5)
Key chain	\(\mathbb{N} \subset \mathbb{Z} \subset \mathbb{Q} \subset \mathbb{R} \subset \mathbb{C}\)
Key results	Irrationality of \(\sqrt{2}\), completeness of \(\mathbb{R}\), Fundamental Theorem of Algebra, Euler's identity
Historical span	Pythagoreans (~500 BCE) → Brahmagupta (628) → Dedekind (1872) → Hamilton (1843)

Core Idea¶

Each number system is an extension forced by a concrete limitation of the system below it:

System	Limitation of predecessor	What it adds
\(\mathbb{N}\)	(Starting point)	Counting, addition, multiplication
\(\mathbb{Z}\)	\(\mathbb{N}\) not closed under subtraction (\(3 - 5 = ?\))	Additive inverses (negative numbers)
\(\mathbb{Q}\)	\(\mathbb{Z}\) not closed under division (\(1 \div 3 = ?\))	Multiplicative inverses (fractions)
\(\mathbb{R}\)	\(\mathbb{Q}\) has "gaps" (\(\sqrt{2} \notin \mathbb{Q}\))	Completeness (every Cauchy sequence converges)
\(\mathbb{C}\)	\(\mathbb{R}\) not algebraically closed (\(x^2 + 1 = 0\) has no solution)	Algebraic closure (\(i = \sqrt{-1}\))

This chain is not arbitrary — each link is a necessary response to a structural deficiency.

graph LR
    N["ℕ<br/><i>Natural Numbers</i>"] -->|"closure under<br/>subtraction"| Z["ℤ<br/><i>Integers</i>"]
    Z -->|"closure under<br/>division"| Q["ℚ<br/><i>Rationals</i>"]
    Q -->|"completeness<br/>(fill the gaps)"| R["ℝ<br/><i>Reals</i>"]
    R -->|"algebraic<br/>closure"| C["ℂ<br/><i>Complex Numbers</i>"]

    style N fill:#1a237e,stroke:#5c6bc0,color:#fff
    style Z fill:#1b5e20,stroke:#66bb6a,color:#fff
    style Q fill:#e65100,stroke:#ff9800,color:#fff
    style R fill:#b71c1c,stroke:#ef5350,color:#fff
    style C fill:#4a148c,stroke:#ab47bc,color:#fff

Key Structures¶

Natural Numbers \(\mathbb{N}\) — The Peano Axioms¶

The natural numbers are characterized by five axioms (Peano, 1889; modern formulation via Dedekind):

\(0 \in \mathbb{N}\)
Every \(n \in \mathbb{N}\) has a unique successor \(S(n) \in \mathbb{N}\)
\(S\) is injective: \(S(m) = S(n) \implies m = n\)
\(0\) is not a successor: \(\nexists \, n \in \mathbb{N}\) such that \(S(n) = 0\)
(Induction) If a property holds for \(0\) and is preserved by \(S\), it holds for all \(n \in \mathbb{N}\)

Addition and multiplication are defined recursively:

[ m + 0 = m, \qquad m + S(n) = S(m + n) ] [ m \cdot 0 = 0, \qquad m \cdot S(n) = m \cdot n + m ]

The natural numbers support addition and multiplication but lack subtraction and division — motivating the first two extensions.

Integers \(\mathbb{Z}\) — Closure Under Subtraction¶

Formally, \(\mathbb{Z}\) is constructed as the set of equivalence classes of pairs \((a, b) \in \mathbb{N} \times \mathbb{N}\) under the relation:

\[ (a, b) \sim (c, d) \iff a + d = b + c \]

The class \([(a, b)]\) represents the "integer" \(a - b\). This gives us negative numbers without presupposing subtraction — a clean set-theoretic construction.

\((\mathbb{Z}, +)\) is an abelian group: closed, associative, commutative, with identity \(0\) and inverses \(-n\).

Rationals \(\mathbb{Q}\) — Closure Under Division¶

\(\mathbb{Q}\) is the field of fractions of \(\mathbb{Z}\): equivalence classes of pairs \((p, q)\) with \(q \neq 0\), where:

\[ (p, q) \sim (r, s) \iff ps = qr \]

The class \([(p, q)]\) represents \(\frac{p}{q}\).

\((\mathbb{Q}, +, \cdot)\) is a field: a commutative ring in which every non-zero element has a multiplicative inverse. This is the first number system where all four arithmetic operations (except division by zero) are available.

But \(\mathbb{Q}\) has gaps. The set \(\{q \in \mathbb{Q} \mid q^2 < 2\}\) has no least upper bound in \(\mathbb{Q}\). The "number" that should fill this gap — \(\sqrt{2}\) — does not exist in \(\mathbb{Q}\).

Reals \(\mathbb{R}\) — Completeness¶

The reals close the gaps in \(\mathbb{Q}\). Two equivalent constructions:

Dedekind cuts (1872): A Dedekind cut is a partition \((A, B)\) of \(\mathbb{Q}\) where:

\(A\) and \(B\) are non-empty
Every element of \(A\) is less than every element of \(B\)
\(A\) has no greatest element

Each cut corresponds to a unique real number (the "boundary" between \(A\) and \(B\)). Rational numbers correspond to cuts where \(B\) has a least element.

Cauchy sequences (alternative): A real number is an equivalence class of Cauchy sequences in \(\mathbb{Q}\), where two sequences are equivalent if their difference converges to zero.

Both constructions yield the same structure — the complete ordered field \(\mathbb{R}\), unique up to isomorphism.

Completeness of \(\mathbb{R}\)

Every non-empty subset of \(\mathbb{R}\) that is bounded above has a least upper bound (supremum) in \(\mathbb{R}\).

Equivalently: every Cauchy sequence in \(\mathbb{R}\) converges to a limit in \(\mathbb{R}\).

This property is the defining characteristic of the reals. It is what makes calculus (Layer 5) possible — limits, derivatives, and integrals all depend on completeness.

Complex Numbers \(\mathbb{C}\) — Algebraic Closure¶

\(\mathbb{R}\) is complete but not algebraically closed: the polynomial \(x^2 + 1 = 0\) has no real root. Adjoining the imaginary unit \(i\) with \(i^2 = -1\) gives:

\[ \mathbb{C} = \{a + bi \mid a, b \in \mathbb{R}\} \]

with addition and multiplication defined by:

[ (a + bi) + (c + di) = (a + c) + (b + d)i ] [ (a + bi)(c + di) = (ac - bd) + (ad + bc)i ]

Fundamental Theorem of Algebra

Every non-constant polynomial with complex coefficients has at least one root in \(\mathbb{C}\).

Equivalently: \(\mathbb{C}\) is algebraically closed — the extension chain terminates here (for algebraic purposes).

Knowledge Gap

The Fundamental Theorem of Algebra has no purely algebraic proof — all known proofs use some analysis or topology (e.g., Liouville's theorem, winding numbers, the intermediate value theorem). Verify whether this impossibility of a purely algebraic proof has been formally established or is merely an empirical observation.

To resolve: Check references on the proof-theoretic status of FTA; Remmert's chapter in Ebbinghaus et al. Numbers is a good starting point.

Canonical Constants Introduced¶

\(\pi\) — The Circle Constant¶

\[ \pi = 3.14159265358979\ldots \]

Originally the ratio of a circle's circumference to its diameter — a geometric definition. But \(\pi\) transcends geometry:

\(\displaystyle\sum_{n=1}^{\infty} \frac{1}{n^2} = \frac{\pi^2}{6}\) (Euler, 1735 — the Basel problem)
The Gaussian integral: \(\displaystyle\int_{-\infty}^{\infty} e^{-x^2} dx = \sqrt{\pi}\)
The normal distribution: \(\frac{1}{\sqrt{2\pi}} e^{-x^2/2}\)
Buffon's needle: the probability a needle crosses a line involves \(\pi\)

\(\pi\) is transcendental (Lindemann, 1882): it is not a root of any polynomial with integer coefficients.

\(e\) — The Base of Natural Logarithms¶

\[ e = \lim_{n \to \infty}\left(1 + \frac{1}{n}\right)^n = 2.71828182845904\ldots \]

Equivalently: \(\displaystyle e = \sum_{n=0}^{\infty} \frac{1}{n!}\).

The function \(e^x\) is its own derivative — the unique function \(f\) satisfying \(f'(x) = f(x)\) with \(f(0) = 1\). This makes it the fundamental function of calculus and differential equations.

\(e\) is transcendental (Hermite, 1873).

\(i\) — The Imaginary Unit¶

\[ i = \sqrt{-1}, \qquad i^2 = -1 \]

Invented by Cardano (1545) and Bombelli (1572) to solve cubic equations — initially distrusted as "impossible." Now indispensable: complex analysis, quantum mechanics, signal processing, and number theory all depend on \(i\).

\(\phi\) — The Golden Ratio¶

\[ \phi = \frac{1 + \sqrt{5}}{2} = 1.61803398874989\ldots \]

The unique positive root of \(x^2 - x - 1 = 0\). Satisfies the remarkable self-referential property:

\[ \phi = 1 + \frac{1}{\phi} \]

Connected to:

Fibonacci sequence: \(\displaystyle\lim_{n \to \infty} \frac{F_{n+1}}{F_n} = \phi\)
Continued fractions: \(\phi = 1 + \cfrac{1}{1 + \cfrac{1}{1 + \cfrac{1}{\ddots}}}\) — the "most irrational" number (slowest convergence of continued fraction)
Penrose tilings and quasicrystals

\(\phi\) is algebraic (unlike \(\pi\) and \(e\)), but irrational.

Historical Trigger¶

timeline
    title The Extension of Number Systems
    ~500 BCE : Pythagoreans discover √2 is irrational
              : Crisis — the diagonal of a unit square has no rational length
    ~300 BCE : Euclid's Elements
              : Rigorous treatment of ratios and magnitudes
    628 : Brahmagupta
        : First systematic rules for negative numbers and zero
    1545 : Cardano's Ars Magna
         : Complex numbers appear in cubic formula solutions
    1572 : Bombelli
         : Rules for arithmetic with complex numbers
    1799 : Gauss
         : First proof of the Fundamental Theorem of Algebra
    1843 : Hamilton
         : Quaternions — extension beyond ℂ (sacrificing commutativity)
    1858 : Dedekind begins constructing the reals
         : Dedekind cuts formalize completeness
    1872 : Dedekind and Cantor
         : Independent rigorous constructions of ℝ
    1873 : Hermite proves e is transcendental
    1882 : Lindemann proves π is transcendental
         : Settles the impossibility of squaring the circle

The pattern repeats at every step: a specific equation or measurement cannot be expressed in the current system, creating a crisis that drives the extension.

Key Proofs¶

Irrationality of \(\sqrt{2}\) Foundational¶

Irrationality of \(\sqrt{2}\)

\(\sqrt{2}\) is irrational: there do not exist integers \(p, q\) with \(q \neq 0\) and \(\sqrt{2} = p/q\).

Proof-sketch

Suppose for contradiction that \(\sqrt{2} = p/q\) where \(p/q\) is in lowest terms (i.e., \(\gcd(p, q) = 1\)).

Then \(2 = p^2/q^2\), so \(p^2 = 2q^2\).

Since \(p^2\) is even, \(p\) must be even (if \(p\) were odd, \(p^2\) would be odd). Write \(p = 2k\).

Substituting: \((2k)^2 = 2q^2 \implies 4k^2 = 2q^2 \implies q^2 = 2k^2\).

So \(q^2\) is even, hence \(q\) is even. But then both \(p\) and \(q\) are even, contradicting \(\gcd(p, q) = 1\). \(\square\)

Why it matters: This is historically the first proof that the rationals have "gaps." It shattered the Pythagorean belief that all magnitudes are commensurable (expressible as ratios of whole numbers) and set the stage — 2,300 years later — for the rigorous construction of the reals.

Construction of \(\mathbb{R}\) via Dedekind Cuts Bridge¶

Dedekind Completeness

The set of Dedekind cuts of \(\mathbb{Q}\), with the natural ordering, forms a complete ordered field — the real numbers \(\mathbb{R}\).

Proof-sketch

Construction. A Dedekind cut \(\alpha\) is a proper, non-empty, downward-closed subset of \(\mathbb{Q}\) with no maximum. Define:

Order: \(\alpha \leq \beta \iff \alpha \subseteq \beta\)
Addition: \(\alpha + \beta = \{a + b \mid a \in \alpha, b \in \beta\}\)
Multiplication: (more involved; handled case-by-case for sign)

Completeness. Let \(S\) be a non-empty set of cuts bounded above by a cut \(\gamma\). Define \(\sigma = \bigcup_{\alpha \in S} \alpha\). Then \(\sigma\) is a cut (verify the three properties), and \(\sigma = \sup S\).

Embedding \(\mathbb{Q}\). Each rational \(r\) corresponds to the cut \(\alpha_r = \{q \in \mathbb{Q} \mid q < r\}\). The map \(r \mapsto \alpha_r\) is an order-preserving field embedding. \(\square\)

Why it matters: This is the bridge from Layer ½ to Layer 5 (Analysis). The completeness property — every bounded-above subset has a supremum — is the single axiom that makes limits, derivatives, and integrals work. Without Dedekind's construction, the foundations of calculus would rest on intuition rather than proof.

Euler's Identity Bridge¶

Euler's Identity

\[ e^{i\pi} + 1 = 0 \]

This equation connects the five most important constants in mathematics: \(e\), \(i\), \(\pi\), \(1\), and \(0\) — drawn from number theory, analysis, geometry, and algebra.

It is a special case of Euler's formula at \(x = \pi\):

\[ e^{ix} = \cos x + i \sin x \]

Derivation of Euler's Formula

Start with the Taylor series (established in Layer 5 — Analysis):

\[ e^z = \sum_{n=0}^{\infty} \frac{z^n}{n!}, \qquad \cos x = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n}}{(2n)!}, \qquad \sin x = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n+1}}{(2n+1)!} \]

Substitute \(z = ix\) into the exponential series:

\[ e^{ix} = \sum_{n=0}^{\infty} \frac{(ix)^n}{n!} = \sum_{n=0}^{\infty} \frac{i^n x^n}{n!} \]

Separate real and imaginary parts using \(i^0 = 1,\; i^1 = i,\; i^2 = -1,\; i^3 = -i,\; i^4 = 1, \ldots\):

\[ e^{ix} = \left(1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \cdots\right) + i\left(x - \frac{x^3}{3!} + \frac{x^5}{5!} - \cdots\right) = \cos x + i\sin x \]

Setting \(x = \pi\): \(e^{i\pi} = \cos \pi + i \sin \pi = -1 + 0i = -1\), so \(e^{i\pi} + 1 = 0\). \(\square\)

Why it matters: Euler's identity is the quintessential bridge proof — it demonstrates that number systems (\(i\), \(1\), \(0\)), analysis (\(e\), Taylor series), and geometry (\(\pi\), trigonometric functions) are not separate subjects but different views of a single underlying structure. It also provides the foundation for the complex exponential, which is indispensable in Fourier analysis, differential equations, and quantum mechanics.

Knowledge Gap

The derivation above manipulates the Taylor series for \(e^z\) by substituting a complex argument. This requires justifying convergence of power series in \(\mathbb{C}\) — specifically, that the exponential series converges absolutely for all \(z \in \mathbb{C}\) and that rearrangement of terms is valid. A rigorous treatment belongs to Layer 5 (Analysis), specifically complex analysis.

To resolve: Cross-reference with the Analysis layer page (when written) to confirm that absolute convergence of \(\sum z^n / n!\) for all \(z \in \mathbb{C}\) is established there.

Irrationality of \(e\) Insight¶

Irrationality of \(e\) (Euler, 1737)

The number \(e\) is irrational.

Proof-sketch

From the series representation \(e = \sum_{n=0}^{\infty} 1/n!\), suppose \(e = p/q\) with \(p, q \in \mathbb{Z}\), \(q > 0\). Then:

\[ q! \cdot e = q! \sum_{n=0}^{\infty} \frac{1}{n!} = \underbrace{\sum_{n=0}^{q} \frac{q!}{n!}}_{\text{integer}} + \underbrace{\sum_{n=q+1}^{\infty} \frac{q!}{n!}}_{\text{remainder } R} \]

The remainder satisfies:

\[ 0 < R = \frac{1}{q+1} + \frac{1}{(q+1)(q+2)} + \cdots < \frac{1}{q+1}\left(1 + \frac{1}{q+1} + \frac{1}{(q+1)^2} + \cdots\right) = \frac{1}{q} \]

So \(0 < R < 1\). But \(q! \cdot e = q! \cdot p/q = (q-1)! \cdot p\) is an integer, and the first sum is an integer, so \(R\) must be an integer — but no integer lies strictly between 0 and 1. Contradiction. \(\square\)

Connections¶

Dependencies¶

Source Layer	What It Provides
Logic (Layer 0)	Proof by contradiction (used in irrationality proofs), induction (Peano axiom 5)
Set Theory (Layer 1)	Construction of \(\mathbb{N}\) from sets; Dedekind cuts for \(\mathbb{R}\); equivalence-class constructions for \(\mathbb{Z}\) and \(\mathbb{Q}\)

Upward Impact¶

Target Layer	What Number Systems Provide
Algebra (Layer 3)	\(\mathbb{Z}\), \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\) are the motivating examples of groups, rings, and fields
Geometry (Layer 4)	\(\mathbb{R}^n\) is the ambient space; \(\mathbb{C}\) enables algebraic geometry
Analysis (Layer 5)	The completeness of \(\mathbb{R}\) is the foundation of limits, derivatives, and integrals
Probability (Layer 6)	Real-valued random variables; the real line as the codomain of measurement

Sources & Further Reading¶

Dedekind, R. Continuity and Irrational Numbers (1872). — The original construction of the reals via cuts. Short and readable.
Ebbinghaus, H.-D. et al. Numbers (Springer, 1991). — Comprehensive treatment of the number system extensions, including quaternions and octonions.
Rudin, W. Principles of Mathematical Analysis (3^rd ed., 1976). — Chapter 1 constructs \(\mathbb{R}\) via Dedekind cuts with full rigor.
Needham, T. Visual Complex Analysis (1997). — A geometric and intuitive approach to \(\mathbb{C}\), including Euler's formula.
Conway, J. H. & Guy, R. K. The Book of Numbers (1996). — An accessible tour through number systems, constants, and their surprising interconnections.

title: Glossary tags: - reference - glossary

Glossary¶

A working reference of essential terms spanning all nine layers of the mathematical hierarchy. Terms are grouped alphabetically; hover-tooltip definitions are provided at the bottom for use across the knowledge base.

A¶

Term	Definition
Abelian Group	A group \((G, \ast)\) in which the operation is commutative: \(a \ast b = b \ast a\) for all \(a, b \in G\).
Algebraic Closure	A field extension in which every non-constant polynomial has a root. \(\mathbb{C}\) is the algebraic closure of \(\mathbb{R}\).
Axiom	A statement accepted without proof that serves as a starting point for a deductive system.
Axiom of Choice	For any collection of non-empty sets, there exists a function selecting one element from each set. Equivalent to Zorn's lemma and the well-ordering theorem.

B¶

Term	Definition
Bijection	A function that is both injective (one-to-one) and surjective (onto), establishing a one-to-one correspondence between two sets.
Boolean Algebra	An algebraic structure capturing the laws of classical logic: complement, meet, join, with identities \(0\) and \(1\).

C¶

Term	Definition
Cardinality	A measure of the "size" of a set. Two sets have equal cardinality if a bijection exists between them.
Category	A collection of objects and morphisms (arrows) between them, equipped with composition and identity morphisms satisfying associativity and identity laws.
Cauchy Sequence	A sequence \((a_n)\) in a metric space where for every \(\varepsilon > 0\) there exists \(N\) such that \(d(a_m, a_n) < \varepsilon\) for all \(m, n > N\).
Commutative Ring	A ring in which multiplication is commutative: \(ab = ba\).
Complex Number	An element of \(\mathbb{C} = \{a + bi \mid a, b \in \mathbb{R}\}\), where \(i^2 = -1\).
Conjecture	A mathematical statement believed to be true but not yet proven.
Continuity	A function \(f\) is continuous at \(a\) if \(\lim_{x \to a} f(x) = f(a)\). Intuitively, small changes in input produce small changes in output.
Convergence	A sequence \((a_n)\) converges to \(L\) if for every \(\varepsilon > 0\) there exists \(N\) such that (
Corollary	A result that follows directly from a theorem with little or no additional proof.

D¶

Term	Definition
Dedekind Cut	A partition of \(\mathbb{Q}\) into two non-empty sets \((A, B)\) where every element of \(A\) is less than every element of \(B\) and \(A\) has no greatest element. Used to construct \(\mathbb{R}\).
Derivative	The instantaneous rate of change of \(f\) at \(x\): \(f'(x) = \lim_{h \to 0} \frac{f(x+h) - f(x)}{h}\).
Distribution	A probability measure on a measurable space describing the likelihood of outcomes for a random variable.

E¶

Term	Definition
Eigenvalue	A scalar \(\lambda\) such that \(Av = \lambda v\) for some non-zero vector \(v\) (the eigenvector) and linear map \(A\).

F¶

Term	Definition
Field	A commutative ring with unity in which every non-zero element has a multiplicative inverse. Examples: \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\).
Functor	A structure-preserving map between categories, sending objects to objects and morphisms to morphisms while respecting composition and identities.

G¶

Term	Definition
Graph	A combinatorial structure \(G = (V, E)\) consisting of vertices \(V\) and edges \(E \subseteq V \times V\).
Group	A set \(G\) with a binary operation satisfying closure, associativity, existence of identity, and existence of inverses.

H¶

Term	Definition
Homeomorphism	A continuous bijection whose inverse is also continuous. Two spaces are homeomorphic if they are "topologically the same."
Homomorphism	A structure-preserving map between algebraic structures (groups, rings, etc.).

I¶

Term	Definition
Injection	A function \(f\) where \(f(a) = f(b) \implies a = b\). Also called "one-to-one."
Integral	The Riemann or Lebesgue integral measures the "accumulated value" of a function over a domain. \(\int_a^b f(x)\,dx\).
Irrational Number	A real number that cannot be expressed as a ratio of integers. Examples: \(\sqrt{2}\), \(\pi\), \(e\).
Isomorphism	A bijective homomorphism — a structure-preserving map with a structure-preserving inverse. Two objects are isomorphic if they are "algebraically the same."

L¶

Term	Definition
Lemma	A proven statement used as a stepping stone toward a larger theorem.
Limit	The value that a function or sequence approaches as the input or index approaches some value.

M¶

Term	Definition
Manifold	A topological space that locally resembles \(\mathbb{R}^n\). Smooth manifolds carry differentiable structure.
Measure	A function assigning a non-negative extended real number to subsets of a space, generalizing length, area, and volume. Must be countably additive.
Morphism	An arrow in a category — a generalization of "structure-preserving map" that abstracts functions, homomorphisms, and continuous maps.

N¶

Term	Definition
Natural Transformation	A family of morphisms connecting two functors \(F, G : \mathcal{C} \to \mathcal{D}\) that commutes with every morphism in \(\mathcal{C}\).

P¶

Term	Definition
Predicate	A statement containing one or more variables that becomes a proposition when values are substituted. Example: \(P(x) \equiv x > 5\).
Prime	A natural number \(p > 1\) whose only divisors are \(1\) and \(p\). The fundamental building blocks of \(\mathbb{N}\) under multiplication.
Proof	A finite sequence of logical deductions establishing the truth of a statement from axioms and previously proven results.

Q¶

Term	Definition
Quantifier	A logical symbol binding a variable: the universal quantifier \(\forall\) ("for all") and the existential quantifier \(\exists\) ("there exists").

R¶

Term	Definition
Random Variable	A measurable function from a probability space to \(\mathbb{R}\) (or \(\mathbb{R}^n\)).
Ring	A set equipped with two operations (addition and multiplication) where addition forms an abelian group, multiplication is associative, and multiplication distributes over addition.

S¶

Term	Definition
Surjection	A function \(f: A \to B\) where every element of \(B\) is the image of at least one element of \(A\). Also called "onto."

T¶

Term	Definition
Tautology	A propositional formula that is true under every truth-value assignment. Example: \(P \lor \lnot P\).
Theorem	A mathematical statement proven true within a formal system.
Topology	The study of properties preserved under continuous deformations. A topology on a set \(X\) is a collection of "open" subsets closed under arbitrary unions and finite intersections.
Transcendental Number	A real or complex number that is not a root of any non-zero polynomial with integer coefficients. Examples: \(\pi\), \(e\).
Tree	A connected acyclic graph. Equivalently, a graph on \(n\) vertices with exactly \(n - 1\) edges and no cycles.

V¶

Term	Definition
Vector Space	A set \(V\) over a field \(F\) equipped with addition and scalar multiplication satisfying eight axioms (closure, associativity, distributivity, identity elements, inverses).

Z¶

Term	Definition
ZFC	Zermelo-Fraenkel set theory with the Axiom of Choice — the standard axiomatic foundation for modern mathematics.