Skip to content

Is 1 Equal to 0.999…? Fixing the Meaning of an Infinite Decimal First

Raw
  • The question “is 0.9990.999\ldots equal to 11?” is not yet a mathematical question. We must first decide what the symbol 0.9990.999\ldots denotes.
  • The standard decision is: it denotes the supremum (equivalently, the limit) of the sequence of finite decimals 0.9, 0.99, 0.999, 0.9,\ 0.99,\ 0.999,\ \ldots. Under this convention 0.999=10.999\ldots = 1 can be proved. Not an approximation, not a convenience — an equality.
  • The three famous arguments (multiplying 1/31/3 by 33; multiplying by 1010 and subtracting; examining the supremum of the partial sums straight from the definition) all reach the correct conclusion, but they rest on different hidden assumptions. Bringing those assumptions into the open is the main purpose of this article.
  • Intuition rebels for three main reasons: confusing the process of approaching indefinitely with the value reached; believing there is a “last digit”; and believing that different notation must mean a different number.
  • What settles the matter is the Archimedean property of the reals (there is no positive number smaller than every positive number). We separate the slogan “the reals have no gaps” into density, completeness and the Archimedean property.

One of the most reliably reproduced mathematical disputes on the internet is this one.

Is 0.9990.999\ldots (with infinitely many 99s) equal to 11, or is it “indefinitely close to 11 but not 11”?

There is a reason this argument survives year after year: neither side states what the symbol 0.9990.999\ldots means before arguing about it. Disputing whether two things are equal, when one of the symbols has been given no meaning, cannot be settled. It is like arguing over whether the fruit is delicious without saying which fruit.

What separates mathematics from ordinary argument is that at exactly this point it stops and says: let us first fix what the words mean. What happens when one sets off without a definition appears in the same shape in Why you must not divide by zero. There, fixing what division is (division as the inverse of multiplication(Definition 2.1)[Why You Cannot Divide by Zero]) shows that dividing by 00 cannot be defined (a nonzero number cannot be divided by 0(Proposition 3.2)[Why You Cannot Divide by Zero]); here, fixing what an infinite decimal is lets us prove an equality. The directions are opposite, but the move is the same.

What is interesting is that even after the meaning has been fixed and the proof read to the end, many people say “I follow it in my head, but it does not sit right.” That discomfort is itself worth observing. Research in mathematics education studies the gap between the mental picture a person carries (the concept image) and the formal definition (the concept definition), and 0.9990.999\ldots has served as the standard illustration of that gap for limits (the 1981 paper of Tall and Vinner; see the references). As an experience of betrayed intuition it belongs with the Monty Hall problem (switching wins with probability 2/3(Theorem 3.2)[The Monty Hall Problem]), right down to the resistance that persists after one has been told the answer.

The article proceeds as follows. We fix the meaning of the symbol (Section 2), carry the three arguments to completion (Section 3), take apart the reasons intuition rebels (Section 4), and finally identify what the phrase “the reals have no gaps” really refers to (Sections 5 and 6).

2. Preliminaries: what does the symbol 0.999… denote?

Section titled “2. Preliminaries: what does the symbol 0.999… denote?”

We begin with finite decimals, where nobody objects.

Definition 2.1Value of a finite decimal

Let a1,a2,,ana_1, a_2, \ldots, a_n be integers between 00 and 99. The symbol 0.a1a2an0.a_1a_2\cdots a_n is agreed to denote the finite sum

k=1nak10k.\sum_{k=1}^{n} a_k \cdot 10^{-k}.

This is mere shorthand. Here 0.9990.999 means 9/10+9/100+9/10009/10 + 9/100 + 9/1000, which computes to 999/1000999/1000. Only finitely many additions occur, so nothing new has happened.

The trouble starts when the 99s never stop. Adding infinitely many numbers is an operation that has not yet been defined. Addition is an operation on two numbers, extended inductively to finitely many. An infinite sum does not exist until we define it. Skip this step, say “the thing you get by adding infinitely many”, and the argument is left hanging in mid-air. (For the general convention that defines an infinite sum as the limit of the partial sums, see the definition of the sum of an infinite series(Definition 2.1)[Euler and Ramanujan].)

So we decree the value of an infinite decimal as follows.

Definition 2.2Value of an infinite decimal

For each k=1,2,3,k = 1, 2, 3, \ldots let aka_k be an integer between 00 and 99. Put the nn-th partial sum

sn=k=1nak10k.s_n = \sum_{k=1}^{n} a_k \cdot 10^{-k}.

The value of the symbol 0.a1a2a30.a_1a_2a_3\cdots is the supremum supS\sup S of the set S={s1,s2,s3,}S = \{s_1, s_2, s_3, \ldots\}, that is, the least of the upper bounds of SS.

