Proving Functions: The Relationship Between Onto and 1-to-1 Properties

  • Context: Graduate 
  • Thread starter Thread starter SqrachMasda
  • Start date Start date
  • Tags Tags
    Proofs
Click For Summary

Discussion Overview

The discussion revolves around proving properties of functions, specifically the relationship between onto (surjective) and one-to-one (injective) properties. Participants explore the implications of these properties in the context of abstract algebra, focusing on specific proofs related to function inverses and set containment.

Discussion Character

  • Homework-related
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant expresses frustration with proving mathematical statements and seeks guidance on how to approach the problem of showing that if V is contained in H, then f(f^-1(V))=V.
  • Another participant suggests starting by writing down the definitions relevant to onto functions and inverse functions.
  • A different participant emphasizes the importance of applying definitions systematically to arrive at the proof.
  • Concerns are raised about the accuracy of the statement that if f is one-to-one, then f^-1 is a function, clarifying that this is only true if f is a bijection.
  • Participants discuss the method of proving set equality by demonstrating mutual containment and suggest that the proof may seem trivial in some cases.
  • There is a mention of the potential for strict containment in the second part of the problem, with a suggestion to consider counterexamples.
  • One participant reflects on the challenge of memorizing definitions in abstract algebra, comparing it to learning vocabulary in a new language.

Areas of Agreement / Disagreement

Participants express differing views on the clarity and difficulty of the proof process, with some offering constructive feedback while others highlight the challenges of understanding the material. There is no consensus on the best approach to the proofs, and some disagreements arise regarding the definitions and implications of the properties discussed.

Contextual Notes

Some participants note the importance of definitions and the potential for confusion regarding the conditions under which certain properties hold, particularly the distinction between injective and bijective functions. The discussion reflects varying levels of familiarity with abstract algebra concepts.

SqrachMasda
Messages
42
Reaction score
0
everything i have to prove seems impossible
then i see it done and it seems so easy
any help on starting a proof,...anybody ever have this problem
i am new to this stuff, but my problem is I don't know what i need to show and what is legal to use
so this is my current problem, I'm sure it's extremely easy for all you math geniuses so spare me the arrogance

If f itself is 1-to-1 then f^-1 is a function.
Let f:G->H be an onto function
prove
(i) If V is contained in H then f(f^-1(V))=V

i'm pretty sure i understand onto and 1-1 definition
i also understand why it's true, i think
i also can somewhat understand the homomorphism stuff of it

i just don't know where to start, what to do, what it really is asking

then i got to prove this, but have not looked into it because I'm still on (i)
(ii) If W is contained in G then W is contained in f^-1(f(W)) and this could be a strict containment

abstract algebra seems to be an endless barrier in my math knowledge
is the key to it, memorizing endless amounts of definitions??
seriously
 
Physics news on Phys.org
1) Write down the definitions. (that's how you start!)
 
i did, i wrote evrerything down i knew
but I'm not sure how to apply it i guess, (that's how i started!)
 
anatomy of a proof

As you see more and more proofs, you'll start to see that there is a finite number of tehcniques one uses to prove things.

But almost all of them begin by writing down the definitions.

Let f:G->H be an onto function
prove
(i) If V is contained in H then f(f^-1(V))=V

Start with the definition of an onto function from G to H.

Follow with the definition of f^-1(V).

Then with the definition of f(A) where A in a subset of G.

Then replace A by f^-1(V).

Just by applying the definitions you'll have what f(f^-1(V)) is. And if it is indeed V, that's what you'll find.
 
thanks, i think that may make sense breaking it all down like that
 
heres one suggestion: try to refrain from being defensive and rude to people you are asking for help. i was going to help but was put off by the "spare me the arrogance" comment.
 
mathwonk said:
heres one suggestion: try to refrain from being defensive and rude to people you are asking for help. i was going to help but was put off by the "spare me the arrogance" comment.

Wow, I didn't even notice that until you mentionned it.

Those are harsh words.
 
SqrachMasda said:
...i'm sure it's extremely easy for all you math geniuses so spare me the arrogance...

If f itself is 1-to-1 then f^-1 is a function.

no, that is not true. only if f is a bijection (one to one and onto) is there an inverse function. Perhaps that sentence ought to have come after this one.

Let f:G->H be an onto function

prove
(i) If V is contained in H then f(f^-1(V))=V

the most useful way to prove set equality is to show each is contained in the other. Pick something in V, and shwo that it is in f(f^-1(V)), which is obvious since for v in V v=ff^-1(v) by the definition of inverse function: g is inverse to f if and only if fg and gf are the identity maps. The other containment is as easy to show. Arguably too easy in some sense and it genuinely isn't easy to write the proof in these cases: it isn't clear what constitutes a solid argument and what doesn't when the solid argument is very close to just saying 'well, it is'.
i also can somewhat understand the homomorphism stuff of it

where do homomorphisms come into anything here?

(ii) If W is contained in G then W is contained in f^-1(f(W)) and this could be a strict containment

if you understand the inverse image of a set you will see that obviously more than just W may map into f(W) (we're now droppping the hypotheses on f being injective I take it) and certainly W maps into f(W). Provide a counter example for the second part.
abstract algebra seems to be an endless barrier in my math knowledge
is the key to it, memorizing endless amounts of definitions??
seriously

you've memorized thousands of words; i suggest you didn't hat learning french at school because it required vocabulary. why should this be any different?
as it is you only need to memorize very few things compared to the knowledge you'll be required to keep in your head for everything else in this life.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 15 ·
Replies
15
Views
5K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K