Lemma A.1 — local uniqueness within a single outcome subspace's refinements
Formal statement
\emphFix an outcome subspace with . Among all assignments of the form with continuous (or merely monotonic), the only choice consistent with additivity over orthogonal refinements of (condition A.2.3) is for a constant .
Proof. By the Pythagorean theorem, an orthogonal refinement satisfies . Writing for , additivity becomes for arbitrary non-negative summing to (realizable because allows continuously varying splits). This is Cauchy's functional equation on ; under continuity (or monotonicity), , hence .
Remark (what this does and does not establish). Lemma A.1 fixes the exponent to 2 only for outcome subspaces of dimension , and only for consistency of within one subspace's own internal refinements. It does not by itself show that a single function can be chosen consistently across every possible resolution of the identity on (i.e. across every choice of measurement context) — the cross-context/global-consistency step that is the actual technical heart of Gleason's theorem, and the reason that theorem requires and is known to fail at . Nor does it treat mixed states. \textbfThe claim that tensor-product composition singles out (as opposed to normalization, addressed separately in Lemma A.2 below) is false: for product states, , so for every , not only .
Source
Appendix A. Technical and Measure-Theoretic Details — Born Rule from Stability & Measure Geometry
03_BornRule_From_Stability_MeasureGeometry/08_Appendix_A.tex
Revision history
This source file received at least one correction during the v2 audit — see the changelog for the exact change; not every statement in the file was necessarily the one corrected.