If you can distinguish, you can express: Galois theory, Stone--Weierstrass, machine learning, and linguistics
Ben Blum-Smith, Claudia Brugman, Thomas Conners, Soledad Villar
TL;DR
The paper investigates a unifying principle connecting algebra, analysis, and linguistics by interpreting Stone–Weierstrass and the Fundamental Theorem of Galois Theory as two instantiations of distinguishing vs expressing. It presents an elementary theorem showing how SW-distinguishing data can be extended to subgroups via invariants that Galois-distinguish the subgroup, yielding $L^H = k(f_1,...,f_r,f^*_1,...,f^*_s)$. The authors apply this lens to machine learning contexts—graph learning, point clouds, and orbit recovery—showing that degree-3 invariants can generically separate orbits and generate invariant fields via Rosenlicht’s framework. They illustrate the linguistic side with Saussurean signs, demonstrating how expressive capacity emerges from structured distinctions across kin terms, pronouns, numerals, and color terms.
Abstract
This essay develops a parallel between the Fundamental Theorem of Galois Theory and the Stone--Weierstrass theorem: both can be viewed as assertions that tie the distinguishing power of a class of objects to their expressive power. We provide an elementary theorem connecting the relevant notions of "distinguishing power". We also discuss machine learning and data science contexts in which these theorems, and more generally the theme of links between distinguishing power and expressive power, appear. Finally, we discuss the same theme in the context of linguistics, where it appears as a foundational principle, and illustrate it with several examples.
