Math 2.0

Real functions Definition

Strictly convex function

Builds on Convex function

Definition

Let II be an interval and let f ⁣:I→ℝf \colon I \to \mathbb{R} be a function. The function ff is strictly convex if f(tx+(1−t)y)<tf(x)+(1−t)f(y)f(t x + (1 - t) y) < t f(x) + (1 - t) f(y) for all x,y∈Ix, y \in I with x≠yx \ne y and all t∈(0,1)t \in (0, 1).

Remarks

Each strictly convex function is convex. A linear function is convex but not strictly convex. A strictly convex function has at most one minimum point. For example, x2x^2 and exe^x are strictly convex. Mathlib defines strict convexity as StrictConvexOn.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex function definition
  2. Strictly convex function definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Convex_function, Definition
About this page
Tag06BA5JZKTQ
URIm2://06BA5JZKTQ
Kinddefinition
WritingW0 stub
MSC26A51
DefinesStrictly convex function
UsesConvex function

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.