For this definition to mean anything, supS\sup S must exist as a real number. What guarantees it is the continuity axiom (existence of suprema) for the reals. The set SS is bounded above by 11 (since snk=1n910k<1s_n \le \sum_{k=1}^n 9 \cdot 10^{-k} < 1) and is nonempty, so the supremum exists. In a world containing only rationals a supremum need not exist (the set {xQ:x2<2}\{x \in \mathbb{Q} : x^2 < 2\} has no rational supremum), so this step genuinely uses a property of the reals.

Remark 2.3

Since s1s2s3s_1 \le s_2 \le s_3 \le \cdots is increasing, supS\sup S coincides with the limit limnsn\lim_{n \to \infty} s_n of the sequence (sn)(s_n). Hence Definition 2.2 may equally be phrased as “the limit of the partial sums”, and below we use whichever form is convenient. Recall the definition of the limit: we write limsn=L\lim s_n = L when for every ε>0\varepsilon > 0 there is an index NN such that nNn \ge N implies snL<ε|s_n - L| < \varepsilon.

3. Carrying the three arguments to completion

Section titled “3. Carrying the three arguments to completion”

First we settle the computation on the side of finite decimals.

Proposition 3.1The finite decimal with n nines

Let n1n \ge 1 be an integer and let sn=0.999n niness_n = \underbrace{0.99\cdots 9}_{n \text{ nines}}, that is, sn=k=1n910ks_n = \sum_{k=1}^{n} 9 \cdot 10^{-k}. Then

sn=110n.s_n = 1 - 10^{-n}.
Proof(Proposition 3.1)

We use the identity (x1)(xn1+xn2++x+1)=xn1(x - 1)(x^{n-1} + x^{n-2} + \cdots + x + 1) = x^{n} - 1. Expanding the left-hand side gives xn+xn1++xx^n + x^{n-1} + \cdots + x minus xn1++x+1x^{n-1} + \cdots + x + 1; every intermediate term cancels and xn1x^n - 1 remains. Substituting x=10x = 10,

9(10n1+10n2++10+1)=10n1.9 \cdot (10^{n-1} + 10^{n-2} + \cdots + 10 + 1) = 10^{n} - 1.

Dividing both sides by 10n10^{n}, the left-hand side becomes

9(101+102++10n)=k=1n910k=sn9 \cdot (10^{-1} + 10^{-2} + \cdots + 10^{-n}) = \sum_{k=1}^{n} 9 \cdot 10^{-k} = s_n

(by Definition 2.1), while the right-hand side is (10n1)/10n=110n(10^n - 1)/10^n = 1 - 10^{-n}. Hence sn=110ns_n = 1 - 10^{-n}.

Let us check a case. For n=3n = 3 we have s3=0.999s_3 = 0.999, and 1103=10.001=0.9991 - 10^{-3} = 1 - 0.001 = 0.999. Correct. The formula reads: “however many 99s you write down, a gap of exactly 10n10^{-n} from 11 remains.” The gap does remain — as long as there are finitely many.

3.1. Argument 1: multiply 1/31/3 by 33

Section titled “3.1. Argument 1: multiply 1/31/31/3 by 333”

This is the one seen most often.

Proposition 3.2Consequence of the expansion of 1/3

If 0.333=1/30.333\ldots = 1/3 (with infinitely many 33s), then 0.999=10.999\ldots = 1.

Proof(Proposition 3.2)

Put tn=0.333n threest_n = \underbrace{0.33\cdots 3}_{n \text{ threes}}. Dividing the computation of Proposition 3.1 by 33 gives tn=sn/3=(110n)/3t_n = s_n / 3 = (1 - 10^{-n})/3. By hypothesis limntn=1/3\lim_{n\to\infty} t_n = 1/3.

On the other hand sn=3tns_n = 3 t_n, so using the fact that limits commute with multiplication by a constant (limctn=climtn\lim c\,t_n = c \lim t_n),

limnsn=limn3tn=313=1.\lim_{n \to \infty} s_n = \lim_{n \to \infty} 3 t_n = 3 \cdot \frac{1}{3} = 1.

By Remark 2.3 this limit is the value of 0.9990.999\ldots, so 0.999=10.999\ldots = 1.

Remark 3.3

The argument is correct, but one should be careful about where its persuasive force comes from. The equality 0.333=1/30.333\ldots = 1/3 is an assertion of exactly the same kind as 0.999=10.999\ldots = 1 (both say that the value of an infinite decimal is exactly equal to a certain rational). So this is an argument for consistency — if you accept one, accept the other — and not a proof from nothing. If 1/31/3 feels safer because long division makes it convincing, that only reflects familiarity with the long-division procedure; logically both stand on the same cliff. As a proof, its entire content is the single fact that limits commute with multiplication by a constant.

3.2. Argument 2: multiply by 1010 and subtract

Section titled “3.2. Argument 2: multiply by 101010 and subtract”

The next most famous runs: put x=0.999x = 0.999\ldots; then 10x=9.99910x = 9.999\ldots, so 10xx=910x - x = 9 and hence x=1x = 1. Three lines. It is fast, but it silently uses the claim that multiplying by 1010 leaves the fractional part in exactly the same shape. Filling in that step gives the following.

