Proposition 1
Tag 0AOW, permanent. Cite it as [Bourbaki, Tag 0AOW].
Lie Groups and Lie Algebras, chapter IV, Appendix 0. Graphs
Let be a graph and its family of connected components. Denote by the full subgraph of having as its set of vertices.
(i) For any in , the graph is connected. (ii) If is a connected subgraph of , there exists in such that . (iii) If , no element of is joined in to any element of (equivalently, every edge of is an edge of one of the ). (iv) Let be a partition of such that, if , no element of is joined in to any element of ; then each of the sets is a union of connected components of .
(i) Let be in and and be in . Then there exists a path joining and in . For any with , the path joins to in , so . Thus, is a path in joining and . It follows that is connected.
(ii) Let be a non-empty connected subgraph of , let be an element of and let be the connected component of containing . For any in , there exists a path joining and in , and a fortiori in . It follows that .
(iii) Given distinct elements and of , and vertices and , there is no path joining and , and in particular no edge joining and .
(iv) Let be in and let be the connected component of containing . Then, for any in , there exists a path joining and in . If is an integer such that and if , then since is joined to . It follows by induction that for , and in particular that is in . Thus, .
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Cited by
Cites
Nothing.