anonymous
  • anonymous
could someone explain what equinumerous means in mathematical Theoretical course?!
Mathematics
jamiebookeater
  • jamiebookeater
See more answers at brainly.com
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
the definition states " two sets S and T are called equinumerous, and we write S ~ T, if there exists a bijective function from S onto T". Bijective definition is "a function is bijective if it is surjective and injective". I'm asked to "Prove that if (S \ T) is equinumerous to (T \ S), then S is equinumerous to T" how do i do that?
KingGeorge
  • KingGeorge
What exactly do you mean by the S\T and T\S? Are those set minuses?
anonymous
  • anonymous
yes

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
set S without T
KingGeorge
  • KingGeorge
So there are the same number of elements in S that aren't in T as there are elements in T that aren't in S. Let \(U=S\cap T\). So \(S\setminus T=S\setminus (S\cap T)\). Then \(S=S\setminus T +U\). Now let \(f:S\setminus T\to T\setminus S\) such that \(f\) is a bijection. Now define\[g:S\setminus T+U\longrightarrow T\setminus S+U\]by\[ g(s)=\begin{cases} f(s)\qquad s\in S\setminus T \\ s\qquad \;\;\;\;\,s\in U \end{cases}\]
KingGeorge
  • KingGeorge
Note that if we restrict \(g\) to only the domain \(U\), we get a bijective function since \(g(g(s))=s\). I.e., \(g\) has an inverse. Similarly, if we restrict \(g\) to only the domain \(S\setminus T\), then we have a bijective function since \(f\) is bijective. So \(g\) is bijective over its whole domain, and is therefore a bijective function. Finally, since \(S\setminus T+U=S\) and \(T\setminus S+U=T\), \(S\) and \(T\) are equinumerous.
KingGeorge
  • KingGeorge
Did that all make sense?
anonymous
  • anonymous
oh yes thank you!!

Looking for something else?

Not the answer you are looking for? Search for more explanations.