Proposition 3.4The digit-shift argument

If x=0.999x = 0.999\ldots is defined in the sense of Definition 2.2, then 10x=9+x10x = 9 + x. Consequently x=1x = 1.

Proof(Proposition 3.4)

For sn=110ns_n = 1 - 10^{-n} (Proposition 3.1) and n2n \ge 2 we have

10sn=10(110n)=1010(n1)=9+(110(n1))=9+sn1.10 s_n = 10(1 - 10^{-n}) = 10 - 10^{-(n-1)} = 9 + \bigl(1 - 10^{-(n-1)}\bigr) = 9 + s_{n-1}.

All that was used here is the exponent law 1010n=10(n1)10 \cdot 10^{-n} = 10^{-(n-1)} together with Proposition 3.1 applied to n1n-1. The identity is the formulaic expression of the obvious fact that multiplying 0.9990.99\cdots9 (nn nines) by 1010 produces 9.9999.99\cdots9 (with n1n-1 nines after the point).

Now let nn \to \infty on both sides. By Remark 2.3 we have limsn=x\lim s_n = x, and also limsn1=x\lim s_{n-1} = x (shifting the index by 11 does not change the limit). Limits are preserved by multiplication by a constant and by addition, so the left-hand side converges to 10x10x and the right-hand side to 9+x9 + x. Limits are unique, so 10x=9+x10x = 9 + x, that is 9x=99x = 9 and x=1x = 1.

Remark 3.5

It is dangerous to read this argument as “long-division-style subtraction of two infinite decimals”. The same gesture applied to y=999y = \cdots 999 (an integer with infinitely many 99s to the left) gives 10y=990=y910y = \cdots 990 = y - 9 and hence y=1y = -1, which does not hold among the ordinary reals. If one runs the operations formally without first checking that the limit exists, false conclusions arrive without complaint. In the sense that slipping in one undefined operation can wreck a conclusion arbitrarily, this is the same pattern as the fake proof of 1=21 = 2 that conceals a division by 00 (the fake proof of 1 = 2(Example 4.4)[Why You Cannot Divide by Zero]). The proof above is valid because Definition 2.2 has already guaranteed that xx is an existing real number. Incidentally, there is a number system in which 999=1\cdots 999 = -1 genuinely holds; we come to it in Section 6.

3.3. Argument 3: go straight to the definition

Section titled “3.3. Argument 3: go straight to the definition”

The two preceding arguments manipulated 0.9990.999\ldots after granting that it exists as a real number. Working straight from the definition gives the following, which is the argument that matters. As preparation we set up one tool, which is also the protagonist of Section 5.

Lemma 3.6Archimedean principle (version for powers of 10)

For every real ε>0\varepsilon > 0 there is a natural number nn with 10n<ε10^{-n} < \varepsilon.

Proof(Lemma 3.6)

First we show 10n1+9n10^{n} \ge 1 + 9n for every natural number nn. For n=1n = 1 this reads 101010 \ge 10, which holds. Assuming it for nn,

10n+1=1010n10(1+9n)=10+90n10+9n=1+9(n+1)10^{n+1} = 10 \cdot 10^{n} \ge 10(1 + 9n) = 10 + 90n \ge 10 + 9n = 1 + 9(n+1)

(the second inequality follows from 90n9n90n \ge 9n, i.e. from 81n081n \ge 0), so it holds for n+1n+1. By induction it holds for every nn.

Next apply the Archimedean property of the reals (for every real MM there is a natural number n>Mn > M) with M=1/(9ε)M = 1/(9\varepsilon), obtaining a natural number nn with n>1/(9ε)n > 1/(9\varepsilon). For this nn,

10n1+9n>9n>919ε=1ε10^{n} \ge 1 + 9n > 9n > 9 \cdot \frac{1}{9\varepsilon} = \frac{1}{\varepsilon}

(the leftmost inequality is the one just proved, the next uses 1>01 > 0, and the last is n>1/(9ε)n > 1/(9\varepsilon) multiplied by 99). Since 10n10^{n} and 1/ε1/\varepsilon are both positive, taking reciprocals reverses the inequality and yields 10n<ε10^{-n} < \varepsilon.

Theorem 3.70.999… = 1

Let sn=0.999n niness_n = \underbrace{0.99\cdots9}_{n \text{ nines}} and S={s1,s2,s3,}S = \{s_1, s_2, s_3, \ldots\}. If 0.999=supS0.999\ldots = \sup S in the sense of Definition 2.2, then

0.999=1.0.999\ldots = 1.
Proof(Theorem 3.7)

We verify in two steps that 11 is the least of the upper bounds.

Step 1: 11 is an upper bound for SS. By Proposition 3.1 we have sn=110ns_n = 1 - 10^{-n}, and 10n>010^{-n} > 0, so sn<1s_n < 1 for every nn. Hence 11 is an upper bound for SS.

Step 2: no number smaller than 11 can be an upper bound. Take any c<1c < 1 and put ε=1c>0\varepsilon = 1 - c > 0. By Lemma 3.6 there is a natural number nn with 10n<ε10^{-n} < \varepsilon. For this nn,

