Probabilistic equational spectrum, primality and approximation in finite algebras
Abstract
We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We study fundamental properties of this spectrum, such as density and limit points, and show that its structure is related to several notions of primality of an algebra. We introduce a quantitative measure of primality ()∈[0,1] that characterizes the functional approximation capacity. We show that the degree of primality is related to the size of the spectrum. We also prove that all non-primal two-element algebras satisfy the universal bound () 1/2.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.