From Graphs to Higher Dimensions
A plane graph has vertices, edges, and faces — objects of dimension 0, 1, and 2.
In Planar Graphs & Euler's Formula,
the interplay among these three types of objects produced Euler's formula
\(V - E + F = 2\), a topological invariant that depends only on the surface of
embedding. In Incidence Structure &
Cycle/Cut Spaces, we encoded the relationship between vertices and edges
algebraically through the oriented incidence matrix \(\boldsymbol{B}\), which we
identified as the boundary operator \(\partial_1\). We now generalize both ideas
simultaneously: a \(k\)-simplex is the \(k\)-dimensional analogue of
a vertex (\(k=0\)), an edge (\(k=1\)), or a filled triangle (\(k=2\)), and a
simplicial complex is a space assembled from simplices of various
dimensions, glued together along their faces.
This is the gateway to algebraic topology: we replace continuous
spaces with combinatorial skeletons built from simplices, and then apply the algebraic
machinery of
linear algebra —
kernels, images, quotients — to extract topological information. The payoff will come
in the sequel on Homology, where we measure "holes" of each dimension
by computing \(H_k = \ker \partial_k / \operatorname{im} \partial_{k+1}\).
The \(k\)-Simplex
Definition: Geometric \(k\)-Simplex
Let \(v_0, v_1, \dots, v_k \in \mathbb{R}^d\) be \(k+1\) points in
general position (i.e., affinely independent: the vectors
\(v_1 - v_0, \; v_2 - v_0, \; \dots, \; v_k - v_0\) are linearly independent).
The geometric \(k\)-simplex spanned by these vertices is the
convex hull
\[
\sigma = [v_0, v_1, \dots, v_k]
= \left\{ \sum_{i=0}^{k} \lambda_i v_i \;\Big|\; \lambda_i \geq 0, \;
\sum_{i=0}^{k} \lambda_i = 1 \right\}.
\]
The integer \(k\) is called the dimension of \(\sigma\).
The coordinates \((\lambda_0, \lambda_1, \dots, \lambda_k)\) satisfying the constraints
above are called barycentric coordinates. They give every point in the
simplex as a weighted average of the vertices, with non-negative weights summing to one.
The low-dimensional cases are familiar:
- A 0-simplex is a single point (vertex).
- A 1-simplex is a line segment (edge).
- A 2-simplex is a filled triangle.
- A 3-simplex is a solid tetrahedron.
The affine-independence condition ensures that the simplex does not degenerate: a
2-simplex requires three non-collinear points, a 3-simplex requires four non-coplanar
points, and so on. A \(k\)-simplex lives in at least \(k\)-dimensional ambient space.
Faces
Definition: Face of a Simplex
A face of the simplex \(\sigma = [v_0, v_1, \dots, v_k]\) is any
simplex spanned by a non-empty subset of the vertices. Specifically, for each
subset \(\{v_{i_0}, v_{i_1}, \dots, v_{i_j}\} \subseteq \{v_0, \dots, v_k\}\),
the simplex \(\tau = [v_{i_0}, \dots, v_{i_j}]\) is a \(j\)-face
of \(\sigma\). A face \(\tau\) is called proper if
\(\tau \neq \sigma\).
A \(k\)-simplex has exactly \(\binom{k+1}{j+1}\) faces of dimension \(j\), for
\(0 \leq j \leq k\). In total, it has \(2^{k+1} - 1\) non-empty faces (every
non-empty subset of the \(k+1\) vertices defines a face). For instance, a 2-simplex
\([v_0, v_1, v_2]\) has three 0-faces (the vertices), three 1-faces (the edges
\([v_0, v_1]\), \([v_0, v_2]\), \([v_1, v_2]\)), and itself as the unique 2-face —
seven faces in all.
Abstract Simplicial Complexes
Just as a graph can be studied as a purely combinatorial object \(G = (V, E)\) without
reference to any embedding in \(\mathbb{R}^d\), simplicial complexes admit a purely
combinatorial formulation.
Definition: Abstract Simplicial Complex
An abstract simplicial complex on a finite vertex set \(V\) is a
collection \(K\) of non-empty subsets of \(V\) (called simplices)
satisfying:
- Every singleton \(\{v\}\) with \(v \in V\) belongs to \(K\).
- If \(\sigma \in K\) and \(\tau \subseteq \sigma\) with \(\tau \neq \emptyset\),
then \(\tau \in K\). (Every non-empty face of a simplex is in \(K\).)
The dimension of a simplex \(\sigma \in K\) with \(|\sigma| = k+1\)
is \(k\). The dimension of the complex \(K\) is
\(\dim K = \max\{k : K \text{ contains a } k\text{-simplex}\}\).
The face condition (also called the downward closure or
hereditary property) is the defining constraint: if a filled triangle
\(\{a, b, c\}\) is in \(K\), then all three of its edges \(\{a,b\}\), \(\{a,c\}\),
\(\{b,c\}\) and all three of its vertices must also be in \(K\). There is no
"floating" high-dimensional simplex without its skeleton.
Graphs as 1-Dimensional Complexes
Every simple graph \(G = (V, E)\) is naturally a 1-dimensional abstract simplicial
complex: the simplices of \(K_G\) are the singletons \(\{v\}\) for \(v \in V\) (the
0-simplices) and the edges \(\{u, v\}\) for \(\{u,v\} \in E\) (the 1-simplices). The
face condition holds trivially: every edge contains its two endpoints. The
graph theory we have developed
throughout Section IV — from basic structure through
trees,
planarity, and
incidence structure — is,
from this viewpoint, the theory of 1-dimensional simplicial complexes.
The passage from graphs to higher-dimensional complexes is the passage from recording
only pairwise relationships (\(\{u,v\} \in E\)) to recording
higher-order relationships: a 2-simplex \(\{a, b, c\}\) asserts that
\(a\), \(b\), and \(c\) participate in a simultaneous three-way interaction, not
merely three separate pairwise ones. This distinction is invisible to a graph but
central to the topology of the complex.
Geometric Realization
An abstract complex can always be embedded geometrically.
Theorem: Geometric Realization
Every abstract simplicial complex \(K\) of dimension \(d\) can be geometrically
realized in \(\mathbb{R}^{2d+1}\). That is, there exists a collection of geometric
simplices in \(\mathbb{R}^{2d+1}\) whose combinatorial structure (vertex sets and
face relations) is exactly \(K\).
The proof places the vertices on the moment curve
\(t \mapsto (t, t^2, \dots, t^{2d+1})\) at distinct parameter values; the
Vandermonde structure of this curve guarantees that any \(2d + 2\) or fewer
points on it are in general position, so every \(d\)-simplex in \(K\) is
non-degenerate. For our purposes, the
theorem guarantees that no generality is lost in working abstractly: every abstract
complex has a concrete geometric manifestation, and all topological invariants (Euler
characteristic, homology groups) can be computed from the combinatorics alone.
Constructing Complexes from Data
In combinatorics, simplicial complexes arise by declaring which higher-order
interactions exist. In applications — particularly Topological Data
Analysis (TDA) — we start with raw data (a point cloud, a graph, a metric
space) and construct a simplicial complex from it. The three constructions
below are the workhorses of the field.
The Clique Complex (Flag Complex)
Definition: Clique Complex
Let \(G = (V, E)\) be a simple graph. The clique complex (or
flag complex) of \(G\) is the abstract simplicial complex
\[
\operatorname{Cl}(G) = \bigl\{\sigma \subseteq V :
\text{every pair in } \sigma \text{ is connected by an edge in } G\bigr\}.
\]
In other words, the simplices of \(\operatorname{Cl}(G)\) are exactly the
cliques of \(G\).
The clique complex is "maximally filled": it contains a \(k\)-simplex whenever all
\(\binom{k+1}{2}\) pairwise edges are present. No independent judgment about
higher-order interactions is needed — they are inferred from pairwise data. This makes
the clique complex the cheapest way to lift a graph into a simplicial complex, but
also the most aggressive: it creates high-dimensional simplices wherever complete
subgraphs occur.
The Vietoris-Rips Complex
Definition: Vietoris-Rips Complex
Let \((X, d)\) be a finite metric space and let \(\varepsilon > 0\). The
Vietoris-Rips complex at scale \(\varepsilon\) is the clique
complex of the \(\varepsilon\)-neighborhood graph:
\[
\operatorname{VR}(X, \varepsilon) = \operatorname{Cl}(G_\varepsilon),
\quad \text{where} \quad
G_\varepsilon = (X,\; \{\{x,y\} : d(x,y) \leq \varepsilon\}).
\]
A subset \(\sigma \subseteq X\) is a simplex of
\(\operatorname{VR}(X, \varepsilon)\) if and only if every pair of points in
\(\sigma\) is within distance \(\varepsilon\).
The Vietoris-Rips complex converts a point cloud into a simplicial complex using a
single parameter \(\varepsilon\): connect points that are close, then fill in all
cliques. It is computationally convenient because membership in the complex is
determined entirely by pairwise distances — no higher-order geometric tests are needed.
The Čech Complex
Definition: Čech Complex
Let \(X = \{x_1, \dots, x_n\} \subset \mathbb{R}^d\) and let \(\varepsilon > 0\).
The Čech complex at scale \(\varepsilon\) is
\[
\check{C}(X, \varepsilon) = \bigl\{\sigma \subseteq X :
\textstyle\bigcap_{x \in \sigma} B(x, \varepsilon/2) \neq \emptyset\bigr\},
\]
where \(B(x, r)\) is the closed ball of radius \(r\) centered at \(x\). A subset
\(\sigma\) is a simplex if and only if the balls of radius \(\varepsilon/2\)
around the points of \(\sigma\) have a common intersection.
The Čech complex has a deep topological justification: the Nerve
Theorem guarantees that \(\check{C}(X, \varepsilon)\) is homotopy equivalent
to the union of balls \(\bigcup_{x \in X} B(x, \varepsilon/2)\). It therefore captures
the "true" topology of the thickened point cloud. However, the intersection test is
more expensive than the pairwise-distance test of the Rips complex: checking whether
\(k+1\) balls have a common point requires geometric computation beyond pairwise
distances.
For any \(\varepsilon > 0\), the Čech and Rips complexes satisfy the inclusions
\[
\check{C}(X, \varepsilon)
\;\subseteq\; \operatorname{VR}(X, \varepsilon)
\;\subseteq\; \check{C}(X, 2\varepsilon),
\]
so the Rips complex sandwiches the Čech complex at comparable scales. In practice,
the Rips complex is preferred for computation, and the Čech complex provides the
theoretical guarantee.
Filtrations and Persistence
For a fixed \(\varepsilon\), the Rips and Čech complexes produce a single snapshot.
The central idea of TDA is to vary \(\varepsilon\) continuously and track how the
topology changes.
Definition: Filtration
A filtration of a simplicial complex \(K\) is a nested sequence
of subcomplexes
\[
\emptyset = K_0 \subseteq K_1 \subseteq K_2 \subseteq \cdots \subseteq K_m = K
\]
indexed by a parameter (typically the scale \(\varepsilon\)).
As \(\varepsilon\) increases from 0, new edges and higher-dimensional simplices are
born, connected components merge, loops form and are later filled in by 2-simplices.
Persistent homology — to be studied after we introduce homology
groups — tracks the "birth" and "death" of each topological feature across the
filtration, recording the result in a persistence diagram. Features
that persist over a long range of \(\varepsilon\) are considered genuine topological
signal; short-lived features are noise. This is the mathematical foundation of modern
TDA pipelines.
Connection to Topological Data Analysis
The pipeline from raw data to topological features is:
point cloud \(\xrightarrow{\varepsilon}\)
Rips/Čech complex \(\xrightarrow{\partial_k}\)
chain complex \(\xrightarrow{H_k}\)
Betti numbers \(\xrightarrow{\text{vary } \varepsilon}\)
persistence diagram.
This pipeline treats data as a geometric object and extracts shape descriptors
that are invariant under continuous deformations. In machine learning, persistence
diagrams serve as features for classification and regression tasks on
point-cloud data — from protein structure analysis to sensor network coverage.
The constructions on this page supply the first two arrows; the remaining arrows
require the boundary operator (Section 4 below) and the homology theory of the
next page.
The f-vector and Euler Characteristic
In Planar Graphs, we defined the
Euler characteristic of a plane graph as \(\chi = V - E + F = 2\), counting
objects of dimension 0 (vertices), 1 (edges), and 2 (faces) with alternating signs.
Simplicial complexes have objects at every dimension, and the same alternating-sign
pattern generalizes naturally.
The f-vector
Definition: f-vector
Let \(K\) be a simplicial complex of dimension \(d\). The
f-vector of \(K\) is the tuple
\[
\boldsymbol{f}(K) = (f_0, f_1, \dots, f_d),
\]
where \(f_k\) is the number of \(k\)-simplices in \(K\).
For a graph \(G = (V, E)\) viewed as a 1-complex, the f-vector is simply
\((|V|, |E|)\). For a triangulated surface, the f-vector is \((V, E, F)\) —
the counts that appear in Euler's formula.
Example:
Consider the boundary of a tetrahedron: four vertices, six edges, and four
triangular faces (but no solid 3-simplex). As an abstract simplicial complex,
this is \(K = \binom{[4]}{1} \cup \binom{[4]}{2} \cup \binom{[4]}{3}\) — all
non-empty subsets of \(\{1,2,3,4\}\) of size at most 3. The f-vector is
\[
\boldsymbol{f} = (f_0, f_1, f_2) = (4, 6, 4).
\]
The Euler Characteristic of a Complex
Definition: Euler Characteristic
The Euler characteristic of a simplicial complex \(K\) with
f-vector \((f_0, f_1, \dots, f_d)\) is the alternating sum
\[
\chi(K) = \sum_{k=0}^{d} (-1)^k f_k
= f_0 - f_1 + f_2 - f_3 + \cdots + (-1)^d f_d.
\]
For the boundary of the tetrahedron: \(\chi = 4 - 6 + 4 = 2\). This agrees with
Euler's formula for the sphere — and it must, because the boundary of a tetrahedron
is homeomorphic to \(S^2\). For a graph (1-complex) with \(c\) connected components,
\(\chi = V - E\). The dimension formula from
Cycle/Cut Spaces gives
\(\dim Z_1 = E - V + c\), so \(\chi = V - E = c - \dim Z_1\).
When \(K\) is connected, \(\chi = 1 - \dim Z_1\): the Euler characteristic
detects the cycle rank.
The Euler characteristic is a topological invariant: if two complexes
are homeomorphic
(as topological spaces via their geometric realizations), they have
the same \(\chi\). This is remarkable — \(\chi\) is computed from a simple counting
formula, yet it encodes deep topological information. The full explanation requires
homology: the Euler-Poincaré theorem on the next page will show that
\(\chi(K) = \sum_{k} (-1)^k \beta_k\), where \(\beta_k = \dim H_k\) are the
Betti numbers. Since homology groups are topological invariants, so
is their alternating sum.
Example: The Solid Tetrahedron
The solid tetrahedron (including the 3-simplex itself) has f-vector
\((f_0, f_1, f_2, f_3) = (4, 6, 4, 1)\). Its Euler characteristic is
\(\chi = 4 - 6 + 4 - 1 = 1\). This equals the Euler characteristic of a point
(a single 0-simplex has \(\chi = 1\)), which is consistent: the solid tetrahedron
is contractible (continuously deformable to a point), and contractible spaces
always have \(\chi = 1\).
Example: The Torus
A minimal triangulation of the torus uses \(f_0 = 7\) vertices, \(f_1 = 21\)
edges, and \(f_2 = 14\) triangles. The Euler characteristic is
\(\chi = 7 - 21 + 14 = 0\). This matches the formula
\(\chi = 2 - 2g\) for an orientable surface of genus \(g\): the torus has
\(g = 1\), giving \(\chi = 0\). For comparison, the sphere has \(g = 0\) and
\(\chi = 2\), and the double torus has \(g = 2\) and \(\chi = -2\).
Orientation and the Boundary Operator
In Incidence Structure, we
oriented edges and defined the incidence matrix \(\boldsymbol{B}\), which we
identified as the boundary operator \(\partial_1\) mapping 1-chains (edge space) to
0-chains (vertex space). We now generalize: an oriented \(k\)-simplex
carries a sign determined by the ordering of its vertices, and the
boundary operator \(\partial_k\) maps \(k\)-chains to
\((k-1)\)-chains by removing one vertex at a time, with alternating signs.
Oriented Simplices
Definition: Oriented Simplex
An oriented \(k\)-simplex is an equivalence class of orderings
of the vertex set \(\{v_0, v_1, \dots, v_k\}\), where two orderings are
equivalent if they differ by an even permutation. The two
equivalence classes correspond to the two possible orientations. We write
\([v_0, v_1, \dots, v_k]\) for the oriented simplex determined by the given
ordering, and adopt the convention
\[
[v_{\pi(0)}, v_{\pi(1)}, \dots, v_{\pi(k)}]
= \operatorname{sgn}(\pi) \cdot [v_0, v_1, \dots, v_k]
\]
for any permutation \(\pi \in S_{k+1}\).
In Combinatorics, we studied
the sign (parity) of permutations: even permutations preserve orientation, odd
permutations reverse it. For an edge (\(k=1\)), there are two orderings of the two
vertices, and \([a, b] = -[b, a]\) — a transposition is an odd permutation. This is
exactly the orientation convention we used in
Incidence Structure:
choosing \(a \to b\) versus \(b \to a\) differs by a sign.
For a 2-simplex (triangle), the six orderings of \(\{a, b, c\}\) split into two
orientation classes:
\[
+[a,b,c] = [b,c,a] = [c,a,b], \qquad -[a,b,c] = [b,a,c] = [a,c,b] = [c,b,a].
\]
The positive class corresponds to a counterclockwise traversal of the triangle
(in a plane embedding), and the negative class to clockwise. The
choice is a convention — the essential point is that once we fix an orientation for
each simplex, the boundary operator is well-defined.
The Boundary Operator
Definition: Boundary Operator \(\partial_k\)
For an oriented \(k\)-simplex \(\sigma = [v_0, v_1, \dots, v_k]\) with
\(k \geq 1\), the boundary of \(\sigma\) is the alternating sum
of its \((k-1)\)-dimensional faces:
\[
\partial_k(\sigma) = \partial_k [v_0, v_1, \dots, v_k]
= \sum_{i=0}^{k} (-1)^i \, [v_0, \dots, \hat{v}_i, \dots, v_k],
\]
where \(\hat{v}_i\) denotes the omission of vertex \(v_i\). By convention,
\(\partial_0 = 0\) (the boundary of a vertex is empty).
Let us verify that this generalizes what we already know.
Example: \(\partial_1\) and the Incidence Matrix
For a 1-simplex (oriented edge) \([a, b]\):
\[
\partial_1 [a, b] = (-1)^0 [b] + (-1)^1 [a] = [b] - [a].
\]
The boundary of \([a, b]\) is "head minus tail." In
Incidence
Structure, the oriented incidence matrix used the opposite sign
convention: \(B_{v,e} = +1\) at the tail and \(-1\) at the head, so the
column of \(\boldsymbol{B}\) for edge \(a \to b\) encodes \(a - b = -\partial_1[a,b]\).
Thus \(\boldsymbol{B}\), viewed as a linear map \(\mathbb{R}^E \to \mathbb{R}^V\),
equals \(-\partial_1\). The sign difference is a harmless convention: the kernel
\(Z_1 = \ker \partial_1 = \ker \boldsymbol{B}\) and the image
\(\operatorname{im} \partial_1 = \operatorname{im} \boldsymbol{B}\) are
identical regardless of the global sign.
Example: \(\partial_2\) — the Boundary of a Triangle
For a 2-simplex \([a, b, c]\):
\[
\partial_2 [a, b, c] = [b, c] - [a, c] + [a, b].
\]
Rewriting: \(\partial_2 [a,b,c] = [a,b] + [b,c] - [a,c] = [a,b] + [b,c] + [c,a]\),
since \(-[a,c] = [c,a]\). This is the oriented boundary cycle of the triangle,
traversed counterclockwise — a 1-chain that represents a closed loop around the
triangle. This is a 1-cycle: it lives in
\(Z_1 = \ker \partial_1\), because applying \(\partial_1\) gives
\((b - a) + (c - b) + (a - c) = 0\).
Chain Groups
The boundary operator is a linear map. To make this precise, we introduce
chain groups.
Definition: Chain Group
The \(k\)-th chain group of a simplicial complex \(K\) (with
coefficients in \(\mathbb{R}\)) is the real
vector space
\[
C_k(K; \mathbb{R}) = \mathbb{R}^{f_k},
\]
with one basis vector for each \(k\)-simplex of \(K\), after fixing
a choice of orientation for each. An element
\(c \in C_k\) is a formal \(\mathbb{R}\)-linear combination of these oriented
\(k\)-simplices, called a \(k\)-chain. (The opposite orientation
is represented by the negative of the basis vector, not by a separate
basis element.)
For \(k = 0\): \(C_0 = \mathbb{R}^{f_0}\) is the space of formal combinations of
vertices — the "vertex space" \(\mathbb{R}^V\) from
Incidence Structure. For
\(k = 1\): \(C_1 = \mathbb{R}^{f_1}\) is the edge space \(\mathbb{R}^E\). The
boundary operator is then a linear map \(\partial_k : C_k \to C_{k-1}\), defined on
basis elements by the alternating-sum formula above and extended by linearity.
We equip each \(C_k\) with the inner product that makes the chosen oriented basis
orthonormal. Under this convention, the matrix transpose \(\partial_k^\top\) is
exactly the adjoint of \(\partial_k\), and the Laplacians defined later in this
section are symmetric positive semi-definite — as they should be.
A note on coefficients: classical algebraic topology typically works over
\(\mathbb{Z}\), where the homology groups can detect torsion
(e.g., the twisted cycle in \(\mathbb{R}P^2\)). We use \(\mathbb{R}\) throughout,
which erases torsion but gives us genuine vector spaces on which inner products,
spectral decompositions, and Laplacians are defined. This is the standard choice
in Topological Data Analysis and Simplicial Neural Networks — the applications
toward which this page is oriented.
The Chain Complex
Assembling the chain groups and boundary maps, we obtain a sequence of vector spaces
connected by linear maps:
\[
\cdots \xrightarrow{\partial_{k+1}} C_k
\xrightarrow{\partial_k} C_{k-1}
\xrightarrow{\partial_{k-1}} \cdots
\xrightarrow{\partial_2} C_1
\xrightarrow{\partial_1} C_0
\xrightarrow{\partial_0} 0.
\]
This sequence is called the chain complex of \(K\). Its most
important property is the subject of the next theorem.
The Fundamental Property: \(\partial^2 = 0\)
Theorem: \(\partial_{k-1} \circ \partial_k = 0\)
For every \(k \geq 1\), the composition of two successive boundary operators is
the zero map:
\[
\partial_{k-1} \circ \partial_k = 0
\quad \Longleftrightarrow \quad
\operatorname{im}(\partial_k) \subseteq \ker(\partial_{k-1}).
\]
Proof:
It suffices to check on a basis element
\(\sigma = [v_0, v_1, \dots, v_k]\). We compute:
\[
\partial_{k-1}(\partial_k(\sigma))
= \partial_{k-1}\left(\sum_{i=0}^{k} (-1)^i
[v_0, \dots, \hat{v}_i, \dots, v_k]\right)
= \sum_{i=0}^{k} (-1)^i \sum_{\substack{j=0 \\ j \neq i}}^{k} (-1)^{j'}
[v_0, \dots, \hat{v}_i, \dots, \hat{v}_j, \dots, v_k],
\]
where \(j'\) is the position of \(v_j\) in the sequence after \(v_i\) has been
removed: \(j' = j\) if \(j < i\), and \(j' = j - 1\) if \(j > i\).
Each pair \(\{i, j\}\) with \(i \neq j\) contributes two terms to the double
sum — one from the \((i, j)\) order and one from the \((j, i)\) order. For
\(i < j\): the \((i,j)\) term has sign \((-1)^i(-1)^{j-1}\) and the \((j,i)\)
term has sign \((-1)^j(-1)^i\). Their sum is
\[
(-1)^{i+j-1} + (-1)^{i+j} = (-1)^{i+j-1}(1 - 1) = 0.
\]
Since every pair cancels, the entire double sum vanishes.
This is the non-trivial sign cancellation result previewed in
Incidence
Structure. For graphs (\(k = 1\)), the composition
\(\partial_0 \circ \partial_1 = 0\) was vacuously true because we set
\(\partial_0 = 0\). For \(k \geq 2\), the cancellation is genuine: it is the
alternating signs in the boundary formula — inherited from the parity of permutations
— that make every pair of omitted vertices cancel. This is the algebraic reason that
"the boundary of a boundary is empty."
We verified a concrete instance above: \(\partial_2[a,b,c] = [a,b] + [b,c] + [c,a]\)
is a closed loop, and \(\partial_1\) of a closed loop sums to zero at every vertex.
The theorem guarantees this happens in every dimension.
Matrix Representation of \(\partial_k\)
Once we choose an ordering and orientation for the simplices, each boundary operator
\(\partial_k\) is represented by a matrix \([\partial_k] \in \mathbb{R}^{f_{k-1} \times f_k}\)
whose entries are \(0, +1,\) or \(-1\). The matrix \([\partial_1]\) is
(up to a global sign) the oriented incidence matrix \(\boldsymbol{B}\) itself —
both are \(|V| \times |E|\) matrices mapping the edge space to the vertex space,
as established in the example above. The
matrix \([\partial_2]\) has one column per oriented 2-simplex and one row per oriented
1-simplex, with \(\pm 1\) entries recording the incidence.
Example: The Boundary of a Tetrahedron
Consider the boundary of a tetrahedron on vertices \(\{1, 2, 3, 4\}\), with
oriented 2-simplices \(\sigma_1 = [1,2,3]\), \(\sigma_2 = [1,2,4]\),
\(\sigma_3 = [1,3,4]\), \(\sigma_4 = [2,3,4]\), and the six oriented edges
listed as \(e_1 = [1,2]\), \(e_2 = [1,3]\), \(e_3 = [1,4]\),
\(e_4 = [2,3]\), \(e_5 = [2,4]\), \(e_6 = [3,4]\). Then
\(\partial_2 \sigma_1 = [2,3] - [1,3] + [1,2] = e_4 - e_2 + e_1\), and
similarly for the others. The resulting matrix \([\partial_2] \in \mathbb{R}^{6 \times 4}\) has
entries \(\pm 1\) and satisfies \([\partial_1][\partial_2] = 0\) — the
matrix-level statement of \(\partial^2 = 0\).
Higher-Order Laplacians
In Incidence
Structure, we previewed the Hodge Laplacian
\[
\boldsymbol{L}_k = \partial_{k+1}\partial_{k+1}^\top + \partial_k^\top \partial_k.
\]
We can now see where this formula comes from. The first term,
\(\partial_{k+1}\partial_{k+1}^\top\), measures how a \(k\)-chain is "enclosed" by
\((k+1)\)-simplices (the upper Laplacian \(L_k^{\mathrm{up}}\)).
The second term, \(\partial_k^\top \partial_k\), measures how a \(k\)-chain
connects to \((k-1)\)-simplices via the coboundary (the lower
Laplacian \(L_k^{\mathrm{down}}\)). Together, they capture the
full adjacency structure at dimension \(k\).
For \(k = 0\): \(\partial_0 = 0\), so
\(\boldsymbol{L}_0 = \partial_1 \partial_1^\top\) — the graph Laplacian from
Graph Laplacians.
For \(k = 1\): \(\boldsymbol{L}_1 = \partial_2 \partial_2^\top + \partial_1^\top \partial_1\)
captures the adjacency of edges through shared vertices (\(\partial_1^\top \partial_1\))
and through co-bounding triangles (\(\partial_2 \partial_2^\top\)). The condition
\(\partial^2 = 0\) ensures that the two terms interact cleanly: they share a common
null space that corresponds to the harmonic chains — elements that
are simultaneously cycles and cocycles. By the discrete Hodge theorem,
this harmonic space is isomorphic to the homology group \(H_k\), connecting spectral
theory to topology.
From Simplicial Complexes to Simplicial Neural Networks
In Incidence
Structure, we noted that Graph Neural Networks perform message
passing via the eigenfunctions of \(\boldsymbol{L}_0\).
Simplicial Neural Networks (SNNs) extend this idea by operating
on higher-dimensional chains via the Hodge Laplacians \(\boldsymbol{L}_k\). A
signal on edges (such as traffic flow on a road network) is a 1-chain
\(\boldsymbol{x} \in C_1\), and message passing via \(\boldsymbol{L}_1\)
aggregates information both from neighboring edges (through \(\partial_1^\top \partial_1\))
and from co-bounding triangles (through \(\partial_2 \partial_2^\top\)). The
boundary matrices \([\partial_k]\) — constructed on this page from the simplicial
structure — are the sparse, discrete operators that make this architecture
computationally tractable. The condition \(\partial^2 = 0\) is not merely an
algebraic curiosity: it guarantees that the Hodge decomposition is well-defined,
splitting any \(k\)-chain into a gradient, a curl, and a harmonic component — the
higher-dimensional analogue of the
Helmholtz
decomposition of edge flows.