Summary
In algebraic geometry, an irreducible algebraic set or irreducible variety is an algebraic set that cannot be written as the union of two proper algebraic subsets. An irreducible component is an algebraic subset that is irreducible and maximal (for set inclusion) for this property. For example, the set of solutions of the equation xy = 0 is not irreducible, and its irreducible components are the two lines of equations x = 0 and y =0. It is a fundamental theorem of classical algebraic geometry that every algebraic set may be written in a unique way as a finite union of irreducible components. These concepts can be reformulated in purely topological terms, using the Zariski topology, for which the closed sets are the algebraic subsets: A topological space is irreducible if it is not the union of two proper closed subsets, and an irreducible component is a maximal subspace (necessarily closed) that is irreducible for the induced topology. Although these concepts may be considered for every topological space, this is rarely done outside algebraic geometry, since most common topological spaces are Hausdorff spaces, and, in a Hausdorff space, the irreducible components are the singletons. A topological space X is reducible if it can be written as a union of two closed proper subsets , of A topological space is irreducible (or hyperconnected) if it is not reducible. Equivalently, X is irreducible if all non empty open subsets of X are dense, or if any two nonempty open sets have nonempty intersection. A subset F of a topological space X is called irreducible or reducible, if F considered as a topological space via the subspace topology has the corresponding property in the above sense. That is, is reducible if it can be written as a union where are closed subsets of , neither of which contains An irreducible component of a topological space is a maximal irreducible subset. If a subset is irreducible, its closure is also irreducible, so irreducible components are closed.
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.