sn=110n>1ε=c,s_n = 1 - 10^{-n} > 1 - \varepsilon = c,

so we have found an element sns_n of SS exceeding cc. Hence cc is not an upper bound.

Step 1 shows 11 is an upper bound and Step 2 shows nothing below 11 is, so the least upper bound is 11. That is, supS=1\sup S = 1, i.e. 0.999=10.999\ldots = 1.

The shape of this proof is worth remembering. Showing “the supremum is LL” always takes two steps: that LL is an upper bound (nobody exceeds LL), and that for any value even slightly below LL there is an element reaching past it. Step 2 is precisely what makes 11 the borderline value.

Example 3.8Computing 0.4999… = 0.5 to the end

Put tn=0.4999n1 ninest_n = 0.4\underbrace{99\cdots9}_{n-1 \text{ nines}} for n2n \ge 2. Following the definition,

tn=410+k=2n910k=410+110j=1n1910j=410+110(110(n1))t_n = \frac{4}{10} + \sum_{k=2}^{n} 9 \cdot 10^{-k} = \frac{4}{10} + \frac{1}{10}\sum_{j=1}^{n-1} 9 \cdot 10^{-j} = \frac{4}{10} + \frac{1}{10}\bigl(1 - 10^{-(n-1)}\bigr)

(substituting k=j+1k = j+1 and applying Proposition 3.1 to n1n-1). Simplifying,

tn=0.4+0.110n=0.510n.t_n = 0.4 + 0.1 - 10^{-n} = 0.5 - 10^{-n}.

Exactly the same two-step argument as in the proof of Theorem 3.7 (0.50.5 is an upper bound; no c<0.5c < 0.5 can be one, by Lemma 3.6) gives sup{tn}=0.5\sup\{t_n\} = 0.5. So 0.4999=0.50.4999\ldots = 0.5. The equality 0.999=10.999\ldots = 1 is no special accident: the same thing happens for every nonzero finite decimal.

Example 3.9The same phenomenon in base two

Consider 0.111(2)0.111\ldots_{(2)} in base two. The partial sums are un=k=1n2ku_n = \sum_{k=1}^{n} 2^{-k}, and the same identity as in Proposition 3.1 (with x=2x = 2) gives un=(2n1)/2n=12nu_n = (2^n - 1)/2^n = 1 - 2^{-n}. Since 2n1+n2^{n} \ge 1 + n (induction: 222 \ge 2 for n=1n=1, and 2n+1=22n2+2n2+n2^{n+1} = 2\cdot 2^n \ge 2 + 2n \ge 2 + n), the quantity 2n2^{-n} becomes arbitrarily small, and exactly the same two-step argument as in Theorem 3.7 yields 0.111(2)=10.111\ldots_{(2)} = 1. The phenomenon is not caused by the base 1010. It is intrinsic to positional notation itself.

Example 3.10Converting a repeating decimal into a fraction

We compute 0.3636360.363636\ldots. Grouping two digits at a time, the partial sums are vn=k=1n36100kv_n = \sum_{k=1}^{n} 36 \cdot 100^{-k}. Putting x=100x = 100 in the identity (x1)(xn1++x+1)=xn1(x-1)(x^{n-1} + \cdots + x + 1) = x^n - 1 gives 99(100n1++1)=100n199(100^{n-1} + \cdots + 1) = 100^n - 1, so multiplying both sides by 36/(99100n)36/(99 \cdot 100^{n}) yields

vn=3699100n1100n=3699(1100n)=411(1100n).v_n = \frac{36}{99} \cdot \frac{100^n - 1}{100^n} = \frac{36}{99}\bigl(1 - 100^{-n}\bigr) = \frac{4}{11}\bigl(1 - 100^{-n}\bigr).

Since 100n10n100^{-n} \le 10^{-n}, Lemma 3.6 applies and sup{vn}=4/11\sup\{v_n\} = 4/11. Indeed 4÷11=0.36364 \div 11 = 0.3636\ldots, which is consistent. Every repeating decimal can be turned into a fraction by this procedure. Conversely, a non-repeating infinite decimal is irrational.

flowchart TD
A["Fix the meaning of the symbol 0.999…"] --> B["Sequence of partial sums 0.9, 0.99, 0.999, …"]
B --> C["Declare its supremum to be the value (existence of the supremum is the continuity axiom for the reals)"]
C --> D["Is the supremum 1?"]
D --> E["1 is an upper bound: every partial sum is below 1"]
D --> F["No number below 1 is an upper bound: Archimedean principle"]
E --> G["0.999… = 1"]
F --> G
The logical structure of 0.999… = 1. The stage where the definition is fixed is separate from the stage where something is proved

If three proofs still fail to convince, the trouble is not with the logic but with the mental picture. Let us take the common sticking points apart one at a time.

Sticking point 1: “approaching indefinitely” is a process, not a destination.

