Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

2.3: Integers and Rationals

( \newcommand{\kernel}{\mathrm{null}\,}\)

All natural elements of a field F, their additive inverses, and 0 are called the integral elements of F, briefly integers.

An element xF is said to be rational iff x=pq for some integers p and q (q0);x is irrational iff it is not rational.

We denote by J the set of all integers, and by R the set of all rationals, in F. Every integer p is also a rational since p can be written as p/q with q=1
Thus

RJN

In an ordered field,

N={xJ|x>0}.(Why?)

Theorem 2.3.1

If a and b are integers (or rationals) in F, so are a+b and ab.

Proof

For integers, this follows from Examples (a) and (d) in Section 2; one only has to distinguish three cases:

(i) a,bN;

(ii) aN,bN;

(iii) aN,bN.

The details are left to the reader (see Basic Concepts of Mathematics, Chapter 2,§7, Theorem 1).

Now let a and b be rationals, say,

a=pq and b=rs

where qs0; and qs and pr are integers by the first part of the proof (since p,q,r,sJ).

a±b=ps±qrqs and ab=prqs

where qs0; and qs and pr are integers by the first part of the proof (since p,q,r,sJ).

Thus a±b and ab are fractions with integral numerators and denominators. Hence, by definition, a±bR and abR.

Theorem 2.3.2

In any field F, the set R of all rationals is a field itself, under the operations defined in F, with the same neutral elements 0 and 1. Moreover, R is an ordered field if F is. (We call R the rational subfield of F.)

Proof

We have to check that R satisfies the field axioms.

The closure law 1 follows from Theorem 1.

Axioms 2, 3, and 6 hold for rationals because they hold for all elements of F; similarly for Axioms 7 to 9 if F is ordered.

Axiom 4 holds in R because the neutral elements 0 and 1 belong to R; indeed, they are integers, hence certainly rationals.

To verify Axiom 5, we must show that x and x1 belong to R if x does. If, however,

x=pq(p,qJ,q0)

then

x=pq

where again pJ by the definition of J; thus xR.

If, in addition, x0, then p0, and

x=pq implies x1=qp.(Why?)

Thus x1R.

Note. The representation

x=pq(p,qJ)

is not unique in general; in an ordered field, however, we can always choose q>0, i.e., qN( take p0 if x0).

Among all such q there is a least one by Theorem 2 of $856. If x=p/q, with this minimal qN, we say that the rational x is given in lowest terms.


This page titled 2.3: Integers and Rationals is shared under a CC BY 3.0 license and was authored, remixed, and/or curated by Elias Zakon (The Trilla Group (support by Saylor Foundation)) via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?