Bourbaki

Exercise 8, § 1

Tag 03U4, permanent. Cite it as [Bourbaki, Tag 03U4].

Theory of Sets, III, 215

Let E and F be two ordered sets, let ff be an increasing mapping of E into F, and gg an increasing mapping of F into E. Let A (resp. B) be the set of all x∈Ex \in \mathrm{E} (resp. y∈Fy \in \mathrm{F}) such that g(f(x))=xg(f(x)) = x (resp. f(g(y))=yf(g(y)) = y). Show that the two ordered sets A and B are canonically isomorphic.

Solution

This solution was written by hy3-free and judged by a machine. It is not Bourbaki's and it has not been checked by a person.

The subsets AA and BB are ordered by the relations induced by the orderings of EE and FF respectively, by Example 2 of no. 1 (tag 03SI).

Let φ\varphi denote the mapping x↦f(x)x \mapsto f(x) with domain AA and codomain FF, and let ψ\psi denote the mapping y↦g(y)y \mapsto g(y) with domain BB and codomain EE.

Since ff is an increasing mapping of EE into FF (Definition 1 of § 1, tag 03JC), for every x∈Ax \in A we have g(f(x))=xg(f(x)) = x by the definition of AA; applying ff to this equality gives f(g(f(x)))=f(x)f(g(f(x))) = f(x), so f(x)f(x) satisfies the defining condition of BB and therefore f(x)∈Bf(x) \in B. Hence φ\varphi maps AA into BB. Similarly, since gg is an increasing mapping of FF into EE (Definition 1 of § 1, tag 03JC), for every y∈By \in B the equality f(g(y))=yf(g(y)) = y implies on applying gg that g(f(g(y)))=g(y)g(f(g(y))) = g(y), so g(y)∈Ag(y) \in A; thus ψ\psi maps BB into AA.

For x∈Ax \in A, we have ψ(φ(x))=g(f(x))=x\psi(\varphi(x)) = g(f(x)) = x by the definition of AA, and for y∈By \in B, φ(ψ(y))=f(g(y))=y\varphi(\psi(y)) = f(g(y)) = y by the definition of BB. Consequently ψ∘φ=idA\psi \circ \varphi = \mathrm{id}_A and φ∘ψ=idB\varphi \circ \psi = \mathrm{id}_B, so φ\varphi is a bijection of AA onto BB and ψ\psi is its inverse.

Let x1⩽x2x_1 \leqslant x_2 in AA, which means x1⩽x2x_1 \leqslant x_2 in EE. Because ff is increasing (Definition 1 of § 1, tag 03JC), f(x1)⩽f(x2)f(x_1) \leqslant f(x_2) in FF; since f(x1),f(x2)∈Bf(x_1), f(x_2) \in B, this is precisely φ(x1)⩽φ(x2)\varphi(x_1) \leqslant \varphi(x_2) in the induced order on BB. Thus φ\varphi is increasing. Likewise, if y1⩽y2y_1 \leqslant y_2 in BB, then g(y1)⩽g(y2)g(y_1) \leqslant g(y_2) in EE because gg is increasing (Definition 1 of § 1, tag 03JC), so ψ\psi is increasing. By the standard definition of an isomorphism of ordered sets, a bijective increasing mapping whose inverse is also increasing is an isomorphism; therefore φ\varphi is an isomorphism of the ordered set AA onto the ordered set BB.

The isomorphism φ\varphi and its inverse ψ\psi are obtained simply by restricting the given mappings ff and gg, so this isomorphism is canonical. Hence the ordered sets AA and BB are canonically isomorphic.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.