Bourbaki

Corollary 2

Tag 07BP, permanent. Cite it as [Bourbaki, Tag 07BP].

Topological Vector Spaces, II, p. 11, § 2. Convex sets

If C is a pointed convex cone, the largest vector subspace contained in C is the set C∩(−C)C \cap (-C).

For, if W=C∩(−C)W = C \cap (-C), then W is non-empty and λW=W\lambda W = W for all λ≠0\lambda \neq 0, also

W+W⊂(C+C)∩(−(C+C))⊂C∩(−C)=W, W + W \subset (C + C) \cap (-(C + C)) \subset C \cap (-C) = W,
which shows that W is a vector subspace. Clearly every vector subspace contained in C is also contained in W.

Obviously, if ff is a linear mapping of E in a vector space F, then f(C)f(C), the image of a convex cone C in E, is a convex cone in F. Every intersection of convex cones (with vertex 0) in E is a convex cone. For every subset A of E the intersection of convex cones containing A (these exist, E itself is one such cone) is the smallest convex cone that contains A; it is called the convex cone generated by A.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.