Convex Functions: Proving g(x) is Convex

  • Thread starter Thread starter russel.arnold
  • Start date Start date
  • Tags Tags
    Convex Functions
russel.arnold
Messages
38
Reaction score
0
let f(X) : Rn --> R be a function defined on convex set S s.t S is a subset of
Rn (real space n-dim). Let f is positive throughout. Then define g(x) = (f(x))^2. Prove that if f(x) is convex then g(x) is also convex.
 
Physics news on Phys.org
russel.arnold said:
let f(X) : Rn --> R be a function defined on convex set S s.t S is a subset of
Rn (real space n-dim). Let f is positive throughout. Then define g(x) = (f(x))^2. Prove that if f(x) is convex then g(x) is also convex.

This needs to be posted in the Calculus and Beyond Homework forum with your attempt at a solution.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top