Thread: Function assigning each subset of R sum of its elements

Hi.

Could you give me a hint how to solve this problem?

Let .



Check if is injective or surjective.

Originally Posted by wilhelm

Well, I think that it can't be injective because , so by the pigeonhole principle, there must to at least two subsets with the same sum of elements.

There are two mistakes here. First, D is the collection of finite nonempty subsets of , so . Second, pigeonhole principle is not valid for infinite sets. You may have an injection from a infinite set into its proper subset; in fact, this is one of the definitions of an infinite set. The proof of the pigeonhole principle proceeds by induction on the cardinality of the domain, so it only applies when this cardinality is a natural number. You need to use transfinite induction to prove properties of infinite numbers (ordinals). It is probably instructive to see where the proof of the principle breaks down when one tries to use transfinite induction instead of regular one.

Speaking about the problem, you need to have an intuition about D. Can you give examples of sets in D? Both questions are trivial once you understand what D is.

Thank you, I've already deleted that comment. Could we just say that for example and for example ?
Or is it oversimplified?

Originally Posted by wilhelm

Thank you, I've already deleted that comment. Could we just say that for example and for example ?

Yes. Concerning injection, you need , but since to disprove injection you need to find just one pair of arguments mapped to the same image, such x obviously exists.

Thank you. Could you maybe help me with the linear algebra problem about detA=1995, too?

Prove there exists a matrix