Clarkson's inequalities

In mathematics, Clarkson's inequalities, named after James A. Clarkson, are results in the theory of Lp spaces. They give bounds for the Lp-norms of the sum and difference of two measurable functions in Lp in terms of the Lp-norms of those functions individually.

Statement of the inequalities

Let (X, Σ, μ) be a measure space; let f, g : X  R be measurable functions in Lp. Then, for 2  p < +∞,

For 1 < p < 2,

where

i.e., q = p  (p  1).

The case p  2 is somewhat easier to prove, being a simple application of the triangle inequality and the convexity of

gollark: Real programmers travel back in time to the start of the universe and alter its initial conditions such that a program they want is simply created later.
gollark: ```mrustc works by compiling assumed-valid rust code (i.e. without borrow checking) into a high-level assembly (currently using C, but LLVM/cretonne or even direct machine code could work) and getting an external code generator to turn that into optimised machine code. This works because the borrow checker doesn't have any impact on the generated code, just in checking that the code would be valid.```
gollark: Mostly designed to stop trusting trust attacks and allow porting, but it could work.
gollark: https://github.com/thepowersgang/mrustc
gollark: There's a Rust→© compiler.

References

  • Clarkson, James A. (1936), "Uniformly convex spaces", Transactions of the American Mathematical Society, 40 (3): 396–414, doi:10.2307/1989630, MR 1501880.
  • Hanner, Olof (1956), "On the uniform convexity of Lp and p", Arkiv för Matematik, 3 (3): 239–244, doi:10.1007/BF02589410, MR 0077087.
  • Friedrichs, K. O. (1970), "On Clarkson's inequalities", Communications on Pure and Applied Mathematics, 23: 603–607, doi:10.1002/cpa.3160230405, MR 0264372.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.