{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T05:21:49Z","timestamp":1767158509080,"version":"3.48.0"},"reference-count":43,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T00:00:00Z","timestamp":1766880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We propose a unified mathematical framework showing that the representational universality of modern foundational models arises from a shared finite latent domain. Building on the Finite Ring Continuum (FRC) framework, we model all modalities as epistemic projections of a common latent set Z\u2282Ut, where Ut is a symmetry-complete finite-field shell. Using the uniqueness of minimal adequate representations, we prove the Universal Subspace Theorem, establishing that independently trained embeddings coincide, up to bijection, as coordinate charts on the same latent structure. This result explains cross-modal alignment, transferability, and semantic coherence as consequences of finite relational geometry rather than architectural similarity. The framework links representation learning, sufficiency theory, and FRC algebra, providing a principled foundation for universal latent structure in multimodal models.<\/jats:p>","DOI":"10.3390\/e28010040","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T06:25:51Z","timestamp":1766989551000},"page":"40","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal Latent Representation in Finite Ring Continuum"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3836-8091","authenticated-orcid":false,"given":"Yosef","family":"Akhtman","sequence":"first","affiliation":[{"name":"Gamma Earth S\u00e0rl, 1162 St-Prex, Switzerland"},{"name":"Faculty of Space Technologies, AGH University of Krakow, 30-059 Krakow, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1109\/TPAMI.2013.50","article-title":"Representation Learning: A Review and New Perspectives","volume":"35","author":"Bengio","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_2","unstructured":"Goodfellow, I., Bengio, Y., and Courville, A. (2016). Deep Learning, MIT Press."},{"key":"ref_3","first-page":"1791","article-title":"Linguistic generalization and compositionality in modern artificial neural networks","volume":"375","author":"Baroni","year":"2019","journal-title":"Philos. Trans. R. Soc. B"},{"key":"ref_4","first-page":"8748","article-title":"Learning Transferable Visual Models From Natural Language Supervision","volume":"Volume 139","author":"Radford","year":"2021","journal-title":"Proceedings of the 38th International Conference on Machine Learning (ICML)"},{"key":"ref_5","first-page":"305","article-title":"Completeness, Similar Regions, and Unbiased Estimation. Part I","volume":"10","author":"Lehmann","year":"1950","journal-title":"Sankhy\u0101"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Keener, R.W. (2010). Theoretical Statistics: Topics for a Core Course, Springer. Springer Texts in Statistics.","DOI":"10.1007\/978-0-387-93839-4"},{"key":"ref_7","unstructured":"Bishop, C.M. (2006). Pattern Recognition and Machine Learning, Springer."},{"key":"ref_8","unstructured":"Murphy, K.P. (2023). Probabilistic Machine Learning: Advanced Topics, MIT Press."},{"key":"ref_9","unstructured":"Bronstein, M.M., Bruna, J., Cohen, T., and Veli\u010dkovi\u0107, P. (2021). Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges. arXiv."},{"key":"ref_10","first-page":"3307","article-title":"Symmetry, Invariance, and Deep Convolutional Networks","volume":"113","author":"Anselmi","year":"2016","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"30039","DOI":"10.1073\/pnas.1907369117","article-title":"Theoretical Issues in Deep Networks","volume":"117","author":"Poggio","year":"2020","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_12","unstructured":"Telgarsky, M. (2016, January 23\u201326). Benefits of Depth in Neural Networks. Proceedings of the 29th Annual Conference on Learning Theory (COLT), New York, NY, USA."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Tishby, N., and Zaslavsky, N. (May, January 26). Deep Learning and the Information Bottleneck Principle. Proceedings of the 2015 IEEE Information Theory Workshop (ITW), Jerusalem, Israel.","DOI":"10.1109\/ITW.2015.7133169"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Akhtman, Y. (2025). Relativistic Algebra over Finite Ring Continuum. Axioms, 14.","DOI":"10.20944\/preprints202505.2118.v7"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Akhtman, Y. (2025). Euclidean\u2013Lorentzian Dichotomy and Algebraic Causality in Finite Ring Continuum. Entropy, 27.","DOI":"10.20944\/preprints202508.2175.v3"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Akhtman, Y. (2025). Schr\u00f6dinger\u2013Dirac Formalism in Finite Ring Continuum. Preprints.","DOI":"10.20944\/preprints202510.1486.v1"},{"key":"ref_17","unstructured":"Zhang, C., Bengio, S., Hardt, M., Recht, B., and Vinyals, O. (2017, January 24\u201326). Understanding Deep Learning Requires Rethinking Generalization. Proceedings of the International Conference on Learning Representations (ICLR), Toulon, France."},{"key":"ref_18","unstructured":"Power, A., Burda, Y., Edwards, H., Babuschkin, I., and Misra, V. (2022). Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets. arXiv."},{"key":"ref_19","unstructured":"Wei, J., Tay, Y., Bommasani, R., Raffel, C., Zoph, B., Borgeaud, S., Yogatama, D., Bosma, M., Zhou, D., and Metzler, D. (2022). Emergent Abilities of Large Language Models. arXiv."},{"key":"ref_20","unstructured":"Hernandez, D., Brown, T.B., Conerly, T., Kaplan, J., McCandlish, S., Amodei, D., and Henighan, T. (2022). Scaling Laws for Transfer. arXiv."},{"key":"ref_21","unstructured":"Burns, C., Ye, H., Klein, D., and Steinhardt, J. (2022). Discovering Latent Knowledge in Language Models Without Supervision. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Akhtman, Y. (2025). The Algebra of Being: Finitude, Evolution, Comprehension. Preprints.","DOI":"10.20944\/preprints202512.1260.v1"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Akhtman, Y. (2025). Paradoxes of Infinity as Reductio ad Absurdum. Preprints.","DOI":"10.20944\/preprints202508.1744.v1"},{"key":"ref_24","unstructured":"Barber, D. (2022). Bayesian Reasoning and Machine Learning, Cambridge University Press."},{"key":"ref_25","first-page":"1","article-title":"Learning Functions: When Is Deep Better Than Shallow","volume":"29","author":"Mhaskar","year":"2016","journal-title":"Neural Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","article-title":"Multilayer Feedforward Networks Are Universal Approximators","volume":"2","author":"Hornik","year":"1989","journal-title":"Neural Netw."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1038\/nrn2787","article-title":"The Free-Energy Principle: A Unified Brain Theory?","volume":"11","author":"Friston","year":"2010","journal-title":"Nat. Rev. Neurosci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1038\/381607a0","article-title":"Emergence of Simple-Cell Receptive Field Properties by Learning a Sparse Code for Natural Images","volume":"381","author":"Olshausen","year":"1996","journal-title":"Nature"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"21737","DOI":"10.1073\/pnas.1820226116","article-title":"A Mathematical Theory of Semantic Development in Deep Neural Networks","volume":"116","author":"Saxe","year":"2019","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_30","unstructured":"Brown, T., Mann, B., Ryder, N., Subbiah, M., Kaplan, J.D., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., and Askell, A. (2020, January 6\u201312). Language Models are Few-Shot Learners. Proceedings of the Advances in Neural Information Processing Systems (NeurIPS), Virtual."},{"key":"ref_31","unstructured":"Chen, T., Kornblith, S., Norouzi, M., and Hinton, G. (2020, January 12\u201318). A Simple Framework for Contrastive Learning of Visual Representations. Proceedings of the 37th International Conference on Machine Learning (ICML), Vienna, Austria."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"He, K., Fan, H., Wu, Y., Xie, S., and Girshick, R. (2020, January 14\u201319). Momentum Contrast for Unsupervised Visual Representation Learning. Proceedings of the CVPR, Virtual.","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"ref_33","unstructured":"van den Oord, A., Li, Y., and Vinyals, O. (2018). Representation Learning with Contrastive Predictive Coding. arXiv."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Gao, T., Yao, X., and Chen, D. (2021, January 7\u201311). SimCSE: Simple Contrastive Learning of Sentence Embeddings. Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, Punta Cana, Dominican Republic.","DOI":"10.18653\/v1\/2021.emnlp-main.552"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Ethayarajh, K. (2019, January 3\u20137). How Contextual Are Contextualized Word Representations?. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), Hong Kong, China.","DOI":"10.18653\/v1\/D19-1006"},{"key":"ref_36","unstructured":"Wang, T., and Isola, P. (2020, January 12\u201318). Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hypersphere. Proceedings of the 37th International Conference on Machine Learning, Vienna, Austria."},{"key":"ref_37","unstructured":"Ledoux, M. (2001). The Concentration of Measure Phenomenon, American Mathematical Society."},{"key":"ref_38","first-page":"1","article-title":"An Elementary Introduction to Modern Convex Geometry","volume":"31","author":"Ball","year":"1997","journal-title":"Flavors Geom."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/103162.103163","article-title":"What Every Computer Scientist Should Know About Floating-Point Arithmetic","volume":"23","author":"Goldberg","year":"1991","journal-title":"ACM Comput. Surv."},{"key":"ref_40","unstructured":"(2008). IEEE Standard for Floating-Point Arithmetic (Standard No. IEEE 754-2008)."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Conway, J.H., and Sloane, N.J.A. (1999). Sphere Packings, Lattices and Groups, Springer. [3rd ed.].","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"ref_42","first-page":"173","article-title":"\u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I","volume":"38","year":"1931","journal-title":"Monatshefte Math. Phys."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Smullyan, R. (1991). G\u00f6del\u2019s Incompleteness Theorems, Oxford University Press.","DOI":"10.1093\/oso\/9780195046724.001.0001"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/40\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T05:19:40Z","timestamp":1767158380000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/1\/40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,28]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["e28010040"],"URL":"https:\/\/doi.org\/10.3390\/e28010040","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,12,28]]}}}