When we picture the sequence 0.9, 0.99, 0.999, 0.9,\ 0.99,\ 0.999,\ \ldots, we watch it the way we watch a film: we see the intermediate stages growing. In every frame of that film a gap from 11 remains (by Proposition 3.1, the gap at frame nn is exactly 10n10^{-n}). So it feels as though the gap never disappears.

That feeling is correct. And 0.9990.999\ldots is not any frame of that film. What Definition 2.2 specified is a single motionless number: the supremum of the whole set of frames. Confusing the film with the place the film is heading is what makes the conversation break down. It is the sequence that approaches indefinitely; the number 0.9990.999\ldots does not approach anything. Numbers do not move.

Sticking point 2: “there must be something after the last 99.”

One often sees the claim 10.999=0.00011 - 0.999\ldots = 0.000\ldots1. Let us read the symbol seriously. Positional notation is a rule assigning, to each natural number kk, the digit in the kk-th place (Definition 2.2). When one writes 0.00010.000\ldots1, in which place does the 11 sit?

If the answer is the mm-th place for a natural number mm, then the number is 10m10^{-m}, a positive number. But by Theorem 3.7 the difference is 00, so this is wrong. If the answer is “the very last place, which no natural number labels”, then positional notation contains no such place, because the set of natural numbers N={1,2,3,}\mathbb{N} = \{1, 2, 3, \ldots\} has no greatest element. In other words, the symbol 0.00010.000\ldots1 merely looks like a decimal; it denotes nothing.

Sticking point 3: “different notation must mean a different number.”

This belief runs deep. Nobody objects to 1/21/2, 2/42/4 and 3/63/6 being the same number, nor to 4\sqrt{4} and 22 being the same, because a name and the thing it names are different. Yet decimal notation alone somehow feels like the number itself. Presumably that is because decimals have been drilled into us as a computational tool since primary school.

In fact decimal notation is just one more kind of name. And numbers with two names really do exist: that is the theorem on double representations in Section 6.

00.910.90.9910.990.9991
No 'gap' comes into view however far we magnify. The band remaining at the right shrinks through 0.1, 0.01, 0.001, and becomes smaller than any positive width

5. What exactly does “the reals have no gaps” mean?

Section titled “5. What exactly does “the reals have no gaps” mean?”

One often hears that “in the reals there is no room between 0.9990.999\ldots and 11”. Three assertions of quite different character are mixed into this “no room”. Let us separate them.

Theorem 5.1Between two distinct reals there is another real

If real numbers a,ba, b satisfy a<ba < b, then there is a real number cc with a<c<ba < c < b. Indeed c=(a+b)/2c = (a+b)/2 satisfies the condition.

Proof(Theorem 5.1)

Put c=(a+b)/2c = (a+b)/2. Adding aa to both sides of a<ba < b gives 2a<a+b2a < a + b, and dividing by 22 gives a<ca < c. Likewise, adding bb to both sides of a<ba < b gives a+b<2ba + b < 2b, and dividing by 22 gives c<bc < b. Hence a<c<ba < c < b. All that was used is the compatibility of the order with the arithmetic operations (one may add the same number to both sides of an inequality, and divide by a positive number).

This property is called density. It yields an alternative proof of Theorem 3.7. If 0.999<10.999\ldots < 1, there would be a real cc between them. That cc would be larger than every sns_n (since sn0.999<cs_n \le 0.999\ldots < c) and smaller than 11. But Step 2 in the proof of Theorem 3.7 showed that no number below 11 can be an upper bound for SS. Contradiction. Hence the challenge “name a number in between” has no answer in principle.

But density alone is not enough. In fact the rationals alone are already dense (if a,ba, b are rational, so is (a+b)/2(a+b)/2). Even so the rationals have a hole where 2\sqrt{2} should be. Being dense and having no holes are different things.

What is really doing the work is the property behind Lemma 3.6.

Corollary 5.2There are no infinitesimals among the reals

No real number δ\delta satisfies ”δ>0\delta > 0 and δ<1/n\delta < 1/n for every natural number nn”.

Proof(Corollary 5.2)

Suppose such a δ>0\delta > 0 existed. Applying Lemma 3.6 with ε=δ\varepsilon = \delta, we obtain a natural number n0n_0 with 10n0<δ10^{-n_0} < \delta.

On the other hand N=10n0N = 10^{n_0} is itself a natural number, so the hypothesis ”δ<1/n\delta < 1/n for every natural number nn” may be applied with n=Nn = N, giving

δ<110n0=10n0.\delta < \frac{1}{10^{n_0}} = 10^{-n_0}.

Combined with 10n0<δ10^{-n_0} < \delta this gives δ<δ\delta < \delta, a contradiction. Hence no such δ\delta exists.

The cast is now complete. Let us tabulate the three properties.

PropertyContentRationals Q\mathbb{Q}Reals R\mathbb{R}Role in 0.999=10.999\ldots = 1
DensityBetween two distinct numbers lies anotherHoldsHoldsBlocks the objection “produce the number in between”
Archimedean propertyNo infinitesimals exist (Corollary 5.2)HoldsHoldsDecides the equality: nothing below 11 is an upper bound
CompletenessEvery set bounded above has a supremumFailsHoldsGives the symbol 0.9990.999\ldots a value

