Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

The sample mean uniquely minimizes squared error on a nonempty leaf

Statement

Let I be a nonempty finite set of sample indices and let yi∈R for every i∈I. Put N=∣I∣ and yˉI=N−1∑i∈Iyi. Among all constants c∈R, the unique minimizer of ∑i∈I(yi−c)2 is c=yˉI, and the minimum value is ∑i∈I(yi−yˉI)2.

Facts & Assumptions

Given: A nonempty finite sample-index set I and real responses (yi)i∈I.

[F1]

Empirical axis-aligned binary decision trees: A regression leaf with sample set I has NI=∣I∣≥1, mean yˉI=NI−1∑i∈Iyi, and squared-error impurity QI=NI−1∑i∈I(yi−yˉI)2.

[F2]

The standard formulas ⟨x,y⟩=∑k<nxkyk on Rn and ∑k<nxkyk‾ on Cn are inner products: For every n, the standard coordinate dot product on Rn is an inner product; in particular, identifying R with R1 supplies the standard inner products on both R and RN.

[F3]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: An adjoint satisfies ⟨Ta,v⟩=⟨a,T∗v⟩ for every a and v.

Proof

1.1givenconstructalgebra

Enumerate I in increasing sample-index order as i1,…,iN and define T(c)=(c,…,c) and b=(yi1,…,yiN). For all scalars a,c,d∈R, T(ac+d)=aT(c)+T(d) coordinatewise, so T is linear.

2.1F2step 1.1algebra

Identify R with R1. By [F2] for n=1 and n=N, the standard coordinate inner products make R and RN finite-dimensional inner-product spaces. Hence ∥Tc−b∥2=∑i∈I(yi−c)2.

3.1F2F3step 1.1step 2.1algebraconstruct

Define S:RN→R by S(v1,…,vN)=∑k=1Nvk. This map is linear, and for every c∈R and v∈RN, ⟨T(c),v⟩RN=c∑k=1Nvk=⟨c,S(v)⟩R. Thus S is an adjoint of T by [F3]. If another map also satisfied this identity, its value at each v would differ from S(v) by a scalar pairing to zero with every c∈R, hence would equal S(v) by positive definiteness. Therefore T∗=S.

4.1F4step 1.1step 2.1step 3.1algebraF1

Now [F4] applies to the linear map T between these finite-dimensional inner-product spaces, with its adjoint established in step 3.1. The normal equation T∗(Tc−b)=0 is Nc−∑i∈Iyi=0, whose unique solution is c=yˉI because N≥1. By [F4], this solution is the unique minimizer.

5.1givenstep 4.1algebra∎

Expanding around yˉI gives ∑i∈I(yi−c)2=∑i∈I(yi−yˉI)2+N(c−yˉI)2, since ∑i∈I(yi−yˉI)=0. Therefore the minimum value is ∑i∈I(yi−yˉI)2.

Depends on

Used by

Dependency tree · two levels

13 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