Thursday, April 26, 2018

real analysis - Prove linear functions that are not multiplications by a constant are unbounded on every interval



An exercise in a book on logic and set theory is as follows:





Let f:RR be such that x,y:f(x+y)=f(x)+f(y), but f is not a multiplication by a constant. Prove that it is unbounded on every interval.


While looking for hints I've come across Herrlich's "Axiom of Choice", where (Theorem 5.5) he proves a related result that non-continuous solutions to this functional equation are non-measurable. This, coupled with continuous solutions being necessarily a multiplication by a constant and some real analysis (which is rusty in my case), should yield the required result if I understand correctly.



But considering whether the functions are measurable requires adding a lot more "structure" to R that the book I'm using typically considers, so perhaps there is a more concise and straightforward solution. So, my question is: is there one?



The exercise is in a section on Hamel basis, so I guess it's fine to prove this just for Hamel-related functions, like f(x) being a projection of x on a basis vector in a Hamel basis of R considered a vector space over Q.


Answer




First of all we can observe that an f of this kind is not continuous. In fact we can put f(1)=a and from the additivity property it follows that f(q)=aq for every qQ. If then f would be continuous, considered that Q is dense on R, we could prove that f(x)=ax for every xR, but that is a contradiction under our hypothesis.



From that we can prove that f is discontinuous in 0. If f had been continuous in 0 then for every xR we would have:
limh0[f(x+h)f(x)]=limh0f(h)=0


And we would have f continuous on every point, which is an absurd.



Now we can prove our thesis. Let [a,b] be an interval of R. Since f is discontinuous in 0 there exists an ϵ>0 such that for every δ>0 there exists an xδ<δ such that f(xδ)>ϵ (It could also be f(xδ)<ϵ, but the proof would be analogue and to avoid confusion let us restrict at the first case).



Now taken any nN let c be a positive integer such that cϵ>nf(a) and put δ<bac. So we have an 0<x0<δ such that f(x0)>ϵ. From that it follows that f(cx0)>cϵ>nf(a) and cx0<ba.




Now we can see that a+cx0[a,b] and f(a+cx0)=f(a)+f(cx0)>f(a)+nf(a)=n


And we proved our proposition since for every nN we have found an x[a,b] such that f(x)>n.



Hope I helped you, I know my english isn't perfect, sorry me if I did some mistake.


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...