Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

A finitely generated cone in Euclidean space is closed

Statement

For any finite list a1,…,am∈Rn, including the empty list, the cone

K={∑j=1mtjaj:tj≥0}

is a closed convex subset of Rn.

Facts & Assumptions

Given: The vectors and cone in the Statement, with the Euclidean inner product of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

[F1]

Every finite-dimensional normed subspace is closed in its ambient normed space, including the zero subspace (A finite-dimensional normed subspace is closed).

Proof

1.1givenchoosealgebra

Every y∈K has a representation whose positive-coefficient vectors are linearly independent. Start with any nonnegative coefficient list and discard its zero coefficients. If its remaining vectors are dependent, take a nonzero relation ∑jcjaj=0 and change its sign so some cj>0. For the current positive coefficients tj, put s=min⁡cj>0tj/cj. Replacing each tj by tj−scj preserves the represented vector, leaves every coefficient nonnegative, and makes at least one positive coefficient zero. Repeating at most m times leaves an independent positive support.

1.2givenF1F2algebra

Fix an independent index set J and let AJ have columns aj, j∈J. Its Gram matrix GJ=AJTAJ is invertible: for every nonzero v, vTGJv=∥AJv∥22>0 by independence. Put BJ=GJ−1AJT, define RJ(y)=BJy on Rn, and set LJ=(∑r=1∣J∣∑s=1n(BJ)rs2)1/2. Applying [F2] to each row gives ∥RJ(y)−RJ(y′)∥22≤LJ2∥y−y′∥22, so RJ is Lipschitz with finite constant LJ, hence continuous. On the closed subspace SJ=span⁡{aj:j∈J} it satisfies AJRJ(y)=y. Hence AJ(R≥0∣J∣)=SJ∩RJ−1(R≥0∣J∣) is closed: SJ is closed by [F1], the nonnegative orthant is closed, and RJ is continuous. For J=∅ this cone is {0}, also closed.

2.1step 1.1step 1.2algebra∎

By step 1.1, K is the union of the cones in step 1.2 over independent subsets J⊆{1,…,m}. There are only finitely many such subsets, so this union is closed. Each component is a convex cone, and directly taking nonnegative combinations shows K is convex.

Depends on

Used by

Dependency tree · two levels

36 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