Integrality
Overview
Integrality (정수성, 整數性; integrality) is a concept in mathematics that specifies whether an object has the property of being an integer (整數, 정수). In a narrow sense, it refers to the property of determining whether a real number or rational number is actually an integer; in a broad sense, it refers to the property that an element forms an integral extension in an extension setting of commutative rings. Integrality is a foundational concept widely applied in number theory, algebra, and analysis as well as in numerical representation and formal verification in computer science.
Main Content
Basic Definition and Integrality of Rational Numbers
A rational number q = a/b (a, b are coprime integers, b ≠ 0) is an integer if and only if the denominator b is 1 or -1. That is, in a reduced fraction representation, if the absolute value of the denominator is 1, the number is an integer; otherwise, it is not. This simple criterion is implemented as an algorithm that checks whether reduction is possible, and the Euclidean algorithm using the greatest common divisor is used as a standard tool.
Determining Integrality and Rounding Functions
For a real number x, the floor function ⌊x⌋ and the ceiling function ⌈x⌉ return the largest integer not exceeding x and the smallest integer not less than x, respectively. Here, x is an integer if and only if ⌊x⌋ = ⌈x⌉, or x − ⌊x⌋ = 0. In numerical computation, because of floating-point error, this determination is not always trivial, and comparing with a tolerance is widely used in practice.
Quadratic Irrationals and Integrality
Irrational numbers such as √2 and √3 are not integers, but some algebraic numbers are roots of certain integer-coefficient equations, extending the concept of integrality. For example, (1+√5)/2 is the golden ratio and is a root of the equation x² − x − 1 = 0. Complex numbers that are roots of integer-coefficient polynomials in this way are called algebraic integers, a concept that generalizes integers in the rational-number range to algebraic number fields.
Integral Extensions and Algebraic Integers
Let R be a commutative ring that is a subring of S. An element s of S is integral over R if there exists a monic polynomial f(x) ∈ R[x] with leading coefficient 1 such that f(s) = 0. This definition generalizes the coefficient ring from the integer ring Z to an arbitrary ring, and it is the starting point for the concepts of integral closure and normal ring in field theory and algebraic geometry. The set of all algebraic integers forms a ring, and invertible elements in that ring are classified as units.
Applications
Integrality is the basis for modular arithmetic and primality testing in cryptography, and in computer science it is the basis for distinguishing integer and floating-point types, overflow checks, and type conversion rules. In numerical analysis, techniques are used to control rounding errors so that results land exactly on an integer lattice.
Recent Trends
In 2024–2025, attempts to formalize theorems on integrality testing and integral extensions using proof assistants such as Lean 4 and Mathlib, and Coq/Rocq, are active. In particular, projects that library-ize the basic properties of rings of algebraic integers to connect number-theory research and software verification are increasing; meanwhile, improvements to numerical libraries that handle error in integrality testing in floating-point operations and expansion of benchmarks for AI-based automated theorem proving are also underway. In education, curricula that teach integer division and remainder conventions in programming languages in connection with the mathematical concept of integrality are spreading.
Related Topics
- [[정수론]]
- [[대수적 정수론]]
- [[부동소수점]]
- [[환론]]