ArticleslgStudy

mathematics

Krein–Milman theorem

Krein–Milman theorem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Krein–Milman theorem rather than just read about it. In short: In the mathematical theory of functional analysis, the Krein–Milman theorem is a proposition about compact convex sets in locally convex topological vector spaces (TVSs). This theorem generalizes to infinite-dimensional spaces and to arbitrary compact convex sets the following basic observation: a convex (i.e. "filled") triangle, including its perimeter and the area "inside of it", is equal to the convex hull of its…

Krein–Milman theorem — main illustration
Krein–Milman theorem — illustration

Key takeaways

  • Krein–Milman theorem belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Krein–Milman theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Krein–Milman theorem from memory before moving on to harder problems.

Reference excerpt

In the mathematical theory of functional analysis, the Krein–Milman theorem is a proposition about compact convex sets in locally convex topological vector spaces (TVSs).

This theorem generalizes to infinite-dimensional spaces and to arbitrary compact convex sets the following basic observation: a convex (i.e. "filled") triangle, including its perimeter and the area "inside of it", is equal to the convex hull of its three vertices, where these vertices are exactly the extreme points of this shape. This observation also holds for any other convex polygon in the plane R 2 . {\displaystyle \mathbb {R} ^{2}.}

Statement and definitions

Preliminaries and definitions

Throughout, X {\displaystyle X} will be a real or complex vector space. For any elements x {\displaystyle x} and y {\displaystyle y} in a vector space, the set [ x , y ] := { t x + ( 1 − t ) y : 0 ≤ t ≤ 1 } {\displaystyle [x,y]:=\{tx+(1-t)y:0\leq t\leq 1\}} is called the closed line segment or closed interval between x {\displaystyle x} and y . {\displaystyle y.} The open line segment or open interval between x {\displaystyle x} and y {\displaystyle y} is ( x , y ) := ∅ {\displaystyle (x,y):=\varnothing } when x = y {\displaystyle x=y} while it is ( x , y ) := { t x + ( 1 − t ) y : 0 < t < 1 } {\displaystyle (x,y):=\{tx+(1-t)y:0<t<1\}} when x ≠ y ; {\displaystyle x\neq y;} it satisfies ( x , y ) = [ x , y ] ∖ { x , y } {\displaystyle (x,y)=[x,y]\setminus \{x,y\}} and [ x , y ] = ( x , y ) ∪ { x , y } . {\displaystyle [x,y]=(x,y)\cup \{x,y\}.} The points x {\displaystyle x} and y {\displaystyle y} are called the endpoints of these interval. An interval is said to be non-degenerate or proper if its endpoints are distinct. The intervals [ x , x ] = { x } {\displaystyle [x,x]=\{x\}} and [ x , y ] {\displaystyle [x,y]} always contain their endpoints while ( x , x ) = ∅ {\displaystyle (x,x)=\varnothing } and ( x , y ) {\displaystyle (x,y)} never contain either of their endpoints. If x {\displaystyle x} and y {\displaystyle y} are points in the real line R {\displaystyle \mathbb {R} } then the above definition of [ x , y ] {\displaystyle [x,y]} is the same as its usual definition as a closed interval. For any p , x , y ∈ X , {\displaystyle p,x,y\in X,} the point p {\displaystyle p} is said to (strictly) lie between x {\displaystyle x} and y {\displaystyle y} if p {\displaystyle p} belongs to the open line segment ( x , y ) . {\displaystyle (x,y).} If K {\displaystyle K} is a subset of X {\displaystyle X} and p ∈ K , {\displaystyle p\in K,} then p {\displaystyle p} is called an extreme point of K {\displaystyle K} if it does not lie between any two distinct points of K . {\displaystyle K.} That is, if there does not exist x , y ∈ K {\displaystyle x,y\in K} and 0 < t < 1 {\displaystyle 0<t<1} such that x ≠ y {\displaystyle x\neq y} and p = t x + ( 1 − t ) y . {\displaystyle p=tx+(1-t)y.} In this article, the set of all extreme points of K {\displaystyle K} will be denoted by extreme ⁡ ( K ) . {\displaystyle \operatorname {extreme} (K).}

… excerpt ends here. Continue reading the full article.

Illustrations

Krein–Milman theorem: Given a convex shape 
  
    
      
        K
      
    
    {\displaystyle K}
  
 (light blue) and its set of extreme points 
  
    
      
        B
      
    
    {\displaystyle B}
  
 (red), the convex hull of 
  
    
      
        B
      
    
    {\displaystyle B}
  
 is 
  
    
      
        K
        .
      
    
    {\displaystyle K.}
Given a convex shape K {\displaystyle K} (light blue) and its set of extreme points B {\displaystyle B} (red), the convex hull of B {\displaystyle B} is K . {\displaystyle K.}

Worked examples

Example 1 — a first encounter with Krein–Milman theorem

Start with the simplest possible case. Write down what Krein–Milman theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Krein–Milman theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Krein–Milman theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Krein–Milman theorem

In research
Krein–Milman theorem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Krein–Milman theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Krein–Milman theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Convex hulls, Oriented matroids, Theorems in convex geometry, so understanding it makes those chapters shorter.
In everyday life
Look for Krein–Milman theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Krein–Milman theorem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Krein–Milman theorem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Krein–Milman theorem means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Krein–Milman theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Krein–Milman theorem in simple terms?

In the mathematical theory of functional analysis, the Krein–Milman theorem is a proposition about compact convex sets in locally convex topological vector spaces (TVSs). This theorem generalizes to infinite-dimensional spaces and to arbitrary compact convex sets the following basic observation: a…

Why does Krein–Milman theorem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Krein–Milman theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Krein–Milman theorem.

Tags

  • Convex hulls
  • Oriented matroids
  • Theorems in convex geometry
  • Theorems in discrete geometry
  • Theorems in functional analysis
  • Theorems involving convexity
  • Topological vector spaces

Keep exploring