2025-05-18

1122: For Map, Cardinality of Range Is Equal to or Smaller Than Cardinality of Domain

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for map, cardinality of range is equal to or smaller than cardinality of domain

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any map, the cardinality of the range is equal to or smaller than the cardinality of the domain.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
S1: { the sets }
S2: { the sets }
f: :S1S2
//

Statements:
Card(f(S1))Card(S1)
//


2: Proof


Whole Strategy: Step 1: think of the relation, R:={(s2,s1)S2×S1|s2=f(s1)}; Step 2: apply the axiom of choice to have a function, FR, such that Dom(F)=Dom(R).

Step 1:

Let us think of the relation, R:={(s2,s1)S2×S1|s2=f(s1)}.

The domain of R is Dom(R)=f(S1).

R is not necessarily any function, because for an s2, there may be some multiple s1 s.

Step 2:

But by the axiom of choice, there is a function, FR, such that Dom(F)=Dom(R).

F is a map from Dom(F) into S1.

F is injective, because for any s2,s2Dom(F) such that s2s2, F(s2)F(s2), because if F(s2)=F(s2), s2=f(F(s2))=f(F(s2))=s2, a contradiction.

So, Card(f(S1))=Card(Dom(R))=Card(Dom(F))Card(S1).


References


<The previous article in this series | The table of contents of this series | The next article in this series>