Unpacking the Objects in the Category of Sets: Cardinality and Distinctions

  • Thread starter Thread starter AgentBased
  • Start date Start date
  • Tags Tags
    Set
AgentBased
Messages
5
Reaction score
0
Can someone give a quick description of the objects in the category SET? In particular, are sets distinguished by anything more than cardinality (i.e. R^2 has the same cardinality as R--are they distinct objects in SET, or is there just one "uncountable set" object?)

Answers/help much appreciated!
 
Physics news on Phys.org
There is a one-to-one correspondence between (small) sets and objects in Set. So R and R2 are, indeed, distinct but isomorphic objects.

Set, of course, is equivalent to its skeleton, whose objects are (small) cardinal numbers. And c=c2. (I'm using c for the cardinality of R)

Many constructions with categories are only defined up to equivalence -- so you can often replace Set with its skeleton when its convenient to do so.



P.S. "uncountable" means any cardinality greater than \aleph_0. I'm assuming you really meant just the cardinality of R[/size]
 
Thanks! (You are right, of course, I was being sloppy in using the term "uncountable" as I did.)

So suppose you had a function in SET, something like R^2 -> R^2 given by (x_1,x_2) -> (x_1,0). Would this arrow actually go from R^2 to itself, or to some distinct set object indicating the subset? (I am trying to determine idempotent arrows in SET, without being too blatant about it.)
 
AgentBased said:
R^2 -> R^2 ... Would this arrow actually go from R^2 to itself
Yes -- that's what "R2 -> R2" means.


There are a variety of algebraic manipulations you can do on a function -- things like invoke the existence of an epic-monic factorization, or use it to define an adjoint pair (inverse image, direct image) of functors on the poset Sub(R2) of subobjects of R2. (Set is nice enough to allow these constructions -- but they don't work in bad categories) I'm not really sure what you're looking for.



It almost sounds like you are talking about a construction I saw in Categories, Allegories by Freyd and Scedrov: they define a category Split(E) whose objects are the idempotents of E and Hom(e, e') consists of all morphisms of E satisfying xe = x = e'x.

Oh! Wikipedia has an article on it here.

For each idempotent in the category, this construction formally adds a new object representing its image. (which is named by the idempotent itself) Set already has images, though, so Split(Set) turns out to be equivalent to Set.
 
Thank you! I have some background in linear algebra and group theory, but I am just starting categories. I am trying to do some independent study in Categories for the Working Mathematician, and sometimes just a little clarification or explication helps so much when working on the exercises.
 
##\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...

Similar threads

Back
Top