Example
Tag 055C, permanent. Cite it as [Bourbaki, Tag 055C].
Algebra, chapter I, § 1. Laws of composition; associativity; commutativity
(1) The mappings (X, Y) ↦ X ∪ Y and (X, Y) ↦ X ∩ Y are laws of composition on the set of subsets of a set E.
(2) On the set N of natural numbers, addition, multiplication and exponentiation are laws of composition (the compositions of x ∈ N and y ∈ N under these laws being denoted respectively by x + y, xy or x.y and x^y) (Set Theory, III, § 3, no. 4).
(3) Let E be a set; the mapping (X, Y) ↦ X ⋅ Y is a law of composition on the set of subsets of E × E (Set Theory, II, § 3, no. 3, Definition 6); the mapping (f, g) ↦ f ⋅ g is a law of composition on the set of mappings of E into E (Set Theory, II, § 5, no. 2).
(4) Let E be a lattice (Set Theory, III, § 1, no. 11); if sup(x, y) denotes the least upper bound of the set {x, y}, the mapping (x, y) ↦ sup(x, y) is a law of composition on E. Similarly for the greatest lower bound inf(x, y). Example 1 above is a particular case of this with ordered by inclusion.
(5) Let be a family of magmas. Let denote the law of composition on . The mapping
Let be a law of composition on a set E. Given any two subsets X, Y of E, (provided this notation does not lead to confusion†) will denote the set of elements in E, where (in other words, the image of under the mapping ).
If we usually write instead of and instead of . The mapping is a law of composition on the set of subsets of E.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Cited by
Nothing.