A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

The Norm in Algebraic Number Fields

Research Depth 94 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
399prerequisites beneath it
See this on the map →
Algebraic Integers→→Failure of Unique Factorization in Algebraic Number Fields
norm algebraic-number-fields number-theory

Core Idea

The norm N: K → ℚ of a number field K is a multiplicative function sending each element to the product of its conjugates. The norm is essential for factorization properties, ideal theory, and solving Diophantine equations in algebraic number fields.

Explainer

Start with the simplest nontrivial case: the Gaussian integers ℤ[i], where elements are a+bi with a,b ∈ ℤ. The norm of a+bi is N(a+bi) = a²+b², which you may recognize as the squared distance from the origin. Equivalently, N(a+bi) = (a+bi)(a−bi) — the element times its complex conjugate. This gives a positive integer, and crucially, N is multiplicative: N((a+bi)(c+di)) = N(a+bi)·N(c+di). You can verify this directly, or notice it follows from |zw| = |z||w| for complex numbers.

In a general number field K = ℚ(α) of degree n, an algebraic integer α satisfies a degree-n polynomial over ℚ with n conjugates α = α₁, α₂, ..., αₙ (the roots). The norm of an element θ ∈ K is N(θ) = σ₁(θ)·σ₂(θ)···σₙ(θ), the product over all field embeddings σᵢ: K → ℂ. For K = ℚ(i), there are two embeddings: the identity and complex conjugation, giving N(a+bi) = (a+bi)(a−bi) = a²+b² — exactly what we computed above.

Multiplicativity N(αβ) = N(α)N(β) follows from the fact that each embedding is a ring homomorphism: σᵢ(αβ) = σᵢ(α)σᵢ(β), so the product over all embeddings factorizes. This multiplicativity is the norm's most useful property. It means if N(α) is a rational prime p, then α cannot factor as α = βγ with both β,γ non-units in O_K — otherwise N(β)·N(γ) = p with both factors integers greater than 1, a contradiction. So elements with prime norm are irreducible.

This gives a direct tool for Diophantine equations. To solve x²+y²=5 in integers, rewrite it as N(x+yi) = 5 in ℤ[i]. Since N(2+i) = 4+1 = 5, we find 2+i is a Gaussian prime, and the solutions to the Diophantine equation correspond to the Gaussian integer factorizations of 5. More generally, any question about which primes p are representable as x²+ny² translates into a question about factorization in ℤ[√(−n)], with the norm measuring whether factorization is possible.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic Integers → The Norm in Algebraic Number Fields

Longest path: 95 steps · 399 total prerequisite topics

Prerequisites (1)

Leads To (1)