Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 finite positive-spanning poll set has a positive uniform angle

Statement

For every finite positive-spanning list D=(d1,…,dm) in Rn, n≥1, the score ψD(v)=max⁡i(−⟨v,di⟩) on the unit sphere attains a strictly positive minimum. Write this minimum as κD>0. Thus for every v∈Rn there is di∈D with −⟨v,di⟩≥κD∥v∥2.

Facts & Assumptions

[F1]

For every unit vector u, positive spanning writes −u=∑iλidi with λi≥0 (Positive-spanning poll sets).

[F3]

By the coordinatewise vector-sum convention, ⟨u,∑iλidi⟩=∑k<nuk∑j<mλj+1(dj+1)k. Finite distributivity and reordering the two finite sums, using finite-sum additivity/scaling and induction on their lengths, gives ∑iλi⟨u,di⟩. A finite sum of nonnegative real terms is nonnegative (Positive-spanning poll sets, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Laws of finite sums and finite products).

[F4]

If M=max⁡i∣ai−bi∣ for two nonempty finite lists, then ai≤bi+M≤max⁡jbj+M for each i; taking maxima and reversing the lists gives ∣max⁡iai−max⁡ibi∣≤M (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[F5]

The unit sphere is nonempty, closed, and bounded. For n≥1, the standard vector e0 has Euclidean norm 1 (The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). If ∥x∥2≠1, choose ε=∣∥x∥2−1∣/2; the reverse triangle inequality shows every y with d2(x,y)<ε also has ∥y∥2≠1, so the complement is open. Every unit vector lies in B2(0,2), so the sphere is bounded. Hence it is compact by Heine–Borel (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).

[F6]

The reals form a totally ordered field makes R a totally ordered field, in particular the product of two strictly positive reals is positive; Multiplication by zero: 0⋅a=0 gives multiplication by zero. Hence if a,b≥0, either one is zero and ab=0 (using field commutativity if needed), or both are strictly positive and ab>0. Thus ab≥0.

Proof

1.1F1F3F6givenalgebra

Taking inner products of [F1] with u and using [F3] gives −1=∑iλi⟨u,di⟩. Since all λi≥0, at least one index with positive coefficient has ⟨u,di⟩<0; otherwise every summand is nonnegative by [F6] and [F3] makes the sum nonnegative, a contradiction. Hence ψD(u)>0 for every unit u.

2.1F2F4F5step 1.1givenalgebra∎

By [F4], ∣ψD(u)−ψD(w)∣≤max⁡i∣⟨u−w,di⟩∣, and [F2] bounds the right side by Dmax⁡∥u−w∥2, so the score is continuous. By [F5], the unit sphere is nonempty and compact. The extreme-value theorem gives a minimum attained at some unit u0; step 1.1 makes that attained value strictly positive. For nonzero v, apply this bound to u=v/∥v∥2 and multiply by ∥v∥2; for v=0 the inequality is immediate.

Depends on

Used by

Dependency tree · two levels

87 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