Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
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.

Error bound for a finite simplex and affine slice

Statement

Let d≥1, let Δd={p∈Rd:pi≥0,∑ipi=1}, let M:Rd→Rr be linear, and let F={q∈Δd:Mq=b} be nonempty. There is a finite H such that dist⁡2(p,F)≤H∥Mp−b∥2(p∈Δd).

Facts & Assumptions

Given: The finite-dimensional simplex, linear map, and nonempty affine slice in the Statement.

[F1]

Every point has a unique nearest point in a nonempty closed Euclidean convex set: every point of Euclidean space has a unique nearest point in a nonempty closed convex set.

[F2]

Metric projection onto a closed convex set satisfies the variational inequality: if q is the nearest point in a closed convex set to p, then ⟨p−q,z−q⟩≤0 for every point z in that set.

[F3]

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: closed bounded subsets of finite-dimensional Euclidean space are compact, and continuous real functions attain minima on nonempty compact sets.

Proof

1.1givenalgebra

For each support set J⊆{1,…,d} realized as J=supp⁡q by some q∈F, define CJ={v:∑ivi=0, vi≥0 (i∉J), ⟨v,w⟩≤0 for every w with ∑iwi=0, Mw=0, wi≥0 (i∉J)}. This is a closed cone, being an intersection of closed linear constraints and closed half-spaces. If v∈CJ and Mv=0, then v is an allowed w in its defining inequality, hence ∥v∥22≤0 and v=0.

1.2F1givenconstruct

The set F=Δd∩M−1{b} is nonempty, closed, and convex: in coordinates it is given by finitely many closed linear inequalities and affine equations. Thus [F1] applies. Suppose p∉F and let q be its nearest point in F. Put J=supp⁡q and v=(p−q)/∥p−q∥2. Then ∑ivi=0 and vi≥0 outside J, because pi≥0=qi there.

2.1F1F2F3step 1.1algebra

For each realized J, the set CJ∩{v:∥v∥2=1} is compact by [F3]. If nonempty, the continuous function v↦∥Mv∥2 has a positive minimum cJ: a zero would contradict step 1.1. There are finitely many J, so the minimum c of these positive cJ is positive whenever any such unit section is nonempty. If all are empty, suppose p∉F and take its nearest point q∈F by [F1]. With J=supp⁡q and v=(p−q)/∥p−q∥2, every vector w in the tangent conditions defining CJ has q+tw∈F for small t>0. [F2] then gives ⟨v,w⟩≤0, so v∈CJ and ∥v∥2=1, a contradiction. Hence F=Δd and the claim is immediate.

2.2F2step 1.2givenalgebra

If w satisfies the linear and sign conditions in the definition of CJ, then q+tw∈F for all sufficiently small t>0: the affine equations are preserved, coordinates outside J remain nonnegative, and the finitely many positive coordinates of q on J remain positive. By [F2], ⟨p−q,tw⟩≤0, so ⟨v,w⟩≤0 and v∈CJ.

3.1step 2.1step 1.2step 2.2algebra∎

For the nontrivial case of step 2.1, homogeneity and its constant c give ∥Mp−b∥2=∥M(p−q)∥2=∥p−q∥2∥Mv∥2≥cdist⁡2(p,F). Taking H=1/c proves the result for p∉F; for p∈F the left side is zero. In the empty-unit-section case from step 2.1, F=Δd and any H>0 works.

Depends on

Used by

Dependency tree · two levels

14 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