Introduction
A definable real number is one that can be uniquely specified by a description, which may take the form of a construction or a formula within a formal language. This concept plays a crucial role in various branches of mathematics, particularly in set theory and logic. Examples of definable real numbers include the positive square root of 2, which can be defined as the unique positive solution to the equation (x^2 = 2). Additionally, there are different interpretations and definitions of what constitutes a definable number based on the formal languages used. This article explores various kinds of definable real numbers, including constructible numbers, algebraic numbers, and computable numbers, along with their significance in mathematical theory.
Constructible Numbers
A real number is termed a constructible number if it can be represented as the length of a line segment constructed using only a compass and straightedge, starting from a line segment of length 1. This geometric method allows for the specification of numerous well-known numbers. For instance, all positive integers and rational numbers are constructible. The positive square root of 2 is also constructible due to its ability to be derived geometrically. However, not all roots are constructible; the cube root of 2 serves as an example of an algebraic number that cannot be constructed with these tools. This specific limitation is tied to the classical problem known as “doubling the cube.”
Properties of Constructible Numbers
Constructible numbers possess several key properties. They include all positive integers and rational numbers, making them foundational in mathematics. Furthermore, they are closed under arithmetic operations such as addition, subtraction, multiplication, and division (excluding division by zero). However, it is essential to note that while every constructible number is algebraic (meaning it is a root of some polynomial with integer coefficients), not every algebraic number is constructible.
Real Algebraic Numbers
A real number is classified as an algebraic number if it is a root of some polynomial with integer coefficients. For example, if there exists a polynomial (p(x)) where (p(r) = 0), then (r) qualifies as an algebraic number. This classification includes all rational numbers and provides a broader framework for understanding real numbers.
Defining Algebraic Numbers
Each real algebraic number can be uniquely identified using order relations on real numbers. If a polynomial (q(x)) has multiple real roots, one can define any specific root based on its position among the others. For instance, if (q(x)) has five distinct real roots, the third root can be defined as the unique value (r) such that there are two other distinct roots less than (r). While all rational numbers are algebraic and thus constructible, certain algebraic numbers like the cube root of 2 illustrate that not all algebraic numbers can be constructed geometrically.
Countability and Transcendental Numbers
One significant distinction within real numbers arises from their countability. Although there are only countably many algebraic numbers, the set of all real numbers is uncountably infinite. As established by mathematician Georg Cantor in his work from 1874, this leads to the conclusion that most real numbers are not algebraic but rather transcendental. Notable examples of transcendental numbers include (pi) and (e), both of which cannot be expressed as roots of any polynomial with integer coefficients.
Computable Real Numbers
A computable real number is defined as one for which an algorithm exists that can produce its decimal expansion to any desired degree of accuracy given an integer input (n). This concept was introduced by Alan Turing in 1936 and encompasses both algebraic and many transcendental numbers such as (pi) and (e).
Characteristics of Computable Numbers
Computable real numbers form a subfield within the realm of real numbers. They share certain properties with both algebraic and constructible numbers; for instance, positive computable numbers remain closed under taking roots for any positive integer (n). Despite this relationship, it is crucial to understand that not all real numbers are computable. There exist noncomputable reals such as limits of Specker sequences or algorithmically random reals like Chaitin’s Ω.
Definability in Arithmetic
The notion of definability extends into formal theories such as Peano arithmetic, where specific predicates must define real numbers through their Dedekind cuts. A real number (a) is arithmetically definable if there exists a first-order formula (varphi) with three free variables that encapsulates conditions involving nonnegative integers.
Second-Order Definability
In contrast to first-order languages, second-order arithmetic allows for variables and quantifiers over sets of natural numbers. A real number defined in this context is termed analytical. While every computable number falls into the category of arithmetical definitions, not every arithmetical number qualifies as computable.
Definability in Models of ZFC
The examination of definability also occurs within models of Zermelo-Fraenkel set theory with choice (ZFC). A real number (a) is first-order definable within the language of set theory relative to a model (M) if there exists a formula (varphi) such that (a) uniquely satisfies this formula within (M). This framework leads to varying notions of definability depending on model characteristics.
Countability Constraints
The presence of uncountably many real numbers within any model guarantees that some cannot be defined without parameters through first-order formulas due to the countably limited nature of available formulas. This introduces complexities when considering class models like the von Neumann universe since certain assertions about definability cannot be easily expressed within ZFC’s formal structure.
Conclusion
The concept of definable real numbers encompasses a diverse range of classifications including constructible, algebraic, and computable numbers. Each category offers unique insights into mathematical structures and relationships among different types of real numbers. Understanding these distinctions not only enriches mathematical discourse but also underscores the intricate nature inherent in defining elements across various mathematical frameworks. As we delve deeper into these concepts, we discover that while many familiar constants like (pi) and (e) belong to definable categories, there remains an expansive realm beyond our current definitions waiting to be explored.
Artykuł sporządzony na podstawie: Wikipedia (EN).