You will find in the literature also another definition of bounded sets, which uses an absolute value $|\cdot|$. You should be aware that this is a technical tool mathematicians use to create the notion of "bounded sets" even for sets that cannot be ordered. Prominent examples of this kind are bounded sets of complex numbers. This tool is necessary because bounded sets allow many deep new insights into the topology of such sets. Otherwise, these deep insights would be not possible, simply because the underlying set is not ordered.

The tool of an absolute value serves the purpose because an absolute value is a function maps the unordered set to the ordered set of real numbers $(\mathbb R,+,\cdot),$ while preserving some important properties of the underlying unordered set.

Unfortunately, not all unordered sets have an absolute value. In fact, it is convenient to require the set to have a special algebraic structure, called a field. Although we are dealing right now with the set theory and algebra is another big branch of mathematics coming much "later" in BookofProofs, we make a small digression to an algebraic topic right now. We want to show that both definitions are equivalent if the underlying set is a field with absolute value defined on it.

# Definition: Bounded Subsets of Unordered Sets

Let $(F,+,\cdot)$ be a field with an absolute value $f:F\to\mathbb R$ defined on it. Let $S\subseteq F$ be its non-empty subset $S$ is said to be bounded if the image $f[S]$ is bounded in the set $\mathbb R$ of real numbers, i.e. if there is a positive real number $B$ such that $f(x)=|x|\le B$ for all $x\in S.$

### Notes

• The relation "$\le$" is the common order relation of real numbers.
• Unordered sets can have only "bounded" subsets, i.e. it does not make sense to distinguish between "bounded below" and "bounded above" subsets, like it was the case for ordered sets.

Definitions: 1

Github: ### References

#### Bibliography

1. Piotrowski, Andreas: Own Research, 2014