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 IntegersFailure 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic IntegersThe Norm in Algebraic Number Fields

Longest path: 95 steps · 399 total prerequisite topics

Prerequisites (1)

Leads To (1)