Skip to content
Structural Selection
graduatecorpus theoremestablished physics

What does Lemma A.1 (local uniqueness within a single outcome subspace's refinements) establish in the Structural Selection corpus, and what is its proof status?

Last reviewed 2026-07-12 · Structural Selection Physics Encyclopedia (AI-assisted pipeline) · This page was drafted by an AI system (Claude) processing the verified Structural Selection corpus and independently retrieved external physics sources, then passed through four scripted review passes (standard-physics, corpus-fidelity, mathematical, skeptical-referee) executed by the same system. It has not been reviewed by a human physicist. Report a problem via the corpus's Open Review page.

Direct answer

Lemma A.1 proves that, fixing one outcome subspace of dimension ≥ 2, among all outcome-weighting functions of the form f(‖ψᵢ‖) with f continuous or merely monotonic, the only choice consistent with additivity over orthogonal refinements *within that one subspace* is f(x) = kx² — the squared-norm form. It is marked `verified: true` and its proof (a direct reduction to Cauchy's functional equation) is complete and checkable, not asserted.

Standard physics

established physics

The reduction of an additivity condition to Cauchy's functional equation g(s+t) = g(s) + g(t), and the fact that continuity (or even just monotonicity, or measurability) forces the only solutions to be linear (g(t) = kt), is a standard, well-established result in real analysis, not specific to quantum foundations.

  • Lectures on Functional Equations and Their ApplicationsAcademic Press (Mathematics in Science and Engineering, vol. 19)source
  • Measures on the Closed Subspaces of a Hilbert SpaceIndiana University Mathematics Journalsource

Mathematical background

For an orthogonal refinement ℋᵢ = ⊕_α ℋᵢ,α, the Pythagorean/Parseval identity gives ‖ψᵢ‖² = Σ_α ‖ψᵢ,α‖². Writing g(t) := f(√t), the additivity requirement f(‖ψᵢ‖) 'splits' consistently over refinements becomes g(Σ_α t_α) = Σ_α g(t_α) for arbitrary non-negative t_α — exactly Cauchy's functional equation on the non-negative reals. Under continuity or monotonicity (either suffices, and both are physically reasonable regularity assumptions for a probability weight), the only solutions are g(t) = kt, i.e. f(x) = kx². This is a correct derivation, not an assumed shortcut — verified by tracing the substitution independently.

What remains open

This lemma is explicitly local: it only constrains f within the refinements of one already-fixed outcome subspace of dimension ≥ 2. It says nothing about consistency across different, unrelated resolutions of the identity (different measurement contexts) on the whole space — that global/cross-context step is, in the corpus's own words, 'the actual technical heart of Gleason's theorem,' and is not re-derived here. The corpus's own remark also explicitly retracts an apparent stronger claim: it states plainly that tensor-product composition does *not*, by itself, single out p=2 (product states satisfy μ_p(ψ⊗φ)=μ_p(ψ)μ_p(φ) for every p, not just p=2) — a real self-correction preserved in this page rather than smoothed over.

Structural Selection perspective

The corpus derives, under the following assumptions…

Given (a) an outcome-weighting rule that depends on ‖ψᵢ‖ through some continuous or monotonic function f, and (b) that this rule must be additive when the outcome subspace is refined into orthogonal pieces, the corpus derives f(x) = kx² as the only consistent choice — a real, checkable local result. The corpus's own text is notably self-critical here: it explicitly flags that a related claim about tensor-product composition forcing p=2 is false, and states the correct counterexample (μ_p factorizes for any p, not just p=2) rather than leaving the stronger, incorrect claim standing.

Corpus derivation / interpretation

corpus theorem

Lemma A.1 (verified): within one outcome subspace's orthogonal refinements, additivity forces f(x)=kx² for any continuous or monotonic f.

corpus derivation

The corpus explicitly corrects an adjacent, weaker claim: tensor-product composition does not single out p=2 by itself, since mu_p factorizes multiplicatively for every exponent p, not only p=2.

Comparison

The reduction to Cauchy's functional equation is a standard analytic technique, not a corpus invention — the same technique underlies other additivity-based derivations of the Born rule in the mainstream literature (e.g. some frame-function arguments). What distinguishes this page's account from a typical popular exposition is that the corpus explicitly names and retracts a stronger, incorrect adjacent claim (the tensor-product argument) rather than presenting only the successful derivation — this kind of visible self-correction is unusual to see stated this plainly and is reported here rather than omitted.

Falsifiability

Not independently falsifiable — this is a mathematical consequence of stated regularity assumptions (continuity/monotonicity) plus additivity, not an empirical claim distinguishable from standard quantum mechanics.

Limitations

Local to one subspace's refinements only; does not establish cross-context consistency (Gleason's actual hard step) or extend to dim ℋ = 2. The regularity assumption (continuity or monotonicity of f) is a real, physically-motivated but non-derived assumption — a discontinuous, non-monotonic f is not ruled out by this lemma alone without it.

References

Related questions

Theorem: lemma-a-1Theorem: lemma-a-2Chapter: appendix-a-technical-and-measure-theoretic-detailsSimulation: born-rule