Ma · Mathematics

Find the Infimum and Supremum of the Set

Published By the 9to5Science editorial team

At a glance

  1. 1. Split by parity

    For even n, the sign term is 1; for odd n, it is −1.

  2. 2. Bound each case

    The even case gives values from just above 1 through 2; the odd case gives values above −1.

  3. 3. Check attainment

    The set includes −1, and the even case reaches 2 when m equals 1.

Let

S={(−1)n+1m:n∈N, m∈{1,2,3,…}}∪{−1}.S=\left\{(-1)^n+\frac{1}{m}: n\in\mathbb{N},\ m\in\{1,2,3,\ldots\}\right\}\cup\{-1\}.

Thus mm ranges over the positive integers, while nn ranges over the natural numbers. The key is to split the expression according to whether nn is even or odd. That determines the sign of (−1)n(-1)^n and makes the bounds visible.

For this set, both the infimum and supremum are actually elements of the set: the infimum is −1-1, and the supremum is 22. Here is how to verify the bounds and check that each is attained.

Separate the even and odd cases

If nn is even, then (−1)n=1(-1)^n=1, so the expression becomes

1+1m.1+\frac{1}{m}.

As mm ranges over the positive integers, these values are 2,3/2,4/3,5/4,…2, 3/2, 4/3, 5/4,\ldots. Each is greater than 11, and the largest is 22, obtained at m=1m=1.

If nn is odd, then (−1)n=−1(-1)^n=-1, and the expression becomes

−1+1m.-1+\frac{1}{m}.

For positive mm, these values are 0,−1/2,−2/3,−3/4,…0,-1/2,-2/3,-3/4,\ldots. Each is greater than −1-1, and the values approach −1-1 as mm grows. The set also includes −1-1 explicitly, through the separate term {−1}\{-1\}.

Thus the set consists of the values from these two cases together with the explicitly included point −1-1.

Verify the infimum

For every positive integer mm, 1/m>01/m>0. Therefore, in the odd case,

−1+1m>−1.-1+\frac{1}{m}>-1.

In the even case, 1+1/m>11+1/m>1, so those values are also greater than −1-1. The additional element −1-1 is a lower bound for the whole set and belongs to the set itself. Hence it is the least element, and therefore also the infimum:

inf⁡S=−1.\inf S=-1.

The fact that the odd-case values approach −1-1 is consistent with this result, but it is not needed to establish the infimum once we know that −1-1 is included and every other value is at least −1-1.

Verify the supremum

For even nn, the expression is 1+1/m1+1/m. Since m≥1m\geq 1, we have 1/m≤11/m\leq 1, and so

1+1m≤2.1+\frac{1}{m}\leq 2.

For odd nn, the expression −1+1/m-1+1/m is at most 00, so it is also less than 22. The extra element −1-1 is less than 22 as well. Thus 22 is an upper bound for the set.

To show that it is the least upper bound, check whether the set reaches it. Taking m=1m=1 and any even nn gives

(−1)n+1m=1+1=2.(-1)^n+\frac{1}{m}=1+1=2.

So 22 belongs to the set. It is the maximum, and therefore the supremum:

sup⁡S=2.\sup S=2.

A few values as a check

Taking n=1n=1 (odd) and n=2n=2 (even), and using m=1,2,3m=1,2,3, gives:

Parity of nnm=1m=1m=2m=2m=3m=3
Odd00−1/2-1/2−2/3-2/3
Even223/23/24/34/3

These values show both the descending odd-case values and the even-case values that start at 22. The separate −1-1 in the definition lies below all the listed values.

Common mistakes

  • Ignoring the parity of nn. The term (−1)n(-1)^n is not always 11 or always −1-1; both cases occur as nn varies.
  • Forgetting the explicitly included −1-1. The odd-case values approach −1-1 from above, but do not equal it for any positive mm. The separate element makes −1-1 part of the set.
  • Assuming the supremum is not attained. Although some sequences of values approach a bound without reaching it, here m=1m=1 in the even case gives 22 exactly.
  • Confusing an infimum or supremum with a minimum or maximum. In this example both bounds are attained: −1-1 is the minimum and 22 is the maximum. In other sets, a bound need not belong to the set.

If a text defines N\mathbb{N} to include 00, the expression 1/m1/m still requires m≠0m\ne 0. Interpreting mm as a positive integer gives the same result under either convention for whether 00 belongs to N\mathbb{N}, because both even and odd values of nn occur.

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.