Bourbaki

Lemma 5

Tag 01NQ, permanent. Cite it as [Bourbaki, Tag 01NQ].

Topologie algébrique, chapter I, § 2. Applications étales

a) Let c=(U0,...,Un)c= (U_0, . . . ,U_n) and c′=(U0′,...,Um′)c'= (U'_0, . . . ,U'_m) be caterpillars such that U0=U0′U_0= U'_0 and p(c)=p(c′)p(c) =p(c'). Then c=c′c=c'.

b) Let U and U′U' be elements of U\mathscr{U}. Then there exists a caterpillar c=(U0,...,Un)c= (U_0, . . . ,U_n) such that U0=UU_0= U and Un=U′U_n= U'.

a) Necessarily, m=nm=n. For every integer ii such that 0⩽i⩽n0\leqslant i\leqslant n, put Vi=p(Ui)V_i=p(U_i) and let sis_i and si′s'_i denote the continuous sections of pp over ViV_i with respective images UiU_i and Ui′U'_i. To prove the equality c=c′c=c', we shall prove, by induction on ii, the equality si=si′s_i=s'_i for every integer ii such that 0⩽i⩽n0\leqslant i\leqslant n. By hypothesis, one has s0=s0′s_0=s'_0. Let ii be such that 1⩽i⩽n1\leqslant i\leqslant n and si−1=si−1′s_{i-1}=s'_{i-1}. Since Ui−1∩UiU_{i-1}\cap U_i contains a point xx, the continuous sections si−1s_{i-1} and sis_i coincide at p(x)p(x), hence at every point of Vi−1∩ViV_{i-1}\cap V_i, since it is connected (Corollary 1 of I, p. 34). The same is true of si−1′s'_{i-1} and si′s'_i. For the same reason, sis_i and si′s'_i, which coincide on Vi−1∩ViV_{i-1}\cap V_i, also coincide on ViV_i, whence the result.

b) If xx and yy are points of E, we say that a caterpillar c=(U0,...,Un)c= (U_0, . . . ,U_n) joins xx to yy if x∈U0x\in U_0 and y∈Uny\in U_n. In the set E, let R be the relation “there exists a caterpillar which joins xx to yy”. The relation R is reflexive since U\mathscr{U} is a covering of E. It is obviously symmetric. Let us prove that it is transitive: let x,y,zx,y,z be three points of E, (U0,...,Un)(U_0, . . . ,U_n) and (U0′,...,Um′)(U'_0, . . . ,U'_m) caterpillars joining xx to yy and yy to zz respectively. Let U∈UU\in \mathscr{U} be a neighbourhood of yy contained in Un∩U0′U_n\cap U'_0; we have p(Un)∩p(U)=p(U0′)∩p(U)=p(U)p(U_n)\cap p(U) =p(U'_0)\cap p(U) =p(U), and, since U is connected , the sequence (U0,...,Un,U,U0′,...,Um′)(U_0, . . . ,U_n,U,U'_0, . . . ,U'_m) is a caterpillar which joins xx to zz. The equivalence classes under R are open, hence also closed. Since E is connected, it follows that any two points of E are always joined by a caterpillar.

Let now U and U′U' be elements of U,x\mathscr{U},x a point of U and x′x' a point of U′U'. There exists a caterpillar (U2,...,Un−2)(U_2, . . . ,U_{n-2}) joining xx to x′x'. Let U1U_1 and Un−1U_{n-1} be open sets of U\mathscr{U} such that x∈U1,x′∈Un−1x\in U_1,x'\in U_{n-1}, U1⊂U∩U2,Un−1⊂U′∩Un−2U_1\subset U\cap U_2,U_{n-1}\subset U'\cap U_{n-2}. Put U0=UU_0= U, Un=U′U_n= U'. Then the sequence (U0,...,Un)(U_0, . . . ,U_n) is a caterpillar.

Let us now prove the theorem. Let U be an element of U\mathscr{U} and let C be the set of caterpillars (U0,...,Un)(U_0, . . . ,U_n) such that U0=UU_0= U. The mapping of C into S which, to a caterpillar c=(U0,...,Un)c= (U_0, . . . ,U_n) of C, associates the sequence p(c)=(p(U0),...,p(Un))p(c) = (p(U_0), . . . , p(U_n)) is injective (lemma 5, a)), hence

(1) Card(C) ⩽\leqslant Card(S).

The mapping of C into U\mathscr{U} which, to c=(U0,...,Un)∈Cc= (U_0, . . . ,U_n)\in C, associates the open set UnU_n is surjective by the second part of lemma 5, hence (2) Card(U\mathscr{U})⩽\leqslant Card(C).

For every point xx of E, let us choose an open set UxU_x of U\mathscr{U} such that x∈Uxx\in U_x. If xx and yy are distinct points of one and the same fibre EaE_a of pp, we have Ux=U̸yU_x= U\not_y since p∣Uxp|U_x is injective. Hence, for a∈Ba\in B, (3) Card(Ea_a)⩽\leqslant Card(U\mathscr{U}).

Finally, if V\mathscr{V} is a finite set, the set S of finite sequences of elements of V\mathscr{V} is countable (E, III, p. 49, prop. 1), hence

(4) Card(S) ⩽\leqslant Card(N\mathbf{N}).

If V\mathscr{V} is infinite, we have

(5) Card(S) = Card(V\mathscr{V})⩽\leqslant Card(W\mathscr{W})2=^2= Card(W\mathscr{W})

by the corollary of E, III, p. 50 and Corollary 1 of E, III, p. 49. The theorem follows from relations (1) to (5) above.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5.4, against glossary version 34. Not checked by a person.