Equivalence of Functions and Power Sets in Set Theory

Click For Summary

Homework Help Overview

The discussion revolves around proving the equivalence of three statements related to functions and power sets in set theory, specifically focusing on the definitions and properties of functions defined on sets and their power sets.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the meaning of the term 'on' in the context of functions, questioning whether it refers to 'onto'. There are attempts to understand how a function defined on a set can also be considered on its power set. Some participants express uncertainty about how to formulate proofs connecting the statements, particularly the third statement.

Discussion Status

The discussion is active, with participants raising questions about the assumptions underlying the statements. Some guidance is offered regarding the interpretation of functions and their application to subsets, but there is no explicit consensus on the proofs or interpretations being explored.

Contextual Notes

There is a noted ambiguity regarding the definition of the function as unary or not, and participants are considering how this affects the formulation of the statements and their proofs.

MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
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
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)).
 
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.
 
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?
 
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.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
Replies
23
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
Replies
20
Views
5K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
20
Views
4K