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 be a nonempty finite set of sample indices and let for every . Put and . Among all constants , the unique minimizer of is , and the minimum value is .
Statement references
Facts & Assumptions
Given: A nonempty finite sample-index set and real responses .
Empirical axis-aligned binary decision trees: A regression leaf with sample set has , mean , and squared-error impurity .
The standard formulas on and on are inner products: For every , the standard coordinate dot product on is an inner product; in particular, identifying with supplies the standard inner products on both and .
The adjoint is characterised by : An adjoint satisfies for every and .
For a linear map between finite-dimensional inner-product spaces, minimises if and only if , equivalently ; minimisers exist and any two differ by an element of : For a linear map between finite-dimensional inner-product spaces, characterizes minimizers of ; minimizers exist.
Proof
Enumerate in increasing sample-index order as and define and . For all scalars , coordinatewise, so is linear.
Identify with . By [F2] for and , the standard coordinate inner products make and finite-dimensional inner-product spaces. Hence .
Define by . This map is linear, and for every and , . Thus is an adjoint of by [F3]. If another map also satisfied this identity, its value at each would differ from by a scalar pairing to zero with every , hence would equal by positive definiteness. Therefore .
Now [F4] applies to the linear map between these finite-dimensional inner-product spaces, with its adjoint established in step 3.1. The normal equation is , whose unique solution is because . By [F4], this solution is the unique minimizer.
Expanding around gives , since . Therefore the minimum value is .
Depends on
- Empirical axis-aligned binary decision trees
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- For a linear map $T:V\to W$ between finite-dimensional inner-product spaces, $x$ minimises $\lVert Tx-b\rVert$ if and only if $T^*(Tx-b)=0$, equivalently $T^*Tx=T^*b$; minimisers exist and any two differ by an element of $\ker T$
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
- Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The Elements of Statistical Learning, 2nd ed., §9.2.2 (standard reference, not scraped)
- MIT OpenCourseWare, 15.097, Lecture 8: Decision trees, slide 16 (standard reference, not scraped)