Countable Sets: Cantor's Theorem & Galileo's Paradox

  • Thread starter Thread starter Hippasos
  • Start date Start date
  • Tags Tags
    Sets
Hippasos
Messages
75
Reaction score
0
Hi!

Can You please confirm that there is no contradiction between Cantor's theorem of countably infinite power sets and Galileo's paradox?

- Thanks
 
Last edited:
Physics news on Phys.org
Don't think of infinite sets as something "huge", and don't think of different countable sets as "equally huge", because it will only cause confusion. There are not "more" integers than perfect squares, because "more" doesn't make sense when it comes to infinite sets, unless you define what you mean by "more".

We use cardinality as one type of measure of infinite sets. Countable sets are simply sets that can be indexed by the natural numbers, that is: put in a bijective correspondence with the set of natural numbers. In this context there are "equally many" perfect squares as natural numbers, simply because they can be put in a bijective correspondence.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top