Bourbaki

Lemma 1

Tag 0C0L, permanent. Cite it as [Bourbaki, Tag 0C0L].

General Topology, chapter VIII, § 3. Infinite sums and products of complex numbers

For each finite subset JJ of II, let φ(J)=sup⁡L⊂J(pL−1)\varphi(J) = \sup_{L \subset J} (p_L - 1). Then for each subset LL of JJ we have

∣pL−1−sL∣≤φ(J)σL. |p_L - 1 - s_L| \leq \varphi(J) \sigma_L.

This is clear if LL is empty. We proceed by induction on card (L)(L). Let L=K∪{λ}L = K \cup \{ \lambda \}, where λ∉K\lambda \notin K; then pL=pK(1+aλ)p_L = p_K (1 + a_\lambda) and sL=sK+aλs_L = s_K + a_\lambda, so that pL−1−sL=(pK−1−sK)+(pK−1)aλp_L - 1 - s_L = (p_K - 1 - s_K) + (p_K - 1)a_\lambda; hence, by the inductive hypothesis and the definition of φ(J)\varphi(J), we have

∣pL−1−sL∣≤φ(J)σK+φ(J)∣aλ∣=φ(J)σL, |p_L - 1 - s_L| \leq \varphi(J) \sigma_K + \varphi(J)|a_\lambda| = \varphi(J) \sigma_L,

which proves the lemma.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed volume. Not translated.