False. Join, at one common endpoint , a line segment of length for every positive integer , and use the intrinsic path metric. This is a real tree. It is totally bounded, because outside the first finitely many arms every point lies arbitrarily close to , and it is complete; hence it is compact. Removing leaves one connected component for every arm, so has countably infinite multiplicity of a point in a real tree.
The implicit function theorem states that if and the partial derivative is an invertible linear map, then near the zero set of is uniquely the graph of a continuously differentiable function.
If is a differentiable bijection with differentiable inverse , the chain rule applied to and gives
Thus is an isomorphism with inverse .
If a continuously differentiable map has invertible derivative everywhere, the inverse function theorem makes it a local diffeomorphism. In particular it is an open map, so its image is open. Its image need not be closed: has nonzero derivative everywhere and image .
For the given map of elementary symmetric polynomials,
and direct evaluation of the determinant gives
Hence the critical set is
Its complement is the Zariski-open set on which the three coordinates are pairwise distinct. Each point has one of the six possible strict coordinate orderings, and each ordering defines a nonempty convex open region. A continuous path cannot change an ordering without crossing . Therefore has exactly
connected components.
As a smooth manifold, . It has two connected components, distinguished by the sign of : each of and is connected, and a continuous path in cannot cross .
Write and assume its domain is open and connected. If the constant modulus is zero then . Otherwise let . Differentiating this identity and using the Cauchy-Riemann equations gives
These are a linear system for with coefficient matrix , whose determinant is . Therefore , and the Cauchy-Riemann equations also give . It follows that
This proves the constant-modulus holomorphic function result directly. On a disconnected domain the same conclusion holds separately on each connected component, but the constants can differ.
On , , so and therefore . Yet and . The same continuous image of a connected space argument shows that is not connected.
Put . The required three disjoint nonempty open sets are
Their union is precisely , the complement of the double cone . The eigenvalues are , so consists of positive-definite matrices above the upper sheet, of negative-definite matrices below the lower sheet, and of indefinite matrices outside the double cone. Examples are respectively.
The two definite cones are convex sets. The indefinite region is path-connected: shrink continuously to zero while keeping , then change the nonzero vector within the punctured plane. Thus these sets are also exactly the three connected components. This is the determinant cone for real symmetric two-by-two matrices.
Figure 1.
The determinant-zero cone separates three components of invertible symmetric matrices
. The left panel shows the double cone. The right panel is a radial section: the exterior indefinite region is connected around the cone in three dimensions, although its two sides appear separated in this section. Details.
Suppose two components and intersect. Their union is connected by part (a)(iii). It contains the point used to define , so maximality forces , giving . The same reasoning with gives . Hence . Thus distinct connected components are disjoint.
Let
This family is nonempty because it contains . All its members intersect at , so part (a)(iii) proves that is connected. It contains and, by its construction, contains every connected subset containing . Thus it has exactly the required largest-subset property. This is the connected component containing .
True. Each connected component of a forest is a tree. If the component sizes are , their edge counts are , including isolated vertices as size-one components. Summing gives , hence
The inclusion of into is continuous, so a connected component of is an interval in . For , openness of gives with . This interval is connected and meets , so their union is connected and maximality forces the interval into . Thus is open in . A nonempty open connected subset of the line is an open interval, allowing an infinite endpoint or the whole line. Hence every component is an open interval.
Apply the linear transformation of the scalar fields to either time- or space-derivative product. Its coefficients become multiplying the square of the first derivative, multiplying the square of the second, and multiplying their cross product. Invariance for arbitrary fields therefore requires
The complete real solution is
There are four connected components, distinguished by the diagonal/antidiagonal choice and the sign of . Only the positive diagonal family is in the identity component; write to obtain , . This is the reciprocal rescaling symmetry of two cross-coupled scalar fields. The antidiagonal transformations exchange the fields as well as rescale them.
For a covering map over a nonempty connected space, the degree of a covering map is
the cardinality of any fibre of a function. To show independence of , choose an evenly covered neighbourhood . Each covering sheet contains exactly one point over every , so equals the number of covering sheets over . The fibre of a function cardinality is therefore locally constant. For a fixed cardinal number , the points with that cardinality form an open subset, and their complement is also open. Connectedness forces the value to be constant everywhere.
For a path-connected base there is also an explicit fibre bijection by path lifting: lift a path from to starting at each point over and take its endpoint. The path lifting theorem gives existence and uniqueness; path reversal gives the inverse bijection. The bijection may depend on the path, but the resulting equality of cardinalities does not.
A connected base is needed for one global degree. Without it, use a degree on each connected component on which the cardinality is constant. For example, a covering map of a discrete two-point topological space can have one point over the first point and two over the second. Thus the unqualified printed definition needs the usual connected-base convention, or the explicit assumption that every fibre of a function has the same cardinality.
Assume has a common finite degree of a covering map . Declare the lifted vertices to be , so there are exactly of them. Each open edge is homeomorphic to , a simply connected interval. The restriction of the covering map above it is a disjoint union of copies of that open edge.
These copies acquire endpoints as follows. Lift the parametrizing path of each oriented edge, starting at each of the points over its initial vertex. The path lifting theorem gives a unique lift all the way to . Its endpoint lies over the terminal vertex, and the interiors of these lifted paths are exactly the open edges already described. This also handles a graph loop, whose two endpoints may coincide downstairs or upstairs. Local covering sheets above a small star at a vertex show that the lifted incidence relations have precisely the original topology. Thus the graph structure lifted through a covering map is a finite topological graph with
Subtracting gives the Euler characteristic under a finite covering formula
The formula holds even when is disconnected. If a disconnected base is allowed to have degrees that vary with its connected components , the precise replacement is
The printed formula with a single uses the constant-degree convention explained in part (a)(ii).
False, with “disjoint union” understood as a topological disjoint union. Take the rational numbers with the usual subspace topology from the real line.
Every connected subset of has at most one point. Indeed, if it contained , choose an irrational number . The two relatively open sets
partition and separate any subset containing both and . Hence the connected components of are singletons.
If a topological disjoint union of nonempty connected spaces were homeomorphic to , the image of each summand would be connected, hence a singleton. Every summand would therefore be a one-point topological space. Their topological disjoint union is a discrete space, since each summand is open. But is not a discrete space: for each , the distinct rational numbers approach , so is not an isolated point. This is a contradiction. The set decomposition into connected components always exists; giving those pieces the topological disjoint union topology need not recover the original topology.
Let be the common point of the two circles. For sufficiently small , the open neighbourhood
has the following local structure: consists of four disjoint open arcs, an upper and a lower branch from each circle. These are its four connected components, each open and closed relative to .
Suppose a coordinate chart of some dimension of a manifold existed at . The case would make an isolated point, which it is not. For , shrink the chart inside so that its image is an open ball centred at the image of . Its domain of a function is an open neighbourhood of , so it meets all four arms of . Intersecting those arms with gives four disjoint nonempty clopen sets partitioning ; hence there are at least four connected components.
But a punctured ball in has exactly two connected components, and a punctured ball in for is path-connected. A homeomorphism preserves connected components, giving a contradiction in every dimension of a manifold. Thus is not a topological manifold. The argument uses arbitrarily small coordinate charts; the fact that the whole has two pieces alone would not be a local obstruction.
A topological surface is a Hausdorff space with a countable basis of a topology in which every point has an open neighbourhood homeomorphic to an open subset of the Euclidean plane. We use the convention that a surface has no boundary unless a surface with boundary is explicitly specified. A closed surface is compact and has no boundary. Some conventions also include connectedness in the definition; we impose it on the closed combinatorial surface below.
A closed combinatorial surface is a finite connected simplicial complex with the following properties: every simplex is a face of a simplex of dimension two, and the link of a simplex at every vertex is a cycle graph. Explicitly, for a vertex its link is the simplicial subcomplex
To say this is a cycle graph means that there are distinct vertices , with , and exactly the link edges , with indices modulo . In particular, every edge of belongs to exactly two triangles. The vertex-link condition also requires that the triangles around each vertex form one cyclic fan; edge incidence alone would allow singular examples.
These conditions make a closed surface. A point inside a triangle has a disc neighbourhood, the two triangles at an edge give a disc neighbourhood, and the cyclic fan at a vertex gives a disc neighbourhood. Finiteness gives compactness, the Hausdorff property, and a countable basis of a topology from a realization in a finite-dimensional Euclidean space. If disconnected closed combinatorial surfaces are allowed, each connected component satisfies this definition separately.
With , the complete distinguishing data are orientability and the Euler characteristic:
Here , where count the vertices of a simplicial complex, edges, and triangles of a finite triangulation. Thus two such connected closed surfaces are homeomorphic if and only if they have the same orientability and Euler characteristic. In particular is the real projective plane and is the Klein bottle. Every listed type admits a finite triangulation. For disconnected finite closed combinatorial surfaces, apply the theorem to each of the finitely many connected components; the resulting unordered collection of types determines the homeomorphism type.
Run Kruskal's algorithm in nonincreasing order of edge weight, accepting an edge exactly when its endpoints belong to different current connected components. Use a disjoint-set data structure to test and merge those components. Stop after accepting edges.
Equivalently, apply ordinary Kruskal's algorithm to . For every spanning tree,
so minimizing transformed total weight is exactly maximizing original total weight. Thus the output is a maximum spanning tree. Equal weights may be processed in any fixed order. Sorting dominates the time complexity, giving with the usual efficient disjoint-set data structure.
Build a maximum spanning tree by the decreasing-weight version of Kruskal's algorithm. For the specified distinct endpoints , find their unique graph path in by depth-first search, retaining predecessors to reconstruct it. Return that path and its minimum edge weight .
For correctness, choose an edge of weight on . Deleting it splits into two connected components, separating from . No edge across this cut of a graph can have : replacing by would give a spanning tree of greater total weight, contradicting maximality of .
Every – graph path must cross the same cut of a graph, so it contains a crossing edge with . Therefore its minimum edge weight is at most . The tree route attains , proving
This is precisely the widest path problem. The proof allows tied, zero and negative edge weights. It depends on maximizing the total tree weight, not on a shortest-distance algorithm.
Let and . Sorting and Kruskal's algorithm take time; the tree search adds . Hence
For a connected simple graph with at least two vertices, , so the time is also . The expression remains valid when parallel edges are permitted. If the two endpoints coincide, the empty path is returned, with bottleneck under the usual empty-minimum convention; otherwise connectedness guarantees a nonempty route.
In a bipartite graph, successive vertices along an edge lie in opposite parts. Following a cycle alternates parts at each step, so returning to the starting part requires an even number of edges. Thus a bipartite graph contains no odd cycle.
Conversely, choose a rooted spanning forest and colour each vertex by the parity of its depth in its component's tree. Suppose an edge had equally coloured endpoints. The unique tree path from to has length
which is even. Adjoining makes an odd cycle. Therefore, if there are no odd cycles, every edge joins opposite colours, which supplies the required bipartition.
This is the odd-cycle characterization of bipartite graphs. The argument applies separately to every connected component.