Remark 5.3

The point to take from the table is this. The equality 0.999=10.999\ldots = 1 itself actually holds within the rationals (both the partial sums and the limit are rational). Completeness is needed not for the proof of the equality but one step earlier, where we assert that a symbol with infinitely many 99s may be assigned a number at all. The explanation ”0.999=10.999\ldots = 1 because the reals are continuous” is therefore near the mark without hitting it. The Archimedean property decides the equality; completeness gives the symbol its meaning.

6. Is there a way out? Double representations and worlds with infinitesimals

Section titled “6. Is there a way out? Double representations and worlds with infinitesimals”

As Example 3.8 showed, 11 is not the only number with two representations. Exactly which numbers have them is completely determined.

Theorem 6.1Double representation of decimal expansions

Let xx be a real number with 0<x10 < x \le 1. Then xx has two or more distinct decimal expansions (representations of the form 0.a1a2a30.a_1a_2a_3\cdots, where for x=1x = 1 we also allow 1.0001.000\ldots) if and only if xx can be written as x=q/10kx = q/10^{k} with integers q1q \ge 1 and k0k \ge 0, that is, if and only if xx is a finite decimal. In that case there are exactly two representations, one ending in a repetition of 00 and the other in a repetition of 99.

Remark 6.2

The proof is placed in the Appendix. The skeleton of the argument is: find the first place where the two expansions disagree, then squeeze the value between bounds from both sides; the condition for equality forces one expansion to be 00 from there on and the other to be 99 from there on. Lemma 3.6 is used at exactly one point, in estimating the value of the expansion with the trailing 99s.

Remark 6.3

This duplication looks like an inconvenience, but it is actively exploited within mathematics. For instance, when the Cantor set is defined as “the set of numbers whose base-33 expansion contains no digit 11”, it is the double representation 1/3=0.1000(3)=0.0222(3)1/3 = 0.1000\ldots_{(3)} = 0.0222\ldots_{(3)} that makes 1/31/3 belong to the Cantor set after all. Ignore double representations and the definition breaks.

Can one then build a world in which 0.99910.999\ldots \ne 1? We describe two directions. Both are genuine mathematics, and neither is the escape route one hopes for.

Remark 6.4

Hyperreals (an ordered field with infinitesimals). One can extend the reals to a field R^{*}\mathbb{R} containing an infinitesimal δ\delta that is greater than 00 and smaller than every 1/n1/n. This does not contradict Corollary 5.2, because R^{*}\mathbb{R} is not Archimedean — it is a different system. There, numbers such as 1δ1 - \delta, “smaller than 11 by an infinitesimal”, genuinely exist.

But this does not make 0.99910.999\ldots \ne 1. As long as the symbol 0.9990.999\ldots means “a sequence of 99s indexed by the natural numbers 1,2,3,1, 2, 3, \ldots”, its partial sums are indexed by the standard natural numbers and the value is still 11. To create a difference one must extend the index set to an infinite hypernatural HH and consider the finite sum 110H1 - 10^{-H} with ”HH nines”. That is an operation replacing the meaning of the symbol, not a change in the value of the same symbol. A careful discussion of this point is the paper of Katz and Katz (see the references).

Remark 6.5

The 1010-adic numbers (relatives of the pp-adic numbers). The equality 999=1\cdots 999 = -1, which Remark 3.5 declared false among the reals, is a bona fide equality in the world of 1010-adic integers. There, the closeness of two numbers is measured by the highest power of 1010 dividing their difference: divisible by 1010 means close, divisible by 100100 means closer still. In this sense 999+1=000=0\cdots 999 + 1 = \cdots 000 = 0, so indeed 999=1\cdots 999 = -1.

What happens here concerns 99s extending infinitely to the left, whereas our 0.9990.999\ldots extends to the right. That changing the measure of closeness reverses which direction of infinitely many digits carries meaning is a phenomenon worth remembering. There is not one number system: the world is fixed the moment we decide what “close” shall mean.

In the end, to make 0.99910.999\ldots \ne 1 one must either abandon the reals or replace the meaning of the symbol. And whichever one chooses, the naive image of “a number indefinitely close to 11 but not equal to 11” is not thereby realised. This sensation — that defending intuition turns out to cost far more than expected — is precisely the theme of Why mathematics is hard, an instance of the barrier of abstraction(Definition 3.1)[Why Mathematics Is Hard].

Exercise 7.1Easy

Show that 7.999=87.999\ldots = 8 by writing out the sequence of partial sums.

Solution

The nn-th partial sum is wn=7+0.999n ninesw_n = 7 + \underbrace{0.99\cdots9}_{n \text{ nines}}. By Proposition 3.1,

wn=7+(110n)=810n.w_n = 7 + (1 - 10^{-n}) = 8 - 10^{-n}.

