MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rpnnen2 Structured version   Visualization version   GIF version

Theorem rpnnen2 15160
Description: The other half of rpnnen 15161, where we show an injection from sets of positive integers to real numbers. The obvious choice for this is binary expansion, but it has the unfortunate property that it does not produce an injection on numbers which end with all 0's or all 1's (the more well-known decimal version of this is 0.999... 14818). Instead, we opt for a ternary expansion, which produces (a scaled version of) the Cantor set. Since the Cantor set is riddled with gaps, we can show that any two sequences that are not equal must differ somewhere, and when they do, they are placed a finite distance apart, thus ensuring that the map is injective.

Our map assigns to each subset 𝐴 of the positive integers the number Σ𝑘𝐴(3↑-𝑘) = Σ𝑘 ∈ ℕ((𝐹𝐴)‘𝑘), where ((𝐹𝐴)‘𝑘) = if(𝑘𝐴, (3↑-𝑘), 0)) (rpnnen2lem1 15148). This is an infinite sum of real numbers (rpnnen2lem2 15149), and since 𝐴𝐵 implies (𝐹𝐴) ≤ (𝐹𝐵) (rpnnen2lem4 15151) and (𝐹‘ℕ) converges to 1 / 2 (rpnnen2lem3 15150) by geoisum1 14816, the sum is convergent to some real (rpnnen2lem5 15152 and rpnnen2lem6 15153) by the comparison test for convergence cvgcmp 14754. The comparison test also tells us that 𝐴𝐵 implies Σ(𝐹𝐴) ≤ Σ(𝐹𝐵) (rpnnen2lem7 15154).

Putting it all together, if we have two sets 𝑥𝑦, there must differ somewhere, and so there must be an 𝑚 such that 𝑛 < 𝑚(𝑛𝑥𝑛𝑦) but 𝑚 ∈ (𝑥𝑦) or vice versa. In this case, we split off the first 𝑚 − 1 terms (rpnnen2lem8 15155) and cancel them (rpnnen2lem10 15157), since these are the same for both sets. For the remaining terms, we use the subset property to establish that Σ(𝐹𝑦) ≤ Σ(𝐹‘(ℕ ∖ {𝑚})) and Σ(𝐹‘{𝑚}) ≤ Σ(𝐹𝑥) (where these sums are only over (ℤ𝑚)), and since Σ(𝐹‘(ℕ ∖ {𝑚})) = (3↑-𝑚) / 2 (rpnnen2lem9 15156) and Σ(𝐹‘{𝑚}) = (3↑-𝑚), we establish that Σ(𝐹𝑦) < Σ(𝐹𝑥) (rpnnen2lem11 15158) so that they must be different. By contraposition (rpnnen2lem12 15159), we find that this map is an injection. (Contributed by Mario Carneiro, 13-May-2013.) (Proof shortened by Mario Carneiro, 30-Apr-2014.) (Revised by NM, 17-Aug-2021.)

Assertion
Ref Expression
rpnnen2 𝒫 ℕ ≼ (0[,]1)

Proof of Theorem rpnnen2
Dummy variables 𝑥 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2770 . 2 (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛𝑥, ((1 / 3)↑𝑛), 0))) = (𝑥 ∈ 𝒫 ℕ ↦ (𝑛 ∈ ℕ ↦ if(𝑛𝑥, ((1 / 3)↑𝑛), 0)))
21rpnnen2lem12 15159 1 𝒫 ℕ ≼ (0[,]1)
Colors of variables: wff setvar class
Syntax hints:  ifcif 4223  𝒫 cpw 4295   class class class wbr 4784  cmpt 4861  (class class class)co 6792  cdom 8106  0cc0 10137  1c1 10138   / cdiv 10885  cn 11221  3c3 11272  [,]cicc 12382  cexp 13066
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-rep 4902  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095  ax-inf2 8701  ax-cnex 10193  ax-resscn 10194  ax-1cn 10195  ax-icn 10196  ax-addcl 10197  ax-addrcl 10198  ax-mulcl 10199  ax-mulrcl 10200  ax-mulcom 10201  ax-addass 10202  ax-mulass 10203  ax-distr 10204  ax-i2m1 10205  ax-1ne0 10206  ax-1rid 10207  ax-rnegex 10208  ax-rrecex 10209  ax-cnre 10210  ax-pre-lttri 10211  ax-pre-lttrn 10212  ax-pre-ltadd 10213  ax-pre-mulgt0 10214  ax-pre-sup 10215
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3or 1071  df-3an 1072  df-tru 1633  df-fal 1636  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-nel 3046  df-ral 3065  df-rex 3066  df-reu 3067  df-rmo 3068  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-pss 3737  df-nul 4062  df-if 4224  df-pw 4297  df-sn 4315  df-pr 4317  df-tp 4319  df-op 4321  df-uni 4573  df-int 4610  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-tr 4885  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-se 5209  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-isom 6040  df-riota 6753  df-ov 6795  df-oprab 6796  df-mpt2 6797  df-om 7212  df-1st 7314  df-2nd 7315  df-wrecs 7558  df-recs 7620  df-rdg 7658  df-1o 7712  df-oadd 7716  df-er 7895  df-pm 8011  df-en 8109  df-dom 8110  df-sdom 8111  df-fin 8112  df-sup 8503  df-inf 8504  df-oi 8570  df-card 8964  df-pnf 10277  df-mnf 10278  df-xr 10279  df-ltxr 10280  df-le 10281  df-sub 10469  df-neg 10470  df-div 10886  df-nn 11222  df-2 11280  df-3 11281  df-n0 11494  df-z 11579  df-uz 11888  df-rp 12035  df-ico 12385  df-icc 12386  df-fz 12533  df-fzo 12673  df-fl 12800  df-seq 13008  df-exp 13067  df-hash 13321  df-cj 14046  df-re 14047  df-im 14048  df-sqrt 14182  df-abs 14183  df-limsup 14409  df-clim 14426  df-rlim 14427  df-sum 14624
This theorem is referenced by:  rpnnen  15161  opnreen  22853
  Copyright terms: Public domain W3C validator