Bourbaki

Exercise 24, § 4

Algebra, I, 137

(a) Given any set E, consider in the set E×EE \times E the law of composition, not everywhere defined, written multiplicatively, under which the composition of (x,y)(x, y) and (y′,z)(y', z) is only defined if y′=yy' = y and in this case has the value (x,z)(x, z). Show that E×EE \times E, with this law of composition, is a groupoid (Exercise 23).

(b) Let (x,y)≡(x′,y′)(x, y) \equiv (x', y') (R) be an equivalence relation compatible with the above composition (that is such that (x,y)≡(x′,y′)(x, y) \equiv (x', y') and (y,z)≡(y′,z′)(y, z) \equiv (y', z') imply (x,z)≡(x′,z′)(x, z) \equiv (x', z')); suppose further that the relation R satisfies the following condition: for all x,y,zx, y, z there exists one and only one t∈Et \in E such that (x,y)≡(z,t)(x, y) \equiv (z, t) and there exists a u∈Eu \in E such that (x,y)≡(u,z)(x, y) \equiv (u, z).

Show that under these conditions the quotient structure by R of the groupoid structure on E×EE \times E is a group structure (prove first that the quotient law is everywhere defined, since, if x˙,y˙,z˙\dot{x}, \dot{y}, \dot{z} are three classes such that x˙y˙=x˙z˙\dot{x}\dot{y} = \dot{x}\dot{z}, then y˙=z˙\dot{y} = \dot{z}; establish finally that, for all x∈E,y∈E,(x,x)≡(y,y)x \in E, y \in E, (x, x) \equiv (y, y)).

(c) Let G be the group obtained by giving the quotient of E×EE \times E by R the above structure. Let aa be any element of E; if, for all x∈E,fa(x)x \in E, f_a(x) denotes the class mod. R of (a,x)(a, x), show that faf_a is a bijective mapping of E onto G and that the relation (x,y)≡(x′,y′)(x, y) \equiv (x', y') is equivalent to the relation

fa(x)(fa(x′))−1=fa(y)(fa(y′))−1. f_a(x)(f_a(x'))^{-1} = f_a(y)(f_a(y'))^{-1}.

For G to be commutative, it is necessary and sufficient that the relation (x,y)≡(x′,y′)(x, y) \equiv (x', y') imply (x,x′)≡(y,y′)(x, x') \equiv (y, y').

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.