Let be an open subset of the real line, and let be antiderivatives of the same function on . Each connected component is an open interval. On that component, , so the mean value theorem gives . The constants on different components are independent: there is no subinterval inside joining them. Conversely, adding any chosen constant on each component preserves the derivative everywhere on .
For example, the domain of is . Every antiderivative on this domain has the form
with arbitrary real . The logarithm of the absolute value differentiates to on each side. The function with and is therefore a valid antiderivative, although it cannot be written as with one global constant.
Figure 1.
Two disconnected intervals allow independent constants while the derivative stays the same
. Details.
An initial condition at fixes and leaves free. Fixing both constants requires one reference value in each connected component, or additional conditions that couple the components. The locally constant function captures this remaining freedom.
Berge's theorem 2026-10-14
For a finite simple graph and a matching in a graph , is a maximum cardinality matching if and only if has no augmenting path in a matching relative to . The graph need not be a bipartite graph, and the assertion concerns cardinality, not edge benefits.[ref]
The criterion turns a global comparison with every competing matching in a graph into a search for one repair. Starting from any matching in a graph, repeatedly find and toggle an augmenting path in a matching. Each step adds one selected edge, so finiteness gives termination after at most steps; absence of any further augmenting path in a matching certifies maximum cardinality. This is an optimality criterion, not by itself a bound on the work needed to find each graph path.
For a short proof outline, an augmenting path in a matching immediately contradicts maximum cardinality. Conversely, if another matching in a graph has , consider the subgraph whose set of edges is . Its vertices have degree of a vertex at most two; its nontrivial connected components are graph paths and even cycles in a graph, alternating between the two matchings in a graph. A cycle in a graph contributes equal numbers from each. Hence some graph path contributes one more edge from than from and starts and ends with edges from . Its endpoints are unmatched vertices in a matching relative to , yielding the required augmenting path in a matching.
Bernoulli power substitution Created 2026-10-14 Updated 2026-10-25
For arbitrary real , work first on an interval where . Define exponentiation by , using the real logarithm. The change of variable is differentiable and invertible there, and the chain rule gives
Multiplying the Bernoulli differential equation by yields the first-order linear differential equation
This is an exact transformation of nonzero solutions of a differential equation on the chosen branch; it is valid far from any reference state and does not discard higher powers as a local linearization would.
Given the initial condition , the integrating factor and transformed solution of a differential equation are
The product rule verifies . Recover only on the connected component of containing , inside the original coefficient interval. The first-order linear differential equation can have a longer existence interval than this inverse transformation allows.[ref]
Negative values need a separately justified real branch. For integer , the required powers are real and differentiable for too, but the inverse must retain the sign selected by the initial condition. For , represents either or ; both square roots are taken of positive . For , retains the sign directly. For a general noninteger exponent, use the positive branch unless a specific differentiable real negative branch has been established. Never evaluate a real fractional power of a negative value merely because the linear formula has become negative.
Division by excludes . When and the original real power is defined at zero, is an additional solution of a differential equation and must be checked in the original equation. When , the equation as written is undefined at zero. On a positive branch the right-hand side is locally Lipschitz in , so the Picard-Lindelöf theorem gives local uniqueness. At zero, the same hypothesis needs a fresh check: it holds for the polynomial example, whereas for a nonzero power coefficient prevents local Lipschitz continuity there. If , the inverse sends for , but sends for . The latter endpoint can lead to finite-time extinction in a sublinear Bernoulli equation, where the original equation determines how to join to zero.
Every connected component of a nonempty compact proper subset of a connected Hausdorff space meets its boundary. If not, the Šura-Bura lemma identifies as a quasi-component in the compact Hausdorff subspace . Finitely many clopen neighborhoods separate it from the compact boundary, giving a nonempty relatively clopen . Such is open in the ambient space, and is also closed there because is closed. It is proper because is proper. This contradicts connectedness.
Every closed combinatorial surface has geometric realization homeomorphic to exactly one member of the following list: the sphere ; the connected sum of surfaces of tori; or the connected sum of surfaces of real projective planes. Every member admits a finite triangulation. The orientable family has Euler characteristic , including for the sphere; the nonorientable surface family has Euler characteristic . Thus orientability and Euler characteristic determine the homeomorphism type. The first two nonorientable cases are the real projective plane and the Klein bottle. For a finite disconnected simplicial complex satisfying the same local conditions, the unordered list of its connected components' types determines its type.
A closed combinatorial surface is a finite connected simplicial complex in which every simplex is a face of a triangle and the link of a simplex at every vertex is a cycle graph. Every edge then lies in exactly two triangles, and the triangles at a vertex form a single cyclic fan. The edge-incidence condition alone is insufficient: gluing two triangulated spheres only at one vertex gives two disjoint circles in that vertex's link.
Its geometric realization is a compact surface without boundary. Triangle interiors have disc neighbourhoods, edge interiors have such neighbourhoods from the two incident triangles, and the cyclic fan gives one at each vertex. A finite realization is a Hausdorff space with a countable basis of a topology, being a finite union of geometric simplexes in Euclidean space. If connectedness is omitted by convention, require these properties separately on each connected component.
Computational topology 2026-11-05
Computational topology develops algorithms for topological questions about finite representations of spaces, such as simplicial complexes. It connects discrete data structures to invariants that ignore irrelevant geometric distortion. connected components and homology groups are examples of computable structural information.[ref]
For a small simplicial homology calculation over a field, take three vertices joined by three edges in a cycle, without a filled face. The matrix of the first boundary operator has matrix rank two, so this linear map has a kernel of a linear map of dimension one; with no two-dimensional face, that cycle is not a boundary. Thus the first Betti number is one. Adding the filled triangular face makes the same cycle a boundary and reduces the first Betti number to zero. The vertex coordinates need not change: the encoded incidence structure determines whether the hole is present.
Connected component Created 2026-09-24 Updated 2026-10-14
A connected component of a topological space is a nonempty connected subset that is maximal under subset inclusion. If is a connected component and with a connected subset, then . Maximality means that no larger connected subset contains ; it does not mean largest cardinality among all connected subsets.
For example, the connected components of in the usual subspace topology of the real line are and . Each is a real interval, and no connected subset of the real line can meet both without containing the missing point . For the finite set in the same subspace topology, the three connected components are its singleton sets.
Figure 1.
An intact real interval, an interval with an interior point removed, and a finite set have one, two, and three connected components in the usual subspace topology of the real line
. Details.
Every point lies in exactly one connected component, constructed by taking the union
All members contain , so their union is connected by connected union with a connected hub. The union includes every connected subset through , so it is maximal. Equivalently, define
This is an equivalence relation: singleton sets give reflexivity, symmetry is immediate, and two connected subsets sharing the middle point have a connected union, giving transitivity. The equivalence classes are precisely the connected components. They form a partition of a set: they cover and any two are either equal or disjoint.[ref]
Every nonempty connected subset lies within one connected component. Moreover, every connected component is closed in : closure of a connected set makes its closure connected, and maximality forces that closure to equal the original connected component. A connected component need not be open. For example, in with its usual subspace topology from the real line, all connected components are singleton sets, but is not open: every neighbourhood of in contains some .[ref]
For a closed unital subalgebra with common identity, its group of invertible elements of a Banach algebra is relatively open in by the Neumann series. It is relatively closed because inversion in is continuous and is closed. Consequently each connected component of either consists entirely of elements invertible in , or entirely of elements whose inverses do not belong to .
Connected components of a product space Created 2026-10-07 Updated 2026-10-14
The product of connected spaces is connected, so the product of the two connected components lies in the component of . Conversely, continuous projections carry that component to connected sets in the factors, which must lie in and . These two inclusions prove equality in arbitrary topological spaces.
Connected subset Created 2026-10-03 Updated 2026-10-14
A subset of a topological space is a connected subset when , with the subspace topology inherited from , is a connected space. Thus connectedness is tested inside : a forbidden separation of a topological space consists of nonempty subsets
where are open sets in . The ambient open sets need not be disjoint outside .
For example, in the real line with its usual topology, is a connected subset, whereas is not: its two singleton sets are open in its subspace topology. A subset of a connected space need not be connected. Conversely, is a connected subset of the disconnected topological space . The ambient topological space need not itself be connected.
A finite set of distinct points in the real line inherits the discrete topology: a sufficiently small open interval around each point isolates that point. Its only nonempty connected subsets are singleton sets. This depends on the topology: a nonempty finite set with the indiscrete topology is a connected space, since its only open sets are itself and the empty set. Here, as in the definition of connected space, the empty set is also connected because it admits no separation of a topological space.[ref]
The distinction matters when finding connected components: we search among connected subsets of the specified topological space, rather than judging whether the surrounding drawing looks like one piece.
Connected subset of the real line Created 2026-09-29 Updated 2026-10-14
In the usual subspace topology from the real line, a subset is connected exactly when it has the defining property of a real interval:
Every real number between two members must be present. Thus open intervals, closed intervals, intervals with only one endpoint included, and unbounded real intervals are connected. Singleton sets are connected too. With the no-separation of a topological space convention used here, the empty set satisfies the same property; some texts reserve the word connected for nonempty topological spaces.[ref]
Removing an interior point changes the answer:
These two real intervals are exactly its connected components and its path components. Removing an endpoint instead leaves a real interval, for example , which stays connected. This is why an interior point of a closed interval is a cut point, whereas an endpoint is not. A nonempty finite set of points in the real line is connected exactly when it is a singleton set.
Proof outline: if but is missing, the subsets
give a separation of a topological space, since the two open intervals make both pieces open in . Conversely, a nonempty real interval contains the continuous path between any two of its points, so it is path-connected and hence connected. Together with continuous image of a connected space, this characterization gives the intermediate value theorem: a continuous function on a real interval cannot jump over a value lying between two attained values.
Constant of integration Created 2026-10-14 Updated 2026-10-31
On a connected open interval, if , every antiderivative of has the form , where is a constant function. Indeed, two solutions satisfy : the zero derivative on a connected open set principle makes their difference constant. In one dimension, the mean value theorem proves this on any closed subinterval. [ref]
An initial condition or boundary condition can determine . If a particular antiderivative is and , then
For , and , this gives . Without that reference value, choosing simply selects one member of the family.
The freedom has a physical meaning in a simple kinematic model. A velocity , with constant acceleration , determines position only as . The initial condition selects ; changing the starting position does not change the prescribed velocity.
For the differential equation on , the antiderivative is . The boundary condition gives . Discarding the constant of integration therefore needs a specified condition or an approximation that quantifies its effect. On a domain with several connected components, the freedom is larger: antiderivatives on disconnected domains require a separate constant on each component.
Continuation method Created 2026-10-14 Updated 2026-10-14
A continuation method follows a solution branch of a parameter-dependent equation from a known solution, using nearby solutions to guide the next solve. This is useful when one wants to understand how solutions change, rather than obtain just one isolated answer. A continuation predictor-corrector step follows a tangent vector and then uses a Newton method correction on a transverse section. The same geometry supports both pseudo-arclength continuation through a continuation fold and transversal surface intersection tracing.
Consider the original scalar polynomial example
Its solution branch bends back twice in . Increasing alone eventually stops following the same nearby solutions; following the curve in the plane can continue around both bends. The continuation folds are
For there are three distinct real zeros of a function at that fixed , all lying on this one connected curve. A continuation method keeps their geometric relationship visible.
Figure 1.
A connected cubic solution curve with two folds and three solutions at the same parameter value
. The arrows follow increasing along , even where changes direction. The dashed horizontal line meets the solution branch three times. The marked continuation folds are extrema of , not singularities of the full curve. Details.
Every continuation method needs a seed, supplied by an independent solve, an explicitly known solution, or another search. Following one solution branch does not guarantee finding every connected component of the solution set. A large step can miss detail or make the correction converge to a distant solution. At branch intersections or a loss of rank of the full Jacobian matrix, the regular-curve argument needs separate analysis. The seed and component limitations also matter in transversal surface intersection tracing.
Continuous image of a connected space Created 2026-09-24 Updated 2026-10-14
If is a continuous map and is a connected space, then its image , with the subspace topology from , is a connected subset of . The whole codomain need not be connected; the assertion concerns the values actually attained. No injectivity is required.[ref]
For example, the continuous function maps the connected closed interval onto the connected closed interval , even though opposite inputs have the same output. The same continuous function maps the disconnected union onto . Thus a connected image does not imply a connected source: a continuous map can merge different connected components.
For a continuous function representing a continuous reading, and force some input with . Its image is a connected subset of the real line, hence a real interval containing both endpoint readings. For the synthetic model , the missing-value test is explicit: . A step reading equal to for and for skips , but fails continuity at .
Figure 1.
A continuous function attains intermediate readings; a step that skips them violates continuity
. Synthetic mathematical models, not measured data. The continuous function attains at ; the step attains only and . Details.
Proof outline: a separation of a topological space of into nonempty open subsets pulls back under to nonempty open subsets of . Their intersection is empty and their union is , contradicting connectedness. This also shows why a continuous map sends each connected component of its source into a single connected component of its target.
Sort the edge weights of a minimum spanning tree and of any spanning tree in nondecreasing order. Then for every position. To prove it, fix a threshold and retain the graph's edges of weight at most . If this graph has connected components, contains a spanning forest of each component using those edges: otherwise a light edge joining two of its pieces could replace an edge heavier than on its tree path, decreasing total weight. Hence exactly edges of have weight at most . No other spanning tree can have more, since its retained edges form a forest inside those components. These threshold counts imply the coordinatewise inequality for sorted weights.
For fixed real , the number of isolated vertices in a binomial random graph with converges to a Poisson distribution of mean . Its fixed factorial moments tend to . A union bound for small connected components, together with exclusion of intermediate components, shows that isolated vertices are asymptotically the only obstruction to connectivity. Thus the displayed limit is the zero-mass of that Poisson distribution.
Degree of a covering map 2026-10-25
For a covering map with nonempty connected base, the degree of a covering map is the common cardinality of its fibres. Each evenly covered neighbourhood makes this number locally constant, so connectedness makes it constant. The total covering space need not be connected. On a path-connected base the path lifting theorem gives a fibre bijection by path lifting. A disconnected base may have different degrees on different connected components.