Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Supporting hyperplanes at relative boundary points

Statement

For nonempty C, define aff⁡C={∑j=1Najcj:N≥1, cj∈C, aj∈R, ∑jaj=1}. An affine Euclidean space is a translate of a finite-dimensional real linear subspace with the induced Euclidean metric. A supporting hyperplane at z is {q:n⋅(q−z)=0} for a nonzero vector n, with z in the set and all its points in one closed half-space. Let C be a nonempty convex set in a finite-dimensional affine Euclidean space H of dimension k≥1, let aff⁡C=H, and put K=C‾ H. If z∈∂HK (that is, z∈K and every relative neighborhood of z meets H∖K), then there is a nonzero linear functional ℓ on the translation space of H such that ℓ(q−z)≤0 for all q∈C. If C⊂Rd has affine dimension at most d−2, then every z∈C has at least two distinct ambient supporting hyperplanes containing aff⁡C.

Facts & Assumptions

Given: The stated finite-dimensional affine Euclidean space and convex set.

[F3]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: Euclidean coordinates identify linear functionals with vectors and give the usual unit sphere.

[F4]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real function on a nonempty compact metric space attains its minimum.

[F5]

Unit spheres in finite-dimensional normed spaces are sequentially compact: unit spheres in finite-dimensional normed spaces are sequentially compact without a choice principle.

[F6]

The rationals embed densely in the reals: rational coordinates are dense in real coordinates.

[F7]

Reciprocals of the positive integers decrease to zero supplies the positive real sequence ϵm=1/ιN(σ(m)), m∈N, decreasing to zero with the canonical-natural field convention.

Proof

1.1givenF3F6F7construct

Fix affine coordinates H≅Rk. Closure preserves convexity without choosing approximating sequences: for x,y∈K and any ϵ>0, choose two points of C within ϵ of them; their convex combination approximates (1−t)x+ty within ϵ, so this point lies in K. Enumerate rational k-tuples canonically by increasing sums of absolute numerators and positive denominators, breaking the finite ties lexicographically. Density [F6] and the open complement of K show that for each m∈N at least one enumerated point lies in B(z,ϵm)∖K. Let zm be the first such point. This is a uniquely specified sequence with zm→z, not a countable selection of arbitrary witnesses.

2.1F2F3F4step 1.1algebra

The nonempty compact set K∩B‾(zm,∥zm−z∥+1) contains z. By [F2] and [F4], squared distance to zm attains a minimum there, and every point outside that ball is farther than the candidate z. Thus a nearest point qm∈K exists. It is unique: if two distinct minimizers had squared distance dm2, their midpoint would have squared distance dm2−∥qm−qm′∥2/4, contradicting minimality and convexity. Consequently (qm) is also canonically determined. Since zm∉K, put um=(zm−qm)/∥zm−qm∥. Expanding the distance at qm+t(q−qm) and letting t↓0 gives um⋅(q−qm)≤0 for every q∈K. Also ∥qm−z∥≤2∥zm−z∥→0.

3.1F3F5step 2.1

Every um has norm one. The exact choice-free sequential-compactness supplier [F5] gives a subsequence converging to a unit vector u. This introduces no additional choice hypothesis.

4.1F3step 2.1step 3.1algebra

For every q∈K, pass to the limit in um⋅(q−qm)≤0 along that subsequence. Continuity of the Euclidean pairing and qm→z give u⋅(q−z)≤0. The unit vector u defines a nonzero supporting functional for K, hence for C, at z.

5.1givenF3algebra∎

If C⊂Rd has affine hull H of dimension at most d−2, write its direction space as the span of k≤d−2 independent vectors b1,…,bk. Its orthogonal complement is the solution space of the k homogeneous equations bj⋅n=0. Row reduction has at most k pivot variables, leaving at least d−k≥2 free variables. Assigning one free variable the value one and the others zero gives two independent solutions (their free-coordinate vectors are different unit vectors). Thus choose two nonparallel nonzero normals n1,n2 orthogonal to the direction space of H. For each j, the hyperplane {q:nj⋅(q−z)=0} contains H and therefore supports C at z. The two hyperplanes are distinct because their normals are not parallel.

Depends on

Dependency tree · 2 levels

Sources