Infinite Identification without Finite Exact Tomography
Abstract
A countable transcript can identify two probability laws almost surely even though their coordinate laws are equivalent and no finite prefix admits an exact decoder.
Theorem 1.1 (Almost-sure infinite identification has no finite exact converse).
Proof. Machine-checked in Lean as D5/S3/ConceptDynamics/Experiment/InfiniteIdentificationFiniteInexactness.infinite_identification_not_finite_exact_tomography (✓ std3). ∎
Source. Repository-derived.
Commentary.
The two states generate independent Boolean product laws with constant success probabilities one third and two thirds. Both Boolean coordinate laws have full support, hence are mutually absolutely continuous.
The measurable classifier event consists of transcripts whose empirical means converge to two thirds. The strong law gives probability zero for this event in the lower state and probability one in the upper state.
At every finite prefix length, the all-false cylinder has positive mass under both product laws. A decoder that is almost surely correct would therefore have to label that same prefix both false and true.
Pinned Mathlib supplies Bernoulli laws, product-coordinate independence, the strong law, and convergence-event measurability. The repository’s canonical varying-marginal green-class theorem supplies finite-cylinder positivity.
References
- Truth anchor:
D5/S3/ConceptDynamics/Experiment/InfiniteIdentificationFiniteInexactness.infinite_identification_not_finite_exact_tomography - Dependency: D5/S0/Asymptotics/MetricGeometry/VaryingMarginalGreenClassMeasure