CAS I: A Geometric Coding Theorem
Abstract
This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. This result is a coding-theoretic restatement of a theorem of Trejo, Kreinovich and Longpré, who showed that the complexity of describing a string by a symmetry with that string as its unique fixed point equals its Kolmogorov complexity. Our contribution is to recast it in terms of algorithmic probability and to treat the symmetry group as a parameter, identifying fix-retractability as exactly the condition under which symmetry complexity collapses onto Kolmogorov complexity.
Related
- Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
- A Local Geometric Analysis of Maximal Coding Rate Reduction via Error Bounds
- Alexandrov's Theorem for Integral Varifolds and Applications to Geometric Inequalities
- Higher-order and non-geometric symmetries and Noether's theorem in k-cosymplectic Hamiltonian field theory
- Geometric lifting and Freiman's 3k−4 theorem in compact connected abelian groups
BibTeX
@misc{banerjee2026geometric,
title = {{CAS I: A Geometric Coding Theorem}},
author = {Romie Banerjee},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.13796},
eprint = {2607.13796},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.13796},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - CAS I: A Geometric Coding Theorem
AU - Romie Banerjee
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2607.13796
UR - https://arxiv.org/abs/2607.13796
AB - This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. This result is a coding-theoretic restatement of a theorem of Trejo, Kreinovich and Longpré, who showed that the complexity of describing a string by a symmetry with that string as its unique fixed point equals its Kolmogorov complexity. Our contribution is to recast it in terms of algorithmic probability and to treat the symmetry group as a parameter, identifying fix-retractability as exactly the condition under which symmetry complexity collapses onto Kolmogorov complexity.
ER -