Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Convex closures and hulls of finitely many compact convex sets

Statement

In any real or complex TVS, the closure and interior of a convex set are convex, and the closure of a balanced set is balanced. If a convex set has nonempty interior, it is contained in the closure of its interior.

For finitely many nonempty compact convex subsets K1,,Kn, with n1, co(j=1nKj)={j=1ntjxj:tj0, j=1ntj=1, xjKj} is compact, and is closed if the ambient TVS is Hausdorff. In particular finite point hulls are compact. Empty members may be removed; the hull of an empty family is empty and compact.

Facts & Assumptions

Given: A real or complex TVS X; convex and balanced sets as specified in each assertion; a finite list of compact convex sets.

[F1]

Convexity, balance and the finite-combination description of a hull are as in Local convexity, convex and balanced sets, and the continuous dual.

[F2]

Translations and nonzero dilations are homeomorphisms, and the vector operations are continuous (Translations, dilations and absorption in a topological vector space).

[F4]

Finite products of compact spaces are compact in ZF (A product of finitely many compact spaces is compact in the product topology).

[F8]

Choice for a finite indexed list of nonempty sets is available in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Proof

1.1

Let x,yC for convex C, and 0<t<1. The affine map (a,b)(1t)a+tb is continuous by the vector operations. For an open neighborhood O of (1t)x+ty, its preimage contains a product neighborhood P×Q of (x,y). There exist aPC and bQC by the closure test. Their convex combination is in OC. Thus (1t)x+tyC. At t=0,1 the assertion follows from membership of x,y; for C= its closure is empty.

F1F2F3
1.2

For x,yintC and 0<t<1, the open set (1t)intC+tintC contains their combination and lies in C. It is open as a union of translates of a nonzero dilate of an open set. The endpoints t=0,1 are immediate, and an empty interior is convex vacuously. If yintC and xC, then for 0<s1 the open set (1s)x+sintC lies in C. Hence (1s)x+sy belongs to its interior. Continuity of the orbit at s=0 shows every neighborhood of x contains such a point, so xintC.

F1F2F3
1.3

Let C be balanced. For 0<λ1, the homeomorphism Dλ:xλx carries C onto λC. Indeed, pull an open neighborhood back by Dλ for one inclusion and use its inverse for the other. Since λCC, the closure test gives λCC. For λ=0 and C, balance gives 0C, so 0C={0}C; for empty C the dilation has empty image. Thus the closure is balanced.

F1F2F3
1.4

Suppose n1 and each Kj is nonempty. The simplex Δ={tRn:tj0, jtj=1} is closed: coordinate maps and their finite sum are continuous, and the conditions are inverse images of closed real rays and {1}. It is bounded since 0tj1 and jtj2n. It is compact by Heine–Borel. Finite product compactness makes Δ×jKj compact. The map Φ(t,x)=jtjxj is continuous: coordinate projections and inclusions are continuous by preimages of basic opens, scalar multiplication is jointly continuous, and iterating addition preserves continuity. Therefore its image is compact.

F2F4F5F6
2.1

Every value of Φ is a convex combination from the union. Conversely, write a hull point as =1may. Assign each y the least index j for which yKj, and let tj be the sum of the weights with that label. For tj>0, their normalized combination xj=tj1 labelled jay belongs to Kj by finite convexity. For the finitely many zero tj, choose any xjKj using finite choice. Then tΔ and jtjxj=ay. This proves equality of the two sets.

F1F8step 1.4
3.1

The hull is compact by step 1.4 and step 2.1, and Hausdorffness gives closedness. Each singleton is compact since any cover has one member covering its sole point, and convex since its every combination is that point; hence finite point hulls are covered. Delete empty members of a finite family in their original order. If none remain, its union and hull are empty, and the empty subcover proves compactness. For one nonempty convex member the hull is that member. All choices made above are finite.

F1F7step 1.4step 2.1

Depends on

Used by

Dependency tree · two levels

52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources