Concept

Cut point

In topology, a cut-point is a point of a connected space such that its removal causes the resulting space to be disconnected. If removal of a point doesn't result in disconnected spaces, this point is called a non-cut point. For example, every point of a line is a cut-point, while no point of a circle is a cut-point. Cut-points are useful to determine whether two connected spaces are homeomorphic by counting the number of cut-points in each space. If two spaces have different number of cut-points, they are not homeomorphic. A classic example is using cut-points to show that lines and circles are not homeomorphic. Cut-points are also useful in the characterization of topological continua, a class of spaces which combine the properties of compactness and connectedness and include many familiar spaces such as the unit interval, the circle, and the torus. A cut-point of a connected T1 topological space X, is a point p in X such that X - {p} is not connected. A point which is not a cut-point is called a non-cut point. A non-empty connected topological space X is a cut-point space if every point in X is a cut point of X. A closed interval [a,b] has infinitely many cut-points. All points except for its end points are cut-points and the end-points {a,b} are non-cut points. An open interval (a,b) also has infinitely many cut-points like closed intervals. Since open intervals don't have end-points, it has no non-cut points. A circle has no cut-points and it follows that every point of a circle is a non-cut point. A cutting of X is a set {p,U,V} where p is a cut-point of X, U and V form a separation of X-{p}. Also can be written as X{p}=U|V. Cut-points are not necessarily preserved under continuous functions. For example: f: [0, 2pi] → R2, given by f(x) = (cos x, sin x). Every point of the interval (except the two endpoints) is a cut-point, but f(x) forms a circle which has no cut-points. Cut-points are preserved under homeomorphisms. Therefore, cut-point is a topological invariant.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.