Completeness Axiom

Let AA be a non empty subset of R\mathbb{R}.

  • uu is the upper bound of AA if: ∀a∈A;a≤u\forall a\in A;a\le u
  • AA is bounded above if AA has an upper bound
  • Maximum element of AA
    max⁡A=u\max{A} = u if u∈Au\in A and uu is an upper bound of AA
  • Supremum of AA
    sup⁡A\sup{A}, is the smallest upper bound of AA
  • Maximum is a supremum. Supremum is not necessarily a maximum.
  • ll is the lower bound of AA if: ∀a∈A;a≥l\forall a\in A;a\ge l
  • AA is bounded below if AA has a lower bound
  • Minimum element of AA
    min⁡A=l\min{A} = l if l∈Al\in A and ll is a lower bound of AA
  • Infimum of AA
    inf⁡A\inf{A}, is the largest lower bound of AA
  • Minimum is a infimum. Infimum is not necessarily a minimum.

Supremum and Infimum Criteria

Let AA be a non empty subset of R\mathbb{R}.

  • Say uu is an upper bound of AA. Then u=sup⁡Au= \sup A iff: ∀ϵ>0  ∃a∈A;  a+ϵ>u\forall \epsilon \gt 0\;\exists a \in A;\;a + \epsilon \gt u
  • Say ll is a lower bound of AA. Then l=inf⁡Al= \inf A iff: ∀ϵ>0  ∃a∈A;  a−ϵ<l\forall \epsilon \gt 0\;\exists a \in A;\;a - \epsilon \lt l

Required Proofs

  • sup⁡(a,b)=b\sup(a,b)=b
  • inf⁡(a,b)=a\inf(a,b)=a

Completeness Property

A set AA is said to have the completeness property iff every non-empty subset of AA:

  • Which is bounded below has a infimum in AA
  • Which is bounded above has a supremum in AA

Both R,Z\mathbb{R}, \mathbb{Z} have the completeness property. Q\mathbb{Q} doesn’t.

In addition to that:

  • Every non empty subset of Z\mathbb{Z} which is bounded above has a maximum
  • Every non empty subset of Z\mathbb{Z} which is bounded below has a minimum
Written by October 19, 2026 2 min read
Was this helpful?