Cardinality of Infinite Sets: Proving Equality with Finite Subsets

[ribbon]

Homework Statement

Let S be in finite and, A a subset of S be finite.
Prove that that the cardinality of S = the cardinality of S excluding the subset of A.

Homework Equations

The Attempt at a Solution

We can write out the finite subset A as (x1, x2, ... xn) which can be put into a one to one correspondence with N. S is infinite so a bijection to N is not possible by definition. The cardinality of S excluding A is still uncountable but I don't see why they MUST have the same cardinality.

 

[ribbon]

I know to show cardinalities are equal I need to be able to construct a bijection between them...

Bijection between two infinite sets seems confusing.

 

[LCKurtz]

Start with something simple. Do you see how to make a bijection between the natural numbers $\mathbb N$ and $\mathbb N$ excluding {1,2,3,4,5,6,7,8,9,10}? It's the same idea.

 

[ribbon]

Start with something simple. Do you see how to make a bijection between the natural numbers $\mathbb N$ and $\mathbb N$ excluding {1,2,3,4,5,6,7,8,9,10}? It's the same idea.

Sure I'd map 1 from the first set N to say 11, map 2 to 12, 3 to 13...

My bijection would be for n in N (the fully inclusive N) f(n) = n+ 10?

 

[LCKurtz]

Sure I'd map 1 from the first set N to say 11, map 2 to 12, 3 to 13...

My bijection would be for n in N (the fully inclusive N) f(n) = n+ 10?

Sure. Now can you figure out how to use that kind of thinking for your original problem.

 

[ribbon]

Sure. Now can you figure out how to use that kind of thinking for your original problem.

I guess how I would write it is problematic for me, I understand your idea, take that excluding set A, which is a set from x1 to xn and begin the mapping from a xn + 1. But how do I know my excluded set is ordered, and how do I know that the numbers are consecutively equally spaced the set from 1 to 10 is easy to visualize as an example. But this random set A seems like it could cause problems for the function I would have to write if it isn't as simple.

Or does what I mention even matter when writing a bijection?

 

[LCKurtz]

I guess how I would write it is problematic for me, I understand your idea, take that excluding set A, which is a set from x1 to xn and begin the mapping from a xn + 1. But how do I know my excluded set is ordered, and how do I know that the numbers are consecutively equally spaced the set from 1 to 10 is easy to visualize as an example. But this random set A seems like it could cause problems for the function I would have to write if it isn't as simple.

Or does what I mention even matter when writing a bijection?

You're right, the set in your problem isn't $\mathbb R$. But it's the idea that counts. Can you find an infinite sequence of distinct points from S where the first N terms of the sequence are the points from A (which has only N points) and the rest are not from A? Then...

 

[vela]

Homework Statement

Let S be in finite and, A a subset of S be finite.
Prove that that the cardinality of S = the cardinality of S excluding the subset of A.

The Attempt at a Solution

We can write out the finite subset A as (x1, x2, ... xn) which can be put into a one to one correspondence with N. S is infinite so a bijection to N is not possible by definition. The cardinality of S excluding A is still uncountable but I don't see why they MUST have the same cardinality.

You seem to be assuming S is uncountable, but is that really the case? In the problem statement, you simply say S is infinite, so you need to make sure your argument works for both the countably infinite and uncountably infinite cases.