Let I be a right filtered ordered set, (Eα,φβα) an inductive system of sets relative to I, E its inductive limit and φα:Eα→E,α∈I, the canonical mappings. Let f:I→I be a mapping such that f(α)>α for α∈I, and suppose given, for each α∈I, a set Lα and mappings uα:Eα→Lα and vα:Lα→Ef(α) such that vα∘uα′=φf(α),α. Let J be the ordered set obtained by providing I with the relation « α≤β if α=β or f(α)≤β ». If α,β∈J with α≤β, let ψβα:Lα→Lβ be the mapping such that ψβα=Id if α=β, ψβα=uβ∘φβ,f(α)∘vα if f(α)≤β. If α∈J, let ψα:Lα→E be the mapping φf(α)∘vα. Then the ordered set J is filtered, (Lα,ψβα) is an inductive system relative to J, (ψα) is an inductive system of mappings and the mapping ψ:limα∈JLα→E deduced from the ψα is bijective.
It is clear that J is inductive. If α,β∈J with α<β, we have
ψβ∘ψβα=φf(β)∘vβ∘uβ∘φβ,f(α)∘vα=φf(β)∘φf(β),β∘φβ,f(α)∘vα=φf(α)∘vα=ψα; analogously, if
α,β,γ∈J with
α<β<γ, we have
ψγβ∘ψβα=uγ∘φγ,f(β)∘vβ∘uβ∘φβ,f(α)∘vα=uγ∘φγ,f(β)∘φf(β),β∘φβ,f(α)∘vα=uγ∘φγ,f(α)∘vα=ψγα. Let us prove the last assertion: for each
α∈J, we have
ψα∘uα=φf(α)∘vα∘uα=φf(α)∘φf(α),α=φα, hence
φα(Eα)=ψα(uα(Eα))⊂ψα(Lα), and
ψ is surjective. Let
α∈J and let
x,y∈Lα with
ψα(x)=ψα(y), i.e.
φf(α)(vα(x))=φf(α)(vα(y)); there exists
β∈I,
β≥f(α) such that
φβ,f(α)(vα(x))=φβ,f(α)(vα(y)), hence
ψβ,α(x)=uβ(φβ,f(α)(vα(x)))=uβ(φβ,f(α)(vα(y)))=ψβ,α(y). and
ψ is injective.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Nothing.
Nothing.