In mathematics, a dyadic rational or binary rational is a number that can be expressed as a fraction whose denominator is a power of two. For example, 1/2, 3/2, and 3/8 are dyadic rationals, but 1/3 is not. These numbers are important in computer science because they are the only ones with finite binary representations. Dyadic rationals also have applications in weights and measures, musical time signatures, and early mathematics education. They can accurately approximate any real number.
The sum, difference, or product of any two dyadic rational numbers is another dyadic rational number, given by a simple formula. However, division of one dyadic rational number by another does not always produce a dyadic rational result. Mathematically, this means that the dyadic rational numbers form a ring, lying between the ring of integers and the field of rational numbers. This ring may be denoted .
In advanced mathematics, the dyadic rational numbers are central to the constructions of the dyadic solenoid, Minkowski's question-mark function, Daubechies wavelets, Thompson's group, Prüfer 2-group, surreal numbers, and fusible numbers. These numbers are order-isomorphic to the rational numbers; they form a subsystem of the 2-adic numbers as well as of the reals, and can represent the fractional parts of 2-adic numbers. Functions from natural numbers to dyadic rationals have been used to formalize mathematical analysis in reverse mathematics.
Many traditional systems of weights and measures are based on the idea of repeated halving, which produces dyadic rationals when measuring fractional amounts of units. The inch is customarily subdivided in dyadic rationals rather than using a decimal subdivision. The customary divisions of the gallon into half-gallons, quarts, pints, and cups are also dyadic. The ancient Egyptians used dyadic rationals in measurement, with denominators up to 64. Similarly, systems of weights from the Indus Valley Civilisation are for the most part based on repeated halving; anthropologist Heather M.-L. Miller writes that "halving is a relatively simple operation with beam balances, which is likely why so many weight systems of this time period used binary systems".
Dyadic rationals are central to computer science as a type of fractional number that many computers can manipulate directly. In particular, as a data type used by computers, floating-point numbers are often defined as integers multiplied by positive or negative powers of two. The numbers that can be represented precisely in a floating-point format, such as the IEEE floating-point datatypes, are called its representable numbers. For most floating-point representations, the representable numbers are a subset of the dyadic rationals. The same is true for fixed-point datatypes, which also use powers of two implicitly in the majority of cases. Because of the simplicity of computing with dyadic rationals, they are also used for exact real computing using interval arithmetic, and are central to some theoretical models of computable numbers.
Generating a random variable from random bits, in a fixed amount of time, is possible only when the variable has finitely many outcomes whose probabilities are all dyadic rational numbers. For random variables whose probabilities are not dyadic, it is necessary either to approximate their probabilities by dyadic rationals, or to use a random generation process whose time is itself random and unbounded.
Time signatures in Western musical notation traditionally are written in a form resembling fractions (for example: 2
4, or 6
8), although the horizontal line of the musical staff that separates the top and bottom number is usually omitted when writing the signature separately from its staff. As fractions they are generally dyadic, although non-dyadic time signatures have also been used. The numeric value of the signature, interpreted as a fraction, describes the length of a measure as a fraction of a whole note. Its numerator describes the number of beats per measure, and the denominator describes the length of each beat.
In mathematics educationEdit
In theories of childhood development of the concept of a fraction based on the work of Jean Piaget, fractional numbers arising from halving and repeated halving are among the earliest forms of fractions to develop. This stage of development of the concept of fractions has been called "algorithmic halving". Addition and subtraction of these numbers can be performed in steps that only involve doubling, halving, adding, and subtracting integers. In contrast, addition and subtraction of more general fractions involves integer multiplication and factorization to reach a common denominator. Therefore, dyadic fractions can be easier for students to calculate with than more general fractions.
Definitions and arithmeticEdit
The dyadic numbers are the rational numbers that result from dividing an integer by a power of two. A rational number in simplest terms is a dyadic rational when is a power of two. Another equivalent way of defining the dyadic rationals is that they are the real numbers that have a terminating binary representation.
Every integer, and every half-integer, is a dyadic rational. They both meet the definition of being an integer divided by a power of two: every integer is an integer divided by one (the zeroth power of two), and every half-integer is an integer divided by two.
Every real number can be arbitrarily closely approximated by dyadic rationals. In particular, for a real number , consider the dyadic rationals of the form , where can be any integer and denotes the floor function that rounds its argument down to an integer. These numbers approximate from below to within an error of , which can be made arbitrarily small by choosing to be arbitrarily large. For a fractal subset of the real numbers, this error bound is within a constant factor of optimal: for these numbers, there is no approximation with error smaller than a constant times . The existence of accurate dyadic approximations can be expressed by saying that the set of all dyadic rationals is a dense in the real line. More strongly, this set is uniformly dense, in the sense that the dyadic rationals with denominator are uniformly spaced on the real line.
The dyadic rationals are precisely those numbers possessing finite binary expansions. Their binary expansions are not unique; there is one finite and one infinite representation of each dyadic rational other than 0 (ignoring terminal 0s). For example, 0.112 = 0.10111...2, giving two different representations for 3/4. The dyadic rationals are the only numbers whose binary expansions are not unique.
In advanced mathematicsEdit
Because they are closed under addition, subtraction, and multiplication, but not division, the dyadic rationals are a ring but not a field. The ring of dyadic rationals may be denoted , meaning that it can be generated by evaluating polynomials with integer coefficients, at the argument 1/2. As a ring, the dyadic rationals are a subring of the rational numbers, and an overring of the integers. Algebraically, this ring is the localization of the integers with respect to the set of powers of two.
As well as forming a subring of the real numbers, the dyadic rational numbers form a subring of the 2-adic numbers, a system of numbers that can be defined from binary representations that are finite to the right of the binary point but may extend infinitely far to the left. The 2-adic numbers include all rational numbers, not just the dyadic rationals. Embedding the dyadic rationals into the 2-adic numbers does not change the arithmetic of the dyadic rationals, but it gives them a different topological structure than they have as a subring of the real numbers. As they do in the reals, the dyadic rationals form a dense subset of the 2-adic numbers, and are the set of 2-adic numbers with finite binary expansions. Every 2-adic number can be decomposed into the sum of a 2-adic integer and a dyadic rational; in this sense, the dyadic rationals can represent the fractional parts of 2-adic numbers, but this decomposition is not unique.
Considering only the addition and subtraction operations of the dyadic rationals gives them the structure of an additive abelian group. Pontryagin duality is a method for understanding abelian groups by constructing dual groups, whose elements are characters of the original group, group homomorphisms to the multiplicative group of the complex numbers, with pointwise multiplication as the dual group operation. The dual group of the additive dyadic rationals, constructed in this way, can also be viewed as a topological group. It is called the dyadic solenoid, and is isomorphic to the topological product of the real numbers and 2-adic numbers, quotiented by the diagonal embedding of the dyadic rationals into this product. It is an example of a protorus, a solenoid, and an indecomposable continuum.
Functions with dyadic rationals as distinguished pointsEdit
Because they are a dense subset of the real numbers, the dyadic rationals, with their numeric ordering, form a dense order. As with any two unbounded countable dense linear orders, by Cantor's isomorphism theorem, the dyadic rationals are order-isomorphic to the rational numbers. In this case, Minkowski's question-mark function provides an order-preserving bijection between the set of all rational numbers and the set of dyadic rationals.
The dyadic rationals play a key role in the analysis of Daubechies wavelets, as the set of points where the scaling function of these wavelets is non-smooth. Similarly, the dyadic rationals parameterize the discontinuities in the boundary between stable and unstable points in the parameter space of the Hénon map.
The set of piecewise linear homeomorphisms from the unit interval to itself that have power-of-2 slopes and dyadic-rational breakpoints forms a group under the operation of function composition. This is Thompson's group, the first known example of an infinite but finitely presented simple group. The same group can also be represented by an action on rooted binary trees, or by an action on the dyadic rationals within the unit interval.
In reverse mathematics, one way of constructing the real numbers is to represent them as functions from unary numbers to dyadic rationals, where the value of one of these functions for the argument is a dyadic rational with denominator that approximates the given real number. Defining real numbers in this way allows many of the basic results of mathematical analysis to be proven within a restricted theory of second-order arithmetic called "feasible analysis" (BTFA).
The surreal numbers are generated by an iterated construction principle which starts by generating all finite dyadic rationals, and then goes on to create new and strange kinds of infinite, infinitesimal and other numbers. This number system is foundational to combinatorial game theory, and dyadic rationals arise naturally in this theory as the set of values of certain combinatorial games.
The fusible numbers are a subset of the dyadic rationals, the closure of the set under the operation , restricted to pairs with . They are well-ordered, with order type equal to the epsilon number . For each integer the smallest fusible number that is greater than has the form . The existence of for each cannot be proven in Peano arithmetic, and grows so rapidly as a function of that for it is (in Knuth's up-arrow notation for large numbers) already larger than .
- Rudman, Peter S. (2009), How Mathematics Happened: The First 50,000 Years, Prometheus Books, p. 148, ISBN 978-1-61592-176-8
- Barnes, John (2016), Nice Numbers, Springer International Publishing, doi:10.1007/978-3-319-46831-0, ISBN 978-3-319-46830-3,
Note that binary measures (2, 4, 8, 16) are very common indeed. This is particularly obvious with volumes.
- Curtis, Lorenzo J. (1978), "Concept of the exponential law prior to 1900", American Journal of Physics, 46 (9): 896–906, doi:10.1119/1.11512
- Miller, Heather M.-L. (2013), "Weighty matters: evidence for unity and regional diversity from the Indus civilization weights", in Abraham, Shinu Anna; Gullapalli, Praveena; Raczek, Teresa P.; Rizvi, Uzma Z. (eds.), Connections and Complexity: New Approaches to the Archaeology of South Asia, Left Coast Press, pp. 161–177, doi:10.4324/9781315431857, ISBN 978-1-59874-686-0; see in particular p. 166
- Resnikoff, Howard L.; Wells, Raymond O. Jr. (1998), "2.2.1: Digital computers and measurement", Wavelet Analysis: The Scalable Structure of Information, New York: Springer-Verlag, pp. 17–18, doi:10.1007/978-1-4612-0593-7, ISBN 0-387-98383-X, MR 1712468
- Kirk, David B.; Hwu, Wen-mei W. (2013), "7.2 Representable numbers", Programming Massively Parallel Processors: A Hands-on Approach (2nd ed.), Morgan Kaufmann, pp. 155–159, ISBN 978-0-12-391418-7
- Kneusel, Ronald T. (2017), "Chapter 6: Fixed-point numbers", Numbers and Computers (2nd ed.), Springer International Publishing, pp. 183–214, doi:10.1007/978-3-319-50508-4_6
- van der Hoeven, Joris (2006), "Computations with effective real numbers", Theoretical Computer Science, 351 (1): 52–60, doi:10.1016/j.tcs.2005.09.060, MR 2201092
- Ko, Ker-I (1991), Complexity Theory of Real Functions, Progress in Theoretical Computer Science, Boston, Massachusetts: Birkhäuser Boston, Inc., pp. 41–43, doi:10.1007/978-1-4684-6802-1, ISBN 0-8176-3586-6, MR 1137517, S2CID 11758381
- Zheng, Xizhong; Rettinger, Robert (2004), "Weak computability and representation of reals", Mathematical Logic Quarterly, 50 (4–5): 431–442, doi:10.1002/malq.200310110, MR 2090389
- Ambos-Spies, Klaus; Zheng, Xizhong (2019), "On the differences and sums of strongly computably enumerable real numbers", in Manea, Florin; Martin, Barnaby; Paulusma, Daniël; Primiero, Giuseppe (eds.), Computing with Foresight and Industry: 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings, Lecture Notes in Computer Science, 11558, Cham: Springer, pp. 310–322, doi:10.1007/978-3-030-22996-2_27, MR 3981892
- Jerrum, Mark R.; Valiant, Leslie G.; Vazirani, Vijay V. (1986), "Random generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970
- Jones, Shelly M.; Pearson, Dunn (May 2013), "Music: highly engaged students connect music to math", General Music Today, 27 (1): 18–23, doi:10.1177/1048371313486478
- Libbey, Theodore (2006), "Time signature", The NPR Listener's Encyclopedia of Classical Music, Workman Publishing, p. 873, ISBN 978-0-7611-2072-8
- Yanakiev, Ivan K. (2020), "Mathematical devices in aid of music theory, composition, and performance", in Bozhikova, Milena (ed.), Music between Ontology and Ideology, Cambridge Scholars Publishing, pp. 35–62, ISBN 978-1-5275-4758-2; see in particular p. 37.
- Hiebert, James; Tonnessen, Lowell H. (November 1978), "Development of the fraction concept in two physical contexts: an exploratory investigation", Journal for Research in Mathematics Education, 9 (5): 374–378, doi:10.2307/748774, JSTOR 748774
- Pothier, Yvonne; Sawada, Daiyo (November 1983), "Partitioning: the emergence of rational number ideas in young children", Journal for Research in Mathematics Education, 14 (5): 307–317, doi:10.2307/748675, JSTOR 748675
- Wells, David Graham (2015), Motivating Mathematics: Engaging Teachers And Engaged Students, World Scientific, pp. 32–33, ISBN 978-1-78326-755-2
- Uiterwijk, Jos W. H. M.; Barton, Michael (2015), "New results for Domineering from combinatorial game theory endgame databases", Theoretical Computer Science, 592: 72–86, arXiv:1506.03949, doi:10.1016/j.tcs.2015.05.017, MR 3367582, S2CID 5899577
- Equivalent formulas to these, written in the language of the Coq interactive theorem prover, are given by Krebbers, Robbert; Spitters, Bas (2013), "Type classes for efficient exact real arithmetic in Coq", Logical Methods in Computer Science, 9 (1): 1:01, 27, arXiv:1106.3448, doi:10.2168/LMCS-9(1:1)2013, MR 3029087
- O'Connor, Russell (2007), "A monadic, functional implementation of real numbers", Mathematical Structures in Computer Science, 17 (1): 129–159, doi:10.1017/S0960129506005871, MR 2311089, S2CID 221168970
- Sabin, Malcolm (2010), Analysis and Design of Univariate Subdivision Schemes, Geometry and Computing, 6, Springer, p. 51, ISBN 9783642136481
- More precisely, for small positive values of , the set of real numbers that have no approximation with error smaller than a constant times forms a Cantor set whose Hausdorff dimension, as a function of , goes to one as approaches zero. The illustration shows this set for .
- Nilsson, Johan (2009), "On numbers badly approximable by dyadic rationals", Israel Journal of Mathematics, 171: 93–110, doi:10.1007/s11856-009-0042-9, MR 2520103
- Kac, Mark (1959), Statistical Independence in Probability, Analysis and Number Theory, Carus Mathematical Monographs, 12, New York: John Wiley & Sons for the Mathematical Association of America, pp. 2–3, MR 0110114
- Pollen, David (1992), "Daubechies' scaling function on [0,3]", Wavelets, Wavelet Analysis and Its Applications, 2, Boston, Massachusetts: Academic Press, pp. 3–13, MR 1161245
- Bajnok, Béla (2013), An Invitation to Abstract Mathematics, Undergraduate Texts in Mathematics, New York: Springer, p. 186, doi:10.1007/978-1-4614-6636-9, ISBN 978-1-4614-6635-2
- In the notation of Estes and Ohm for rings that are both subrings of and overrings of , the dyadic rationals are the ring . See section 7 of Estes, Dennis; Ohm, Jack (1967), "Stable range in commutative rings" (PDF), Journal of Algebra, 7 (3): 343–362, doi:10.1016/0021-8693(67)90075-0, MR 0217052
- Lucyshyn-Wright, Rory B. B. (2018), "Convex spaces, affine spaces, and commutants for algebraic theories", Applied Categorical Structures, 26 (2): 369–400, arXiv:1603.03351, doi:10.1007/s10485-017-9496-9, MR 3770912, S2CID 3743682
- Manners, Freddie (2015), "A solution to the pyjama problem", Inventiones Mathematicae, 202 (1): 239–270, arXiv:1305.1514, doi:10.1007/s00222-014-0571-7, MR 3402799, S2CID 119148680; see section 6.2.1, "A model case: ", pp. 255–257.
- Robert, Alain M. (2000), "5.4 Fractional and integral parts of -adic numbers", A Course in -adic Analysis, Graduate Texts in Mathematics, 198, New York: Springer-Verlag, pp. 40–43, doi:10.1007/978-1-4757-3254-2, ISBN 0-387-98669-3, MR 1760253
- de Cornulier, Yves; Guyot, Luc; Pitsch, Wolfgang (2007), "On the isolated points in the space of groups" (PDF), Journal of Algebra, 307 (1): 254–277, arXiv:math/0511714, doi:10.1016/j.jalgebra.2006.02.012, MR 2278053, S2CID 11566447
- Nadler, S. B. Jr. (1973), "The indecomposability of the dyadic solenoid", The American Mathematical Monthly, 80 (6): 677–679, doi:10.2307/2319174, JSTOR 2319174
- Bhattacharjee, Meenaxi; Macpherson, Dugald; Möller, Rögnvaldur G.; Neumann, Peter M. (1997), "Rational numbers", Notes on Infinite Permutation Groups, Texts and Readings in Mathematics, 12, Berlin: Springer-Verlag, pp. 77–86, doi:10.1007/978-93-80250-91-5_9, ISBN 81-85931-13-5, MR 1632579
- Girgensohn, Roland (1996), "Constructing singular functions via Farey fractions", Journal of Mathematical Analysis and Applications, 203 (1): 127–141, doi:10.1006/jmaa.1996.0370, MR 1412484
- Cvitanović, Predrag; Gunaratne, Gemunu H.; Procaccia, Itamar (1988), "Topological and metric properties of Hénon-type strange attractors", Physical Review A, Third Series, 38 (3): 1503–1520, doi:10.1103/PhysRevA.38.1503, MR 0970237, PMID 9900529
- Brin, Matthew G. (1999), "The ubiquity of Thompson's group F in groups of piecewise linear homeomorphisms of the unit interval", Journal of the London Mathematical Society, Second Series, 60 (2): 449–460, arXiv:math/9705205, doi:10.1112/S0024610799007905, MR 1724861, S2CID 14490692
- Cannon, J. W.; Floyd, W. J. (2011), "What is … Thompson's group?" (PDF), Notices of the American Mathematical Society, 58 (8): 1112–1113, MR 2856142
- Fernandes, António M.; Ferreira, Fernando (2005), "Basic applications of weak König's lemma in feasible analysis" (PDF), Reverse Mathematics 2001, Lecture Notes in Logic, 21, La Jolla, California: Association for Symbolic Logic, pp. 175–188, MR 2185433
- Conway, J. H. (2001), On Numbers and Games (Second ed.), Natick, Massachusetts: A K Peters, ISBN 1-56881-127-6, MR 1803095; for the dyadic rationals, see "The numbers , , , , and so on", pp. 10–12
- Mauldon, J. G. (1978), "Num, a variant of Nim with no first-player win", The American Mathematical Monthly, 85 (7): 575–578, doi:10.2307/2320870, JSTOR 2320870, MR 0503877
- Flanigan, J. A. (1982), "A complete analysis of black-white Hackendot", International Journal of Game Theory, 11 (1): 21–25, doi:10.1007/BF01771244, MR 0665515, S2CID 119964871
- Erickson, Jeff; Nivasch, Gabriel; Xu, Junyan (June 2021), "Fusible numbers and Peano arithmetic", Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021), IEEE, pp. 1–13, arXiv:2003.14342, doi:10.1109/lics52264.2021.9470703, S2CID 214727767
- Sloane, N. J. A. (ed.), "Sequence A188545", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation