Equivalence of Functions and Power Sets in Set Theory

In summary, the conversation is discussing three arguments that need to be proven equivalent. The first argument states that a function f from X to Y is "on" Y. The second argument states that f maps a power set p(X) to p(Y). The third argument states that the inverse of f maps p(Y) to p(X) in a one-to-one correspondence. The group discusses the meaning of "on" and how it relates to being onto. They also discuss the function being unary and how it may be distributed over subsets of Y.
  • #1
MathematicalPhysicist
Gold Member
4,699
373
i need to prove that next three arguments are equivalent:
1)f:X->Y is on Y.
2) f:p(X)->p(Y) is on p(Y).
3)f^-1:p(Y)->p(X) is one-to-one correspondence.
where p is the power set.
 
Physics news on Phys.org
  • #2
what does 'on' mean? onto? perhaps playing devils advocate a little, but mainly to make you think about the question, if f is defined on X, how is it then defined on its power set (usually denoted P(X), not p(X)).
 
  • #3
yes, i checked in mathworld, it's onto.
my main problem is with the third statement, i tried imply 3 from 1 and vice versa, but i don't know how to formualte the proof.

any further hints are appreciated.
 
  • #4
are we assuming the function is unary?
or rather f(s in p(Y)) can be distributed into each element of s since
s is a subset of elements in Y?
 
  • #5
neurocomp2003 said:
are we assuming the function is unary?
or rather f(s in p(Y)) can be distributed into each element of s since
s is a subset of elements in Y?
no, we don't assume it's unary.
about your second question do you mean if B is a subset of P(Y) then
f:B->f(B)={f(x)|x belongs to B} then yes, otherwise no.
 

FAQ: Equivalence of Functions and Power Sets in Set Theory

What is set theory?

Set theory is a branch of mathematics that deals with the study of sets, which are collections of objects that share certain characteristics or properties. It provides a formal framework for understanding the relationships between different sets and their elements.

What are the basic concepts in set theory?

The basic concepts in set theory include sets, elements, subsets, and operations such as union, intersection, and complement. Sets are represented by capital letters and contain elements, which are the objects or numbers within the set. Subsets are sets that contain only some of the elements of another set, and operations allow for the manipulation and comparison of sets.

What is the difference between a finite and infinite set?

A finite set has a specific, limited number of elements, while an infinite set has an uncountable number of elements. For example, the set of all natural numbers is an infinite set, while the set of colors in a rainbow is a finite set.

How does set theory relate to other branches of mathematics?

Set theory is considered to be the foundation of mathematics, as it provides a framework for understanding and defining mathematical concepts and objects. It is used in various fields of mathematics, such as algebra, geometry, and logic, and is also applied in other disciplines such as computer science and linguistics.

What are some applications of set theory?

Set theory has various applications in different fields. In mathematics, it is used to formalize mathematical concepts and proofs. In computer science, it is used to design and analyze algorithms and data structures. In linguistics, it is used to study the structure of language. It also has practical applications in areas such as database management, decision-making, and social sciences.

Back
Top