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 in , , the score on the unit sphere attains a strictly positive minimum. Write this minimum as . Thus for every there is with .
Facts & Assumptions
Given: Positive spanning and directional score Positive-spanning poll sets, Euclidean geometry The Euclidean inner product on , compactness and extrema (Heine-Borel in : with the Euclidean metric a subset of 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, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
For every unit vector , positive spanning writes with (Positive-spanning poll sets).
By the coordinatewise vector-sum convention, . Finite distributivity and reordering the two finite sums, using finite-sum additivity/scaling and induction on their lengths, gives . A finite sum of nonnegative real terms is nonnegative (Positive-spanning poll sets, The Euclidean inner product on , Laws of finite sums and finite products).
If for two nonempty finite lists, then for each ; taking maxima and reversing the lists gives (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
The unit sphere is nonempty, closed, and bounded. For , the standard vector has Euclidean norm (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension , The Euclidean inner product on ). If , choose ; the reverse triangle inequality shows every with also has , so the complement is open. Every unit vector lies in , so the sphere is bounded. Hence it is compact by Heine–Borel (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation, Metric space: iff , 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 : with the Euclidean metric a subset of 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).
The reals form a totally ordered field makes a totally ordered field, in particular the product of two strictly positive reals is positive; Multiplication by zero: gives multiplication by zero. Hence if , either one is zero and (using field commutativity if needed), or both are strictly positive and . Thus .
Proof
Taking inner products of [F1] with and using [F3] gives . Since all , at least one index with positive coefficient has ; otherwise every summand is nonnegative by [F6] and [F3] makes the sum nonnegative, a contradiction. Hence for every unit .
By [F4], , and [F2] bounds the right side by , 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 ; step 1.1 makes that attained value strictly positive. For nonzero , apply this bound to and multiply by ; for the inequality is immediate.
Depends on
- Positive-spanning poll sets
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- Laws of finite sums and finite products
- The reals form a totally ordered field
- Multiplication by zero: $0 \cdot a = 0$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_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 $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Every nonempty finite set of reals has a maximum and a minimum
- Maximum and minimum of a set
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
- A. R. Conn, K. Scheinberg, and L. N. Vicente, Introduction to Derivative-Free Optimization, §§2.1–2.2 and ch. 8 (standard reference, not scraped)
- Tamara G. Kolda, Robert Michael Lewis, and Virginia Torczon, Optimization by Direct Search, §§3.1–3.6 (standard reference, not scraped)