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.

Finite tie-broken projection searches are Borel measurable

Statement

Let n,N≥1 and let P1,…,PN be orthogonal projections in Rn onto fixed finite-dimensional subspaces V1,…,VN. Let c1,…,cN∈R be fixed. For y∈Rn, define qi(y):=n−1∥y−Piy∥22+ci, choose the least index attaining min⁡1≤i≤Nqi(y), and return its fitted vector Piy. The resulting map m^:Rn→Rn is Borel measurable. The index map is Borel measurable when {1,…,N} has its discrete sigma-algebra.

Facts & Assumptions

Given: A finite ordered list of fixed subspaces and their orthogonal projections, and fixed real penalties.

[F1]

Each finite-dimensional orthogonal projection is linear and continuous (Finite-dimensional orthogonal projections are linear and contractive).

[F3]

A measurable map is one whose inverse image of every target measurable set is measurable (A measurable function between measurable spaces).

[F4]

Every nonempty finite set of real scores has a minimum (Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum).

[F6]

The Euclidean inner product satisfies finite-dimensional Cauchy--Schwarz (The Cauchy-Schwarz inequality for finite sums).

[F7]

The Euclidean norm satisfies the triangle inequality, and expansion of squared norms gives ∥a∥22−∥b∥22=⟨a−b,a+b⟩ (The inner-product norm is definite, homogeneous, and satisfies the triangle inequality, Pythagoras, the parallelogram identity, and the real and complex polarisation identities).

Proof

1.1F1F6F7algebra

Put Ri=I−Pi. By [F1] and [F7], Ri is linear and ∥Riz∥2≤2∥z∥2. For y,z∈Rn, [F6] and [F7] give ∣∥Riy∥22−∥Riz∥22∣≤∥Ri(y−z)∥2 ∥Ri(y+z)∥2≤4∥y−z∥2 ∥y+z∥2. For fixed z, the last factor is bounded when y is near z, so the squared residual and hence qi are continuous.

2.1F2F4F5step 1.1algebra

By [F4], a minimum score exists. Its least minimizing index is i exactly on the set Ai=⋂j<i{y:qi(y)<qj(y)}∩⋂j>i{y:qi(y)≤qj(y)}. Each strict comparison is open and each non-strict comparison is closed because the score differences are continuous and [F5] applies to open and closed sets. Thus every Ai is Borel by [F2]; the sets are disjoint and cover Rn.

3.1F1F2F3F5step 2.1algebra∎

For any open O⊆Rn, m^−1(O)=⋃i=1N(Ai∩Pi−1(O)). Each Pi−1(O) is open by [F1, F5], so this finite union is Borel. If B ranges over subsets of Rn whose inverse images under m^ are Borel, those subsets form a sigma-algebra containing every open set; [F2] therefore puts every Borel B in this family. By [F3], m^ is Borel measurable. The index-map preimage of any set of indices is a finite union of the corresponding Ai, so the index map is measurable as well.

Depends on

Used by

Dependency tree · two levels

43 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