Result · OPEN-DS-POP-COMMON-METRIC
Stationary profiled population quantizers are efficient-Voronoi
Proved here, no precedent foundindependently auditedpublication: internal
Meaning
An efficient projection describes stationarity under regularity assumptions, but stationarity alone does not force distinct projected centres.
Statement
For atomless P with finite second moments and a quantizer with positive cell masses and nonsingular I_q, bounded-study first-order stationarity of Phi_Ds is equivalent to a.e. assignment to the nearest projected centroid e_b=C mu_b of the efficient projection e(s)=Cs in the S_psi(I_q)^{-1} metric (G_s = C^T S_psi^{-1} C). The rule reproduces the partition iff projected centroids are pairwise distinct and tie hyperplanes are null; stationarity does not force distinct projected centroids.
Assumptions
P atomless, E[S]=0, E||S||^2 finite
all cell masses positive, I_q nonsingular (hence nuisance block nonsingular)
stationarity tested against bounded-barycenter study relocations
atomlessness is load-bearing only for necessity (stationary => nearest rule); sufficiency holds for every P
deployability characterization read selection-independently: the nearest-centroid correspondence is a.e. single-valued and reproduces q iff centroids are distinct and tie hyperplanes are null
population-side geometry of the finite-to-population bridge
Where it stops
Bounded by
- CE-DS-POP-WASTED-CELLS-001
A first-order stationary population profiled-Ds quantizer has pairwise-distinct efficient-projected centroids, so its cells can always be recovered from a common efficient-semimetric nearest-cell rule.
- CE-DS-GLOBAL-GEOMETRY-001
Every finite globally optimal Ds assignment is self-consistent under its own first-order efficient-score/common-semimetric nearest-cell rule.
Relationships
Rests on
Enables
- Conditional finite-to-population Ds bridgeOPEN-DS-FINITE-POP-BRIDGE
- Population-stationary Ds partitions can defeat every efficient-semimetric ruleDS-POP-WASTED-CELLS
- Conditional centering empties the margin-certified stable branchDS-STABLE-BASINS-CENTERED-OBSTRUCTION
- Inhabitation reduces to a scalar root equation per lawDS-STABLE-BASINS-FIXED-POINT-GATE
- Merged-branch margins on LCM laws live only in wasted cells and never compileDS-STABLE-BASINS-LCM-CLASSIFICATION
Verified by
Open next door
Local graph
Proof
DS12. Population stationary geometry for profiled $D_s$
Let be atomless with , , and let have for all and . Call bounded-study stationary if for every and every ,
where relabels the measurable set to cell . (Any local maximizer over small-mass bounded relocations is bounded-study stationary.)
Study dictionary. depends on the partition only through , so relabeling a set with mass and barycenter changes exactly as the finite rank-two relocation D2 of the weighted point : , , , . All finite relocation algebra transfers verbatim to population studies.
Theorem. is bounded-study stationary iff for every , -a.e. and every :
Moreover with , so the rule reads: assign a.e. to the nearest projected centroid of the efficient projection in the metric,
Proof. The pairwise first-variation function is affine in (the quadratic terms cancel; this is G1's common- affinity). with is on a neighborhood of with (DS2), so for a study with bounded barycenter the exact update gives , with the remainder uniform over .
(⟹) If had for some , atomlessness supplies studies with ; affinity gives (the barycenter average of an affine function), so the gain per unit mass is at least , contradicting stationarity.
(⟸) For any study , affinity gives , so the gain is and the limsup is . ∎
The factorization follows from the block inverse: , , .
Deployability characterization (an earlier, since-closed question). The nearest-projected-centroid
correspondence is -a.e. single-valued and reproduces up to null
sets iff (i) the projected centroids are pairwise distinct and
(ii) charges no pairwise tie hyperplane (each tie set is affine in
; both conditions hold e.g. when is absolutely continuous and
(i) holds). (Audit hardening: the selection-independent reading is the correct
one — a tie-breaking selection could reproduce even when (ii) fails,
so the characterization is about the rule being determined by the geometry
alone; audit §8. Note also the asymmetry: sufficiency (⟸) of the stationarity
theorem above holds for every , while necessity (⟹) genuinely needs
atomlessness — for a finitely atomic law bounded-study stationarity is
vacuous and CE-DS-GLOBAL-GEOMETRY-001 violates the rule.) Stationarity
does not force (i): CE-DS-POP-WASTED-CELLS-001 is a stationary partition
(zero violations, ties allowed) whose coincident-centroid cell pairs no
efficient-semimetric rule can separate — in sharp contrast to finite D, where
exchange stability forces distinct centroids (D5). Without (i), stationarity
constrains exactly the reduced partition obtained by merging
coincident- groups (cf. DS11(d)).
From Profiled Ds: from a sample to the population · chapter contents
Independently audited. The audit report.