TheoremBase

Every integer between a and b lies between the integer parts of a and b, so the set is cut out of the image of a finite interval of integers.

Proof

The order of Z\mathbb{Z} read in R\mathbb{R}. For n,n′∈Zn,n'\in\mathbb{Z}: n≤n′n\le n' if and only if κ(j(n))≤κ(j(n′))\kappa(j(n))\le\kappa(j(n')). Indeed n≤n′n\le n' if and only if j(n)≤j(n′)j(n)\le j(n'), by The Rational Numbers Form an Archimedean Ordered Field Containing the Integers (ii). For u,v∈Qu,v\in\mathbb{Q}, u≤vu\le v means u<vu<v or u=vu=v, and likewise in R\mathbb{R}, << being the strict relation of a reflexive order (Partial and Total Orders on a Set and the Associated Strict Relation (iii)); if u<vu<v, then κ(u)<κ(v)\kappa(u)<\kappa(v), and if κ(u)<κ(v)\kappa(u)<\kappa(v), then u<vu<v, by The Rational Numbers Embed in Exactly One Way into Every Ordered Field (iv); and κ(u)=κ(v)\kappa(u)=\kappa(v) implies u=vu=v as κ\kappa is injective (The Rational Numbers Embed in Exactly One Way into Every Ordered Field (iii)). So u≤vu\le v if and only if κ(u)≤κ(v)\kappa(u)\le\kappa(v), and the claim follows with u=j(n)u=j(n) and v=j(n′)v=j(n').

A finite set of integers. Let p=⌊a⌋p=\lfloor a\rfloor and q=⌊b⌋q=\lfloor b\rfloor be the integer parts of aa and bb, integers, with κ(j(p))≤a\kappa(j(p))\le a by The Integer Part of a Real Number (i), an integer nn being read in R\mathbb{R} as κ(j(n))\kappa(j(n)) (The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (v)). Let S={n∈Z:p≤n≤q}S=\{n\in\mathbb{Z}:p\le n\le q\}, a subset of Z\mathbb{Z}. If p≤qp\le q, then SS is finite by The Number of Integers between Two Integers (i). Otherwise S=∅S=\emptyset: an n∈Sn\in S would give p≤qp\le q, as ≤\le is a total order on Z\mathbb{Z} (The Integers Form an Ordered Ring Containing the Natural Numbers as Its Positive Elements (ii)); and ∅\emptyset is finite by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iii).

The set EE. Let g=κ∘j:Z→Rg=\kappa\circ j:\mathbb{Z}\to\mathbb{R}, a map with g(n)=κ(j(n))g(n)=\kappa(j(n)) for every n∈Zn\in\mathbb{Z} by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii), and let g∣S:S→Rg|_{S}:S\to\mathbb{R} be its restriction, a map with g∣S(n)=g(n)g|_{S}(n)=g(n) for n∈Sn\in S by Domains and Restrictions of Maps (ii) and Domains and Restrictions of Maps (iii). Its image E′=g∣S[S]E'=g|_{S}[S] is finite by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (vi), and E′⊆RE'\subseteq\mathbb{R}. Let E={u∈E′:a≤u≤b}E=\{u\in E':a\le u\le b\}, a subset of E′E' and so a finite subset of R\mathbb{R} by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iv).

The elements of EE. Let u∈Ru\in\mathbb{R}. If u∈Eu\in E, then u∈E′u\in E', so u=g∣S(n)=κ(j(n))u=g|_{S}(n)=\kappa(j(n)) for some n∈S⊆Zn\in S\subseteq\mathbb{Z}, and a≤u≤ba\le u\le b. Conversely, let u=κ(j(n))u=\kappa(j(n)) with n∈Zn\in\mathbb{Z} and a≤u≤ba\le u\le b. Then κ(j(p))≤a≤κ(j(n))\kappa(j(p))\le a\le\kappa(j(n)), so p≤np\le n by the first paragraph; and κ(j(n))≤b\kappa(j(n))\le b, so κ(j(n))≤κ(j(q))\kappa(j(n))\le\kappa(j(q)) by The Integer Part as the Greatest Integer Below, the Integer Part of a Double, and Powers of Two (i), applied to z=bz=b, and n≤qn\le q by the first paragraph. Hence n∈Sn\in S, u=g∣S(n)∈E′u=g|_{S}(n)\in E', and, as a≤u≤ba\le u\le b, u∈Eu\in E.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…