Ross Finlayson
2024-03-16 17:31:49 UTC
A function surjects the rational numbers onto the irrational numbers
Ross A. Finlayson
December 28, 2006
Abstract
There exists a surjection from the rational numbers onto the irrational
numbers.
Let Q be the set of rational numbers,
and P be the set of irrational numbers,
Q+ the set of positive rational numbers,
P+ the set of positive irrational numbers,
Q- the set of negative rational numbers,
P- the set of negative irrational numbers.
There is a distinct q e Q for each p e P.
Proof. Let Q_i+ be the set of positive rationals
less than p_i, p_i e P+.
For each p_h < p_i, p_h e P+: Q_h+ subset Q_i+, and Q_h+ neq Q_i+.
Let
Q_nlt i = Q_i+ \ ( U p_h < p_i Q_h+ ) = Int p_h< p_i (Q_i+ \ Q_h+)
It is so that Q_nlt i neq 0
else Eq_h > p_h in a Q_h+, or some p_h = p_i.
Thus, Eq_i in Q_nlt i. A q_i e Q_nlt i -> q_i e Q_i+,
Q_nlt i subset Q_i+ subset Q+. As Q_nlt i neq 0 and
Q_nlt_i subset Q+: A p_i e P+, E q_i in Q+, where q_i
is related to p_i and not related to p_j neq p_i
for any p_j in P.
Similarly for Q- and P- via symmetry, replace < with >,
nlt with ngt, + with -, "less than" with "greater than",
and positive with negative: A p_i e P-, E q_i e Q-,
where q_i is related to p_i and not related to p_j neq p_i,
for any p_j e P.
Box
There exists an injection phi: P -> Q.
Proof. As there exists a distinct rational
q e Q for each distinct irrational p e P,
there exists an injection q: P -> Q.
E q_i in Q, A p_i, p_j in P: phi(p_i) = q_i, p_i neq p_j -> phi(p_i) ne
phi(p_j),
a one-to-one function from P to a subset of Q.
Box
There exists a surjection rho: Q -> P.
Proof. As there exists an injection phi: P -> Q
there exists a surjection rho: Q -> P.
Box
1
^^^
That's sort of it, while, it's typeset in TeX,
fits on one page, uses these symbols.
There's a particular emphasis on
"It is so that Q_{≮i} ≠ ∅
else ∃q_h > p_h in a Q_h+, or some p_h = p_i".
A ∀
E ∃
e ∈
neq ≠
nlt ≮
ngt ≯
0 ∅
subset ⊂
U ⋃
Int ⋂
P ℙ
Q ℚ
=> ⇒
-> →
phi ϕ
rho ρ
Box □
Let Q be the set of rational numbers,
and P be the set of irrational numbers,
Q+ the set of positive rational numbers,
P+ the set of positive irrational numbers,
Q- the set of negative rational numbers,
P- the set of negative irrational numbers.
There is a distinct q ∈ Q for each p ∈ P.
Proof. Let Q_i+ be the set of positive
rationals less than p_i, p_i ∈ P+.
For each p_h < p_i, p_h ∈ P+: Q_h+ ⊂ Q_i+, and Q_h+ ≠ Q_i+.
Let
Q_{≮i} = Q_i+ \ ( U_{p_h < p_i} Q_h+ ) = ⋂_{p_h< p_i} (Q_i+ \ Q_h+)
It is so that Q_{≮i} ≠ ∅
else ∃q_h > p_h in a Q_h+, or some p_h = p_i.
Thus, ∃q_i ∈ Q_{≮i}.
∀q_i ∈ Q_{≮i} ⇒ q_i ∈ Q_i+, Q_{≮i} ⊂ Q_i+ ⊂ Q+.
As Q_{≮i} ≠ 0 and Q_{≮i} ⊂ Q+: ∀p_i ∈ P+, ∃q_i ∈ Q+,
where q_i is related to p_i and not related to
p_j ≠ p_i for any p_j ∈ P.
Similarly for Q- and P- via symmetry,
replace < with >, ≮ with ≯, + with -,
"less than" with "greater than",
and positive with negative:
∀p_i ∈ P-, ∃q_i ∈ Q-, where q_i is related to p_i and not related to p_j
≠ p_i, for any p_j ∈ P.
□
There exists an injection ϕ: P → Q.
Proof. As there exists a distinct rational
q ∈ Q for each distinct irrational p ∈ P,
there exists an injection q: P → Q.
∃ q_i ∈ Q, ∀ p_i, p_j ∈ P: ϕ(p_i) = q_i, p_i ≠ p_j ⇒ ϕ(p_i) ≠ ϕ(p_j),
a one-to-one function from P to a subset of Q.
□
There exists a surjection ρ: Q → P.
Proof. As there exists an injection ϕ: P → Q
there exists a surjection ρ: Q → P.
□
I figure that if you enjoy "Dedekind cuts"
then you'll get a kick out of this.
There's a particular emphasis on
"It is so that Q_{≮i} ≠ ∅
else ∃q_h > p_h in a Q_h+, or some p_h = p_i".
Ross A. Finlayson
December 28, 2006
Abstract
There exists a surjection from the rational numbers onto the irrational
numbers.
Let Q be the set of rational numbers,
and P be the set of irrational numbers,
Q+ the set of positive rational numbers,
P+ the set of positive irrational numbers,
Q- the set of negative rational numbers,
P- the set of negative irrational numbers.
There is a distinct q e Q for each p e P.
Proof. Let Q_i+ be the set of positive rationals
less than p_i, p_i e P+.
For each p_h < p_i, p_h e P+: Q_h+ subset Q_i+, and Q_h+ neq Q_i+.
Let
Q_nlt i = Q_i+ \ ( U p_h < p_i Q_h+ ) = Int p_h< p_i (Q_i+ \ Q_h+)
It is so that Q_nlt i neq 0
else Eq_h > p_h in a Q_h+, or some p_h = p_i.
Thus, Eq_i in Q_nlt i. A q_i e Q_nlt i -> q_i e Q_i+,
Q_nlt i subset Q_i+ subset Q+. As Q_nlt i neq 0 and
Q_nlt_i subset Q+: A p_i e P+, E q_i in Q+, where q_i
is related to p_i and not related to p_j neq p_i
for any p_j in P.
Similarly for Q- and P- via symmetry, replace < with >,
nlt with ngt, + with -, "less than" with "greater than",
and positive with negative: A p_i e P-, E q_i e Q-,
where q_i is related to p_i and not related to p_j neq p_i,
for any p_j e P.
Box
There exists an injection phi: P -> Q.
Proof. As there exists a distinct rational
q e Q for each distinct irrational p e P,
there exists an injection q: P -> Q.
E q_i in Q, A p_i, p_j in P: phi(p_i) = q_i, p_i neq p_j -> phi(p_i) ne
phi(p_j),
a one-to-one function from P to a subset of Q.
Box
There exists a surjection rho: Q -> P.
Proof. As there exists an injection phi: P -> Q
there exists a surjection rho: Q -> P.
Box
1
^^^
That's sort of it, while, it's typeset in TeX,
fits on one page, uses these symbols.
There's a particular emphasis on
"It is so that Q_{≮i} ≠ ∅
else ∃q_h > p_h in a Q_h+, or some p_h = p_i".
A ∀
E ∃
e ∈
neq ≠
nlt ≮
ngt ≯
0 ∅
subset ⊂
U ⋃
Int ⋂
P ℙ
Q ℚ
=> ⇒
-> →
phi ϕ
rho ρ
Box □
Let Q be the set of rational numbers,
and P be the set of irrational numbers,
Q+ the set of positive rational numbers,
P+ the set of positive irrational numbers,
Q- the set of negative rational numbers,
P- the set of negative irrational numbers.
There is a distinct q ∈ Q for each p ∈ P.
Proof. Let Q_i+ be the set of positive
rationals less than p_i, p_i ∈ P+.
For each p_h < p_i, p_h ∈ P+: Q_h+ ⊂ Q_i+, and Q_h+ ≠ Q_i+.
Let
Q_{≮i} = Q_i+ \ ( U_{p_h < p_i} Q_h+ ) = ⋂_{p_h< p_i} (Q_i+ \ Q_h+)
It is so that Q_{≮i} ≠ ∅
else ∃q_h > p_h in a Q_h+, or some p_h = p_i.
Thus, ∃q_i ∈ Q_{≮i}.
∀q_i ∈ Q_{≮i} ⇒ q_i ∈ Q_i+, Q_{≮i} ⊂ Q_i+ ⊂ Q+.
As Q_{≮i} ≠ 0 and Q_{≮i} ⊂ Q+: ∀p_i ∈ P+, ∃q_i ∈ Q+,
where q_i is related to p_i and not related to
p_j ≠ p_i for any p_j ∈ P.
Similarly for Q- and P- via symmetry,
replace < with >, ≮ with ≯, + with -,
"less than" with "greater than",
and positive with negative:
∀p_i ∈ P-, ∃q_i ∈ Q-, where q_i is related to p_i and not related to p_j
≠ p_i, for any p_j ∈ P.
□
There exists an injection ϕ: P → Q.
Proof. As there exists a distinct rational
q ∈ Q for each distinct irrational p ∈ P,
there exists an injection q: P → Q.
∃ q_i ∈ Q, ∀ p_i, p_j ∈ P: ϕ(p_i) = q_i, p_i ≠ p_j ⇒ ϕ(p_i) ≠ ϕ(p_j),
a one-to-one function from P to a subset of Q.
□
There exists a surjection ρ: Q → P.
Proof. As there exists an injection ϕ: P → Q
there exists a surjection ρ: Q → P.
□
I figure that if you enjoy "Dedekind cuts"
then you'll get a kick out of this.
There's a particular emphasis on
"It is so that Q_{≮i} ≠ ∅
else ∃q_h > p_h in a Q_h+, or some p_h = p_i".