Thursday, November 24, 2016

elementary set theory - How do i prove that a given graph is a function?




Define a graph ϕ as;



ϕ(x)=|x|,x[1,1] and ϕ(x+2)=ϕ(x).



I'm trying to prove that ϕ is a function, but it seems something is wrong in my argument.



It's not hard to see that "xR,y[0,1] such that (x,y)ϕ"



I'm trying to prove that x1=x2ϕ(x1)=ϕ(x2) and here's my argument below.




=============
Suppose x1=x2.



Then there exists a unique nZ such that $n_i≦\frac{x_i + 1}{2}

Thus ϕ(x1)=|x12n1|=ϕ(x2). Q.E.D



===============




I'm sure something's wrong in my argument, but don't know what it is..



(This argument works even when ϕ(1)1, so something's wrong here..)


Answer



Every real number is congruent to a unique real number in (1,1]. (Note the open parenthesis on the left).



So if ϕ had been defined by ϕ(x)=|x| on (1,1], and ϕ(x+2)=ϕ(x), there would be no issue whatsoever. (In principle one would need an easy induction to show that ϕ(x+2n)=ϕ(x).)



But because ϕ(x) was defined as |x| on the closed interval [1,1], we need to check that ϕ(x) is well-defined at odd integers.




The issue is that the definition, for example, simultaneously defines ϕ(5) as ϕ(1) and as ϕ(1). But since |1|=|1|, there is no problem.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...