We provide a canonical construction of the natural numbers in the universe of sets. Then, the power set of the natural numbers is given the structure of the real number system. For this, we prove the co-finite topology, , is isomorphic to the natural numbers. Then, we prove the power set of integers, , contains a subset isomorphic to the non-negative real numbers, with all its defining structures of operations and order. We use these results to give the power set, , the structure of the real number system. We give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. Supremum and infimum functions are explicitly constructed, also. Section 6 contains the main results. We propose a new axiomatic basis for analysis, which represents real numbers as sets of natural numbers. We answer Benacerraf’s identification problem by giving a canonical representation of natural numbers, and then real numbers, in the universe of sets. In the last section, we provide a series of graphic representations and physical models of the real number system. We conclude that the system of real numbers is completely defined by the order structure of natural numbers and the operations in the universe of sets.
We present the real number system as a natural generalization of the natural numbers. First, we prove the co-finite topology, $Cof(\mathbb N)$, is isomorphic to the natural numbers. Then, we generalize these results to describe the continuum $[0,1]$. Then we prove the power set $2^{\mathbb Z}$ contains a subset isomorphic to the non-negative real numbers, with all its defining structure of operations and order. Finally, we provide two different constructions of the entire real number line. We see that the power set $2^{\mathbb N}$ can be given the defining structure of $\mathbb R$. The constructions here provided give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. The supremum and infimum are explicitly constructed by means of a well defined algorithm that ends in denumerable steps. In section 5 we give evidence our construction of $\mathbb N$ and $\mathbb R$ are canonical; these constructions are as natural as possible. In the same section, we propose a new axiomatic basis for analysis. In the last section we provide a series of graphic representations and physical models that can be used to represent the real number system. We conclude that the system of real numbers is completely defined by the order structure of $\mathbb N$.}
A construction for the systems of natural and real numbers is presented in Zermelo-Fraenkel Set Thoery, that allows for simple proofs of the properties of these systems, and practical and mathematical applications. A practical application is discussed, in the form of a Simple and Linear Fast Adder (Patent Pending). Applications to finite group theory and analysis are also presented. A method is illustrated for finding the automorphisms of any finite group $G$, which consists of defining a canonical block form for finite groups. Examples are given, to illustrate the procedure for finding all groups of $n$ elements along with their automorphisms. The canonical block form of the symmetry group $\Delta_4$ is provided along with its automorphisms. The construction of natural numbers is naturally generalized to provide a simple and sound construction of the continuum with order and addition properties, and where a real number is an infinite set of natural numbers. A basic outline of analysis is proposed with a fast derivative algorithm. Under this representation, a countable sequence of real numbers is represented by a single real number. Furthermore, an infinite $\infty\times\infty$ real-valued matrix is represented with a single real number. A real function is represented by a set of real numbers, and a countable sequence of real functions is also represented by a set of real numbers. In general, mathematical objects can be represented using the smallest possible data type and these representations are calculable. In the last section, mathematical objects of all types are well assigned to tree structures in a proposed type hierarchy.
We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order, on the quotient space of isomorphism classes of finite groups, that is well behaved with respect to cardinality. If $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G\leq\mathbb Z_{p_1}^{n_1}\oplus\mathbb Z_{p_2}^{n_2}\oplus\cdots\oplus\mathbb Z_{p_k}^{n_k}$ where $n=p_1^{n_1}p_2^{n_2}\cdots p_{k}^{n_k}$ is the prime factorization of $n$. We find a canonical order for the objects of $G$ and define equivalent objects of $G$, thus finding the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and we are provided with a minimal set of independent equations that define the group. We show how to find all groups of order $n$, and order them. We give examples using all groups with order smaller than $10$, and we find the canonical block form of the symmetry group $\Delta_4$. In the next section, we extend our results to the infinite case, which defines a real number as an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, as well. In general, we represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects are well assigned to tree structures. We conclude with brief comments on type theory and future work on computational aspects of these representations.
Few questions that have resounded through the mind of the mathematician, as much as the simple question of describing the nature of a number. The longstanding consensus is that it does not matter which set theory is used to describe numbers. What matters is that it can be done. It is widely believed that the particular choice of a construction for natural and real numbers is irrelevant for the rest of mathematics. A set theory is proposed as a canonical theory that yields transparent proofs in fundamental areas of mathematics including group theory, discrete mathematics, analysis, data types, and new results tying these areas and addressing Hilbert's 24th (twenty-fourth) Problem and Benacerraf's Identification Problem. Applications to computer science are discussed and these include a linearly-scaleable circuit that serves for parallel addition and multiplication of scalars, vectors and matrices, with wide implications for Area-Specific Integrated Circuits (ASICs) used in CGI, Neural Networks and AI training, Digital Signal Processing, among other applications that depend on fast and low-powered vector operations. This low-power In-Situ (In-Memory) computing architecture, based on a patent-pending Simple and Linear Fast Adder (SLFA), is a direct consequence of the proposed set theory. Algebraic invariants are also described with results bringing together set theory, discrete mathematics, number theory and algebraic structures. A canonical block form is defined for the Cayley table of finite groups, in terms of a numeric representation of groups. Automorphisms, and the minimal independent system of equations that define the group are given by the block form, among other information regarding groups' internal and external structure. The proposed construction of natural numbers is generalized to provide a simple and transparent construction of the continuum of real numbers, with a fast approximation for the numeric derivative that can be implemented with the SLFA. Infinite data structures are defined in the most efficient way with the smallest possible data type. A countable sequence of real numbers is coded in a single real number, and an infinite \(\infty\times\infty\) real-valued matrix is also coded with a single real number. A real function is coded in a set of real numbers, and a countable sequence of real functions is also coded in a set of real numbers. These codings are meaningful and computable. Mathematical objects of all types are well assigned to tree structures in a proposed hierarchy of types.