Dyadic Rational¶
A rational number expressible as an integer divided by a power of two, equivalently a rational number with a terminating binary expansion.
Core Idea¶
A dyadic rational has the form a/2^b, where a is an integer and b is a nonnegative integer. After a fraction is reduced, this means that its denominator has no prime factor other than two. The same class is characterized by finite binary expansions, which explains its special role in binary computation and repeated-halving measurement systems.
Scope of Application¶
- Exact binary arithmetic. Finite binary formats represent a bounded subset of dyadic rationals exactly.
- Interval and computable analysis. Nested dyadic endpoints give exact, refinable enclosures for real quantities.
- Weights and measures. Repeated halving produces dyadic subdivisions such as halves, quarters, and eighths.
- Probability from random bits. Fixed-time generation has exact dyadic probabilities when a finite set of bit strings maps to outcomes.
Clarity¶
Membership can be checked in two equivalent ways: reduce the fraction and factor its denominator, or inspect whether the binary expansion terminates. This separates a value from a chosen notation—2/4 and ½ name the same dyadic number—and separates exact representation from rounding to a nearby dyadic grid point.
Manages Complexity¶
One denominator rule unifies arithmetic closure, finite binary notation, repeated-halving practice, and uniform approximation grids. It removes irrelevant differences among representations while preserving the crucial odd-prime boundary. The rule does not tell which dyadics a finite machine format can store; exponent and significand limits must be restored for that question.
Abstract Reasoning¶
- Reduce the rational number to lowest terms.
- Check whether the reduced denominator is 1 or a power of two.
- Translate to a finite binary expansion when a representation test is more useful.
- For arithmetic, use a common power-of-two denominator and reduce the result.
- Before division, inspect the divisor's numerator because it can introduce odd factors.
Knowledge Transfer¶
Dyadic reasoning transfers literally wherever quantities are integer multiples of powers of one-half: binary storage, halving measures, and dyadic partitions. A base-ten terminating decimal follows an analogous prime-factor rule but is not dyadic unless its reduced denominator is also a power of two. The cross-domain invariant is exact power-of-two subdivision, not merely the visual presence of a fraction.
Neighborhood in Abstraction Space¶
Dyadic Rational sits in a crowded region of the domain-specific corpus (34th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Number & Formal Language Properties (7 abstractions)
Nearest neighbors
- Achilles Number — 0.90
- Power Residue Symbol — 0.88
- Wagstaff Prime — 0.88
- Continued Fraction — 0.88
- Empty Sum — 0.88
Computed from structural-signature embeddings · 2026-10-08