Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Green-Class Mass and Naming Conservation

Abstract

Uniform Green mass and countable-name conservation share one product carrier.

Theorem 1.1 (Finite certificates retain mass while countable names remain null).

Proof. Machine-checked in Lean as D5/S0/Naming/Conservation/GreenClassNamingConservation.green_class_naming_conservation (✓ std3). ∎

Source. Repository-derived.

Commentary.

Let O be a finite nontrivial discrete measurable alphabet and equip the sequence space N -> O with the canonical uniform product probability measure stringMeasure O. A finite support S and target t determine the canonical greenClass S t.

The green class has mass exactly (card O)^(-1) raised to card S and that mass is positive. Thus the value depends on the certificate budget and not on the pinned content.

For every countably indexed family of canonical NamingSystem values, the union of named images is countable and null, while its complement has measure one. For every system and every height budget, the complement of the corresponding finite layer image also has measure one.

The exact cylinder calculation and positivity are supplied by the frozen GreenClassMeasure declarations. The frozen NamingTowerConservation declaration supplies countability, nullity, and full-measure complement. Atomlessness of the same product measure follows from the imported critical-diameter estimate; probability normalization then also proves the sequence carrier uncountable.

References