Affine independence Created 2026-10-14 Updated 2026-10-25
Points in an affine space are affinely independent if the only affine dependence displayed above has all coefficients zero, using any choice of origin to read the vector equation. Since the coefficients sum to zero, replacing the origin leaves that equation unchanged. Substituting shows that this condition is equivalent to linear independence of . It also says that an affine combination of the points has unique coefficients. In , at most points can be affinely independent; such points span a full-dimensional simplex.
Barycentric coordinate system Created 2026-10-18 Updated 2026-10-31
A barycentric coordinate system assigns to a point in the affine span of the vertices of a nondegenerate simplex its unique vertex weights , constrained to sum to one. Uniqueness follows because form a basis of the translation space: expand in that basis and set . A point lies in the closed simplex exactly when every weight is nonnegative. An affine function satisfies , which makes these coordinates useful for interpolation and the integral of an affine function over a simplex.
Brouwer fixed-point theorem Created 2026-09-24 Updated 2026-10-14
The Brouwer fixed-point theorem says that every continuous map has a fixed point when is a nonempty compact set and a convex set in a finite-dimensional vector space over the real numbers. Equivalently, take for a finite , with the usual Euclidean space structure: there is some such that . The conclusion guarantees at least one fixed point, without asserting uniqueness or telling us how quickly to find one. [ref]
The standard pictures are a closed ball, including a closed unit ball, and a simplex. A filled disk qualifies; its bounding circle alone does not. A probability simplex also qualifies even though its dimension is smaller than that of its ambient Euclidean space. The hypotheses have concrete meanings: being a convex set keeps every line segment between allowed points inside , and compactness prevents escape or loss of a limiting point. In Euclidean space, the Heine-Borel theorem identifies compact sets with closed sets that are bounded sets. Crucially, every output must belong to the same as the input.
For a fully computable example, let be the filled unit disk. Apply a counterclockwise quarter-turn rotation, shrink by , and add a translation:
This affine map is a continuous map. Because the rotation preserves the Euclidean norm, the triangle inequality gives, for every ,
Thus the whole image lies strictly inside . More precisely, it is a disk of radius centred at . This containment check is what makes the Brouwer fixed-point theorem applicable; a formula being a continuous map by itself would not suffice.
The fixed point can now be found by a system of linear equations:
Indeed, substitution gives . Its Euclidean norm is , safely inside . The figure shows arrows from sample inputs to their outputs; an arrow disappears at the fixed point because the displacement vanishes there.
Figure 1.
A quarter-turn, shrinking, and translation keep a disk inside itself
. Details.
Repeated iterations of a map happen to succeed for this example. Starting at and setting gives , , and . Subtracting the fixed point equation yields , so the Euclidean distance to shrinks by exactly each step. This extra fact follows from the contraction mapping property and the Banach fixed-point theorem. It is additional information beyond the Brouwer fixed-point theorem.
The distinction becomes visible with two simpler continuous maps of the same disk. The pure rotation has exactly one fixed point, , since and force both to vanish. Yet iterations of a map starting at here cycle through , , and forever. Their Euclidean distance from stays one, so there is no convergence in a metric space. The reflection has an entire line segment of fixed points, namely . Starting off that line segment produces an alternating pair. Existence, uniqueness, and convergence of iterations of a map are separate questions.
Figure 2.
Existence of a fixed point does not imply uniqueness or convergence of iteration
. Details.
Removing hypotheses changes the answer. Restrict the same quarter-turn rotation to the circle . It remains a continuous map into that compact set, but its only possible fixed point, , has been removed. The circle is not a convex set. Conversely, on the unbounded convex set , the translation has no fixed point; on the open interval , also has none. Neither domain is a compact set. The finite-dimensional closed ball statement should likewise not be extended to arbitrary infinite-dimensional vector spaces, where a closed ball need not be a compact set.
The one-dimensional version explains the connection to the intermediate value theorem. For a continuous map , put . Then and , so the intermediate value theorem gives for some . In higher dimensions, the Brouwer fixed-point theorem supplies a corresponding existence principle when this scalar sign argument is unavailable. Its practical value is ensuring that a proposed equation has a solution once a suitable domain is found; it supplies no general promise of a fast algorithm.
A useful application is positive matrix eigenvector from simplex normalization: rescale the output of a strictly positive matrix to make its entries sum to one. For example, take
On this probability simplex, has entry sum , so the normalized continuous map is . Both entries are positive and sum to one, keeping the image inside the probability simplex. Its fixed point equation is , hence . Consequently satisfies : a strictly positive eigenvector with eigenvalue . In larger dimensions, the Brouwer fixed-point theorem guarantees the corresponding positive eigenvector without requiring us to solve a system of linear equations in advance. The fixed point expresses preservation of relative weights, rather than preservation of their unnormalized size.
Proofs can be approached through the no-retraction theorem or Sperner's lemma. In the latter approach, increasingly fine triangulations locate approximate fixed points; compactness supplies a convergent subsequence, and continuous maps turn its limit into an exact fixed point. [ref]
A primary historical reference is L. E. J. Brouwer's 1911 paper Über Abbildung von Mannigfaltigkeiten, whose digitized original is hosted by Zenodo under DOI 10.1007/BF01456812. This gives a direct route to the early literature behind the Brouwer fixed-point theorem. [ref]
Cell-count formula for Euler characteristic Created 2026-10-14 Updated 2026-10-18
Let be a finite CW complex, with topological cells of dimension and none above . Its Euler characteristic is the displayed alternating sum. For a finite simplicial complex, counts its -dimensional simplexes, each counted once rather than once for each containing simplex. In dimension two this becomes . A topological cell's interior is counted; identified parts of its boundary are counted in their own lower-dimensional topological cells.[ref]
The cellular homology theorem identifies cellular homology with singular homology, so the count equals the alternating rational Betti numbers. These are the free ranks of integral homology; torsion subgroups do not contribute to them. Over any field, the alternating homology dimensions still give the same Euler characteristic, although individual Betti numbers can depend on the field.
Chain coefficient Created 2026-09-24 Updated 2026-11-05
In a based free chain group, write a chain uniquely as a finite sum
The scalars are its chain coefficients relative to the chosen basis. For simplicial chains, the basis consists of chosen oriented simplexes; reversing an orientation of a simplex changes its coefficient's sign. For singular chains, the basis elements are singular simplices.
For example, has edge coefficients and . Applying the boundary operator gives . A general chain complex may contain nonfree modules, so a simplex-basis expansion is an additional feature of these models, rather than part of the abstract definition of a chain complex.
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.
Delta-complex Created 2026-10-31 Updated 2026-11-05
A delta-complex is obtained by gluing standard simplexes along affine face maps, allowing different vertices or faces of one simplex to acquire the same image. Every simplex interior is mapped injectively, and the topology is determined simplexwise. Unlike an abstract simplicial complex, its simplexes need not be determined by their sets of global vertices. A circle built from one edge with its two endpoints identified is a basic example. Subdivisions remove these repeated-vertex and repeated-simplex obstructions.
Edge path 2026-10-25
An edge path in a simplicial complex is a finite sequence of vertices of a simplicial complex such that is a simplex for each consecutive pair. Repeated consecutive vertices are allowed. Its geometric realization is a continuous path formed by traversing the corresponding line segments, with constant pieces for repetitions.
A connected geometric realization has an edge path between any two vertices. For a fixed vertex, the reachable vertices form a union of whole simplexes: all vertices of a simplex are pairwise joined by edges. The reachable and unreachable geometric parts therefore intersect each simplex in either the whole simplex or the empty set. Both parts are closed in the realization topology and are complements, so both are open. Connectedness forces the unreachable part to be empty. Conversely, edge paths between vertices and straight segments inside simplexes join arbitrary points, so the realization is path-connected.
Euler-Poincare formula Created 2026-09-24 Updated 2026-11-05
For a finite simplicial complex , let count its -dimensional simplexes. Its Euler characteristic is
where is its rational Betti number.
Work over , so the chain groups, cycle modules and boundary modules are finite-dimensional vector spaces. Choosing vector-space complements gives . The boundary dimensions occur twice in the alternating sum, with opposite signs, and cancel. This proves the formula; it does not require splitting off possibly torsion integral homology as a direct summand of an integral cycle module. The rank cancellation in the Euler-Poincare formula gives the same argument without choosing complements.
Finite simplicial complex 2026-11-05
A finite simplicial complex is a simplicial complex containing only finitely many simplexes. With the convention that every vertex belongs to a simplex, this is equivalent to having finitely many vertices of a simplicial complex: a finite vertex set has only finitely many subsets.
Its geometric realization is a finite union of compact geometric simplexes, hence compact. The simplicial chain groups have finite bases, so their boundary maps can be represented by finite matrices. This makes simplicial homology a finite linear-algebra calculation after coefficients are chosen.
Three vertices and their three joining edges form a finite complex whose realization is a circle. Adding the filled triangular face produces a finite complex realizing a disk, which is contractible. Thus finiteness makes the data manageable but does not determine the homotopy type.
Fundamental class of an orientable simplicial pseudomanifold Created 2026-09-24 Updated 2026-11-05
Let be a finite -dimensional simplicial pseudomanifold, , without boundary. If its top-dimensional simplexes admit compatible orientations, their signed sum is a simplicial cycle . Compatibility means that the two induced orientations on each shared codimension-one face of a simplex cancel. Since the top simplexes are connected through such faces, every integral top-dimensional cycle has one common coefficient, up to these orientation signs. Therefore
generated by . If compatible orientations do not exist, propagating a coefficient around an orientation-reversing chain of faces forces it to equal its negative; the integral top homology is then zero.
Finiteness matters for ordinary homology: a triangulated real line is orientable but has . Summing all its edges is an infinite, locally finite chain, rather than an ordinary finite singular chain. Its orientation class belongs instead to Borel-Moore homology.
Geometric realization of a simplicial complex Created 2026-09-29 Updated 2026-10-31
Take one copy of the standard geometric simplex for every face of an abstract simplicial complex , label its vertices by , and identify equally labelled common faces. Give the result the quotient topology from the disjoint union of all these simplexes. Equivalently, a point is a finitely supported family of barycentric coordinates with and .
The weak topology of a simplicial realization makes open precisely when is open in every closed simplex. This definition determines the topology even for infinite complexes, when a metric realization of a simplicial complex may give a different topology.[ref]
Holding-time reversal along a fixed CTMC jump path Created 2026-09-24 Updated 2026-11-05
Fix a finite embedded jump path whose holding rates are positive and finite. Conditional on those successive states, the complete holding times are independent exponential random variables with the corresponding rates. To observe exactly these jumps by a fixed time , the final holding time is censored rather than completed.
Write for this conditional holding-time probability. With ,
The completed holding times supply their density factors; the last portion supplies only an exponential survival factor. The fixed observation time imposes the simplex constraint.
Multiplying by the terminal rate completes the symmetric product of all rates. Reversing the time portions and the state sequence preserves the simplex integral, with unit absolute Jacobian. Hence
The right-hand holding kernel can be defined by this formula even if the reverse embedded path is not feasible; its conditional path interpretation requires that feasibility. For actual unconditioned path probabilities, the holding kernel must also be multiplied by the product of jump-chain transition probabilities. Those products need not agree under reversal, so the holding identity alone is not a reversibility theorem for the chain.
Homology (mathematics) Created 2026-09-24 Updated 2026-11-05
For a chain complex , its th homology is the abelian group or module
The equation says that every chain boundary is a chain cycle. Homology identifies two chain cycles when their difference is a chain boundary; a homology class records exactly what survives this identification.
In singular homology, the chains are finite sums of maps from simplexes into a topological space. A continuous map induces homomorphisms on all homology groups, and homotopic maps induce the same homomorphisms. This makes homology a computable way to distinguish topological spaces that cannot be homotopy equivalent.[ref]
For a circle, records its one path component, while records signed winding around it. A closed disk has the homology of a point: its boundary circle becomes a chain boundary when filled by the disk. Simplicial homology and cellular homology replace singular chains by smaller chain complexes suited to triangulated or cellular spaces.
Integral of an affine function over a simplex Created 2026-10-18 Updated 2026-10-25
For a nondegenerate -dimensional simplex with vertices and an affine function , the integral equals the volume times the value at the centroid . To prove this, write in a barycentric coordinate system. On the standard simplex, symmetry permuting the vertices gives equal integrals of all ; since , each is . An invertible affine map transfers this result to any simplex. Affineness gives , so linearity of integration proves the formula. For a tetrahedron the factor is one quarter. The rule is exact for affine integrands; a nonlinear integrand generally needs additional moments.
Link of a simplex Created 2026-10-25 Updated 2026-11-05
Mesh of a simplicial complex Created 2026-10-03 Updated 2026-11-05
For a geometric simplicial complex in a Euclidean space, its mesh is the supremum of its simplex diameters:
If has finite dimension , its barycentric subdivision satisfies
The vertices of a subdivided simplex are barycentres of nested faces. Bounding the distances between those barycentres gives the displayed factor, uniformly over all original simplexes.
Consequently, if the initial mesh is finite, iterating gives . In particular this holds for a finite simplicial complex. An infinite geometric complex with unbounded edge lengths can instead have infinite mesh after every finite subdivision, so finite dimension alone does not imply the asserted convergence.
Represent a point by finitely supported barycentric coordinates with and support a simplex. Restricting the displayed Euclidean metric on these coordinates gives a metric realization. The coordinate-sum is finite because both points have finite support. For a finite simplicial complex, this agrees with the weak topology of a simplicial realization: the coordinate map from the finite quotient realization is a continuous bijection from a compact space to a Hausdorff space, hence a homeomorphism. For an infinite complex the two topologies can differ, as the countable-star examples demonstrate.
No-retraction covering principle Created 2026-09-24 Updated 2026-11-05
Let be an -dimensional simplex, , with barycentric coordinates . Suppose closed sets cover it and each contains the opposite face of a simplex . Then their common intersection is nonempty. This is the higher-dimensional opposite-face version of the triangle KKM lemma.
If the common intersection were empty, normalized distance functions to the would give a continuous map carrying every face of a simplex into itself. On the boundary, the straight interpolation stays in the same face of a simplex, so is homotopic to the identity map. It therefore induces the identity on reduced top homology. Yet it extends across the contractible simplex, whose reduced homology is zero, a contradiction.
Conversely, any such face-preserving boundary-valued continuous map would produce a counterexample by . These are closed, cover the simplex, contain their opposite faces of a simplex and have empty common intersection, because the sum to one. Thus the covering assertion and the absence of that map are equivalent.
An affine linear classifier in has VC dimension . The upper bound follows from the intersecting convex hull partition theorem: for any points, label the two parts oppositely. The two convex hulls cannot be strictly separated by an affine hyperplane, since they intersect. A weak boundary convention gives the same contradiction: an affine score is nonnegative on the positive convex hull and strictly negative on the negative convex hull. The lower bound comes from the affinely independent vertices of a simplex, because an affine score can interpolate arbitrary signs there.
Consequently, parts (i) and (ii) immediately give
The one-sided orientation of the lifted separators permits the sharper, exact conclusion
To prove the remaining upper bound, take any distinct points and a nonzero affine dependence as in part (c). Write . Reverse every coefficient if necessary so that . Prescribe positive labels when and negative labels when ; zero coefficients may be labelled arbitrarily. If a Euclidean ball realized these labels, its score would satisfy
Indeed, every positive-coefficient term is nonnegative and every negative-coefficient term is strictly positive, with at least one of the latter. On the other hand, expanding the score and using the two affine dependence identities gives
a contradiction. No points are shattered, completing the exact determination of the VC dimension of Euclidean balls. In the exceptional zero-dimensional Euclidean space, every positive-radius Euclidean ball is the whole singleton space, so the VC dimension is zero.