for
I chanced upon a rather interesting proof of this while studying sets, relations and functions in math class. Try to see if you can find it!
To get you started, consider two non-empty sets and containing and elements respectively. I'll post the solution in a few days...
SOLUTION
Consider two non-empty sets and containing and elements respectively.
The CARTESIAN PRODUCT of and , given by , is the set that contains all possible ordered pairs of the form . Obviously, this set contains elements.
A RELATION between two sets and is defined as a subset of their Cartesian product. Then, how many relations are possible between and ? This is the number of possible subsets of the Cartesian product, or, in other words, the number of elements in the POWER SET of . How do we find the number of possible subsets of ? To choose a subset from a set, what do we do? We either choose an element to be part of the subset or not, i.e. we make a choice between 2 alternatives. Since there are elements in the set, and we need to make a choice for each element, the number of subsets possible is given by .
A FUNCTION between two sets and is a subset of their Cartesian product too (just like a relation) but with an additional constraint: all elements of should have exactly one image in . Then, how many functions are possible between and ? Since each element in has possible choices of an image in and there are elements in , there are a total of possible functions from to .
The final step is just logic: if a function is a relation with a constraint, there have to be fewer possible functions than relations.
Hence, .
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
mn?2mnmn?(2m)nm<2mmn<2mn
*I use the ? to show that the relation is not yet known
Log in to reply
Well, of course you're right algebraically, but that's not the curious proof I saw. I'll post the solution soon, maybe in two more days... :)
Subbed for any good solutions other than simple inequality. =3=