Does there exist a finite set $S$ with a single binary operation $*$, where the only equational identities that hold are of the form $t=t$ for some term $t$?
2026-02-23 17:27:34.1771867654
Finite magma where the only equations are of the form "$t=t$"?
130 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGIC
- Theorems in MK would imply theorems in ZFC
- What is (mathematically) minimal computer architecture to run any software
- What formula proved in MK or Godel Incompleteness theorem
- Determine the truth value and validity of the propositions given
- Is this a commonly known paradox?
- Help with Propositional Logic Proof
- Symbol for assignment of a truth-value?
- Find the truth value of... empty set?
- Do I need the axiom of choice to prove this statement?
- Prove that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnf
Related Questions in MODEL-THEORY
- What is the definition of 'constructible group'?
- Translate into first order logic: "$a, b, c$ are the lengths of the sides of a triangle"
- Existence of indiscernible set in model equivalent to another indiscernible set
- A ring embeds in a field iff every finitely generated sub-ring does it
- Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree
- What would be the function to make a formula false?
- Sufficient condition for isomorphism of $L$-structures when $L$ is relational
- Show that PA can prove the pigeon-hole principle
- Decidability and "truth value"
- Prove or disprove: $\exists x \forall y \,\,\varphi \models \forall y \exists x \,\ \varphi$
Related Questions in UNIVERSAL-ALGEBRA
- What does it mean - "to derive" operation from some existing one on a particular set?
- Question on the composition of homomorphisms
- Algebraic theories, the category Set, and natural transformations
- Subdirect product of algebras
- Subdirect products
- Can we axiomatize a field starting with the binary operations and only “equational” axioms?
- What is non-algebraic structure
- $K$-free lattice on two generators where $K=\{$two element lattice$\}$
- Characterizing the algebras on $\mathbb(Z)/2\mathbb(Z)$
- Graphs in a regular category
Related Questions in MAGMA
- Is "(a * a') is cancellative" + "M has an identity" the same as "a has an inverse"
- Structures with $x*(y*z) = y*(x*z)$
- Terminology: Semigroups, only their "binary operations" aren't closed.
- Is there a name for an algebraic structure with only "addition" and "truncated subtraction"?
- Uniqueness of two side zeroes of binary operation
- What is an example of a groupoid which is not a semigroup?
- How many different operations can be defined in a finite groupoid with a given property?
- Subtraction Magmas
- Prove that there is no bijective homomorphism from $\left(\mathbb{Q},\ +\right)$ to $\left(\mathbb{Q_+^*},\ \times \right)$
- Notions of basis and span in a magma
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
In fact there is no finite magma which is generic even for one-variable terms.
Suppose $M$ is a finite magma. There are infinitely many one-variable terms but only finitely many functions $M\rightarrow M$; thus, there are distinct one-variable terms $t,s$ such that $t(a)=s(a)$ for all $a\in M$.
Note that it's important that we think about functions on $M$ as a whole rather than just individual elements: for example, for any set of $\vert M\vert+1$ one-variable terms $T$ there will be some $t,s\in T$ and $a\in M$ such that $t(a)=s(a)$, but there need not be distinct terms in $T$ which agree on all of $M$.
An interesting question is how many (parameter-free) one-variable terms there can be in a magma of size $n$ up to equality-of-corresponding-operations, as a function of $n$; of course we can get a trivial upper bound of $n^n$ by counting functions, but it's not clear to me that this upper bound is achievable. (We can also obviously ask the same question for arbitrary arity terms, with trivial upper bound of $n^{(n^{arity})}$, but already the unary case seems nontrivial to me.)