TheoremBase

Construction of the Integers: Pairs of Natural Numbers up to Equal Differences, with Sum, Product, Negation and Order

Pairs (a, b) of natural numbers, thought of as a − b, with (a, b) ~ (c, d) when a + d = b + c, form an equivalence relation; on the classes [a, b] there are unique sum, product, negation and order given by the usual formulas.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let P=N×NP=\mathbb{N}\times\mathbb{N} and let ∼\sim be the relation on PP with (a,b)∼(c,d)(a,b)\sim(c,d) if and only if a+d=b+ca+d=b+c, for all a,b,c,d∈Na,b,c,d\in\mathbb{N}, given by Maps and Relations Given by Formulas §relation.

∼\sim is an equivalence relation on PP. Write P/∼P/{\sim} for the quotient and [a,b][a,b] for the class of (a,b)(a,b).

P/∼P/{\sim} is a set whose elements are exactly the classes [a,b][a,b] with a,b∈Na,b\in\mathbb{N}, and for all a,b,c,d∈Na,b,c,d\in\mathbb{N}, [a,b]=[c,d][a,b]=[c,d] if and only if a+d=b+ca+d=b+c.

There are unique binary operations ++ and ⋅\cdot on P/∼P/{\sim}, a unique map x↦−xx\mapsto-x from P/∼P/{\sim} to itself and a unique relation ≤\le on P/∼P/{\sim} such that, for all a,b,c,d∈Na,b,c,d\in\mathbb{N},

[a,b]+[c,d]=[a+c,b+d],[a,b]⋅[c,d]=[ac+bd,ad+bc],−[a,b]=[b,a],[a,b]≤[c,d]  ⟺  a+d≤b+c.[a,b]+[c,d]=[a+c,b+d],\quad[a,b]\cdot[c,d]=[ac+bd,ad+bc],\quad-[a,b]=[b,a],\quad[a,b]\le[c,d]\iff a+d\le b+c.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…