Re: Semigroup problem
- From: marcjhg@xxxxxxxxx
- Date: Sun, 11 May 2008 23:25:14 -0700 (PDT)
On May 12, 7:16 am, William Elliot <ma...@xxxxxxxxxxxxxxxxxx> wrote:
On Sun, 11 May 2008 marc...@xxxxxxxxx wrote:
Let * be a semigroup operation that satisfies the following
properties:
all z exists x exists y (x * y = z).
all x all y (F(x) * G(y) = y * x).
The problem is: prove that * is commutative or find a counterexample
(finite if it is possible) to this claim.
Yes, we're interested in this problem. Are you?
Assume we work in first-order logic with equality. I will use “all”
for the universal quantifier and “exists” for the existential
quantifier. The symbol != denotes inequality. F and G are functions of
arity 1. * is function of arity 2. I will use infix notation for *. (%
will be a symbol for comment)
The axioms are:
all x all y exists z (x * y = z). % Closure
all x all y all z (x * (y * z) = (x * y) * z). % Associativity
all z exists x exists y (x * y = z). % Surjectivity
all x all y (F(x) * G(y) = y * x). % “Weak
commutativity”
On the ground of these axioms only try to prove:
all x all y (x * y = y * x). % Commutativity
Or try to find a model (finite if it’s possible) in which holds:
exists x exists y (x * y != y * x). % Non-commutativity
Marc
.
- Follow-Ups:
- Re: Semigroup problem
- From: William Elliot
- Re: Semigroup problem
- From: Tim Little
- Re: Semigroup problem
- References:
- Semigroup problem
- From: marcjhg
- Re: Semigroup problem
- From: William Elliot
- Semigroup problem
- Prev by Date: Re: E = m c^2 and Riccati
- Next by Date: Re: Semigroup problem
- Previous by thread: Re: Semigroup problem
- Next by thread: Re: Semigroup problem
- Index(es):
Relevant Pages
|
Loading