Since 10n>010^{-n} > 0 we have wn<8w_n < 8 for every nn, so 88 is an upper bound. Next let c<8c < 8 and put ε=8c>0\varepsilon = 8 - c > 0. By Lemma 3.6 there is an nn with 10n<ε10^{-n} < \varepsilon, and for that nn we get wn=810n>8ε=cw_n = 8 - 10^{-n} > 8 - \varepsilon = c, so cc is not an upper bound. Hence the least upper bound is 88, and 7.999=87.999\ldots = 8 in the sense of Definition 2.2.

Exercise 7.2Standard

Express 0.12343434340.1234343434\ldots (with 3434 repeating from the third decimal place onwards) as a fraction in lowest terms.

Solution

We split off the non-repeating head from the repeating part:

x=0.12+0.00343434=12100+1100×0.343434x = 0.12 + 0.00343434\ldots = \frac{12}{100} + \frac{1}{100} \times 0.343434\ldots

(in the second term, instead of shifting the decimal point of the repeating part two places back to the right, we multiply by 1/1001/100). Carrying out exactly the same computation as in Example 3.10 with numerator 3434, the partial sums are 3499(1100n)\frac{34}{99}(1 - 100^{-n}) and their supremum is 34/9934/99. Hence

x=12100+11003499=12100+349900=11889900+349900=12229900=6114950.x = \frac{12}{100} + \frac{1}{100}\cdot\frac{34}{99} = \frac{12}{100} + \frac{34}{9900} = \frac{1188}{9900} + \frac{34}{9900} = \frac{1222}{9900} = \frac{611}{4950}.

We check that this is in lowest terms: 611=13×47611 = 13 \times 47 and 4950=2×32×52×114950 = 2 \times 3^2 \times 5^2 \times 11 have no common prime factor, so 611/4950611/4950 is reduced. As a check, long division of 611611 by 49504950 gives 0.1234340.123434\ldots, which agrees.

Exercise 7.3Standard

Let sn=110ns_n = 1 - 10^{-n}. For an arbitrary ε>0\varepsilon > 0, give a formula in ε\varepsilon for an NN such that nNn \ge N implies 1sn<ε1 - s_n < \varepsilon. Then find the smallest such NN for ε=106\varepsilon = 10^{-6} and for ε=1/2026\varepsilon = 1/2026.

Solution

Since 1sn=10n1 - s_n = 10^{-n}, the condition is 10n<ε10^{-n} < \varepsilon, that is 10n>1/ε10^{n} > 1/\varepsilon, which on taking common logarithms is equivalent to n>log10(1/ε)n > \log_{10}(1/\varepsilon). Hence it suffices to take

N=log10(1/ε)+1N = \lfloor \log_{10}(1/\varepsilon) \rfloor + 1

(where \lfloor \cdot \rfloor is the floor function). Because 10n10^{-n} is decreasing in nn, the condition persists for all nNn \ge N.

For ε=106\varepsilon = 10^{-6} the condition 10n>10610^{n} > 10^{6} is necessary and sufficient, and is equivalent to n7n \ge 7. So the smallest NN is 77. Indeed n=6n = 6 fails, since 106<10610^{-6} < 10^{-6} is false.

For ε=1/2026\varepsilon = 1/2026 the condition is 10n>202610^{n} > 2026. Since 103=1000<202610^{3} = 1000 < 2026 and 104=10000>202610^{4} = 10000 > 2026, the smallest NN is 44. In other words, already at 0.99990.9999 the gap from 11 is smaller than 1/20261/2026.

Exercise 7.4Hard

Examine the claim "10.999=0.00011 - 0.999\ldots = 0.000\ldots1". Explain what happens when one tries to interpret 0.00010.000\ldots1 seriously as an infinite decimal, in the light of Definition 2.2 and Corollary 5.2.

Solution

By Definition 2.2, an infinite decimal assigns to each natural number kk a digit aka_k in the kk-th place. When one writes 0.00010.000\ldots1, let mm be the position where the digit 11 sits. There are two possibilities.

(i) mm is a natural number. Then am=1a_m = 1 and all other digits are 00, so the partial sums are 00 for n<mn < m and 10m10^{-m} for nmn \ge m, and the supremum is 10m10^{-m}. This is a positive number. But by Theorem 3.7 we have 10.999=01 - 0.999\ldots = 0, so 10m=010^{-m} = 0, a contradiction (since 10m>010^{-m} > 0).

(ii) mm lies “after every natural number”. No such place exists in the framework of Definition 2.2, since we decided that positions of digits are labelled by natural numbers. As N\mathbb{N} has no greatest element, “the place after the last one” lies outside the notation.

If one forcibly introduced a number δ\delta realising (ii), then δ\delta would have to satisfy 0<δ<10m0 < \delta < 10^{-m} for every mm, and by Corollary 5.2 no such real number exists. So 0.00010.000\ldots1 is a symbol denoting nothing within the reals. Adopting a system with infinitesimals outside the reals (Remark 6.4) does let δ\delta itself exist, but even then the value of 0.9990.999\ldots remains 11, and the difference does not become δ\delta.

  • Takagi Teiji, Kaiseki Gairon (in Japanese), Iwanami Shoten — Chapter 1 (continuity of the reals and limits of sequences; the correspondence between infinite decimals and real numbers is treated there).
  • Sugiura Mitsuo, Kaiseki Nyūmon I (in Japanese), University of Tokyo Press, 1980 — Chapter I (the axioms for the reals, suprema and infima, the Archimedean principle).
  • W. Rudin, Principles of Mathematical Analysis, 3rd ed., McGraw-Hill, 1976 — Chapter 1 (The Real and Complex Number Systems; construction of the real field and the least-upper-bound property).
  • D. Tall and S. Vinner, “Concept image and concept definition in mathematics with particular reference to limits and continuity”, Educational Studies in Mathematics 12 (1981), 151–169. DOI: 10.1007/BF00305619
  • K. U. Katz and M. G. Katz, “When is .999… less than 1?”, The Montana Mathematics Enthusiast 7 (2010), 3–30. arXiv:1007.3018
  • F. Q. Gouvêa, p-adic Numbers: An Introduction, 3rd ed., Springer, 2020 — Chapters 1 and 3 (pp-adic measures of closeness, and expansions extending infinitely to the left).

Appendix: Proof of the theorem on double representations

Section titled “Appendix: Proof of the theorem on double representations”

Strategy. In Theorem 6.1 the hard direction is “two expansions imply a finite decimal”. We focus on the first place where the two expansions disagree and squeeze the value from above and below. The two bounds coincide, so all the inequalities must be equalities, and the shape of the digits is thereby determined.

Converse direction (a finite decimal has two expansions). Let x=0.a1a2akx = 0.a_1a_2\cdots a_k with ak0a_k \ne 0 and k1k \ge 1. The first expansion is a1a2ak000a_1 a_2 \cdots a_k 000\cdots. The second lowers the kk-th digit to ak1a_k - 1 and sets every subsequent digit to 99. Indeed, by the same computation as in Example 3.8, the contribution from the kk-th place onwards is

(ak1)10k+j>k910j=(ak1)10k+10k=ak10k,(a_k - 1)\cdot 10^{-k} + \sum_{j > k} 9 \cdot 10^{-j} = (a_k - 1) \cdot 10^{-k} + 10^{-k} = a_k \cdot 10^{-k},

so the value is unchanged (in the second equality we used that the value of the infinite string of 99s is 10k10^{-k}, that is, Theorem 3.7 multiplied by 10k10^{-k}). For x=1x = 1 the two corresponding expansions are 1.0001.000\ldots and 0.9990.999\ldots.

Forward direction (two expansions imply a finite decimal). Suppose (ak)(a_k) and (bk)(b_k) are two distinct expansions of the same xx. Being distinct, there is an index with ambma_m \ne b_m; let mm be the smallest such (every nonempty subset of the natural numbers has a least element). Swapping the names of the two expansions if necessary, we may assume am>bma_m > b_m, that is ambm+1a_m \ge b_m + 1 (digits are integers). Put P=k<mak10k=k<mbk10kP = \sum_{k < m} a_k 10^{-k} = \sum_{k<m} b_k 10^{-k} (the two agree by minimality of mm).

Lower bound from the (ak)(a_k) side. All terms are nonnegative, so

xP+am10mP+(bm+1)10m.x \ge P + a_m 10^{-m} \ge P + (b_m + 1) 10^{-m}.

Upper bound from the (bk)(b_k) side. Using bk9b_k \le 9,

xP+bm10m+k>m910k=P+bm10m+10m=P+(bm+1)10mx \le P + b_m 10^{-m} + \sum_{k > m} 9 \cdot 10^{-k} = P + b_m 10^{-m} + 10^{-m} = P + (b_m + 1)10^{-m}

(here we used Theorem 3.7 multiplied by 10m10^{-m}).

The upper and lower bounds coincide, so every inequality along the way is an equality. Reading off the conditions for equality, we obtain simultaneously:

  • am=bm+1a_m = b_m + 1;
  • on the (ak)(a_k) side the contribution of the terms with k>mk > m is 00, that is ak=0a_k = 0 for all k>mk > m;
  • on the (bk)(b_k) side, bk=9b_k = 9 for all k>mk > m.

In particular x=P+am10mx = P + a_m 10^{-m} is a finite decimal terminating at the mm-th place, so x=q/10mx = q/10^{m} with qq an integer. This proves that xx is a finite decimal, and at the same time that “the two expansions are exactly a 00-tailed and a 99-tailed pair”. The argument also shows that three or more expansions are impossible: any two of them must have the form above, so only the two candidates, 00-tailed and 99-tailed, are available.

Report an error in this article ・Operated by: Mugen Giken LLCPricingTermsLegal notice

© 2026 夢現技研合同会社 ・Feeding the text to an LLM is welcome. Code samples are MIT licensed.