Formal Digital Homology Overview

• Formal digital homology is a framework that builds homological invariants directly for digital images using discrete analogues of classical topology.
• It employs multiple chain models, including cubical and simplicial approaches, to capture digital homotopy variations and computational efficiency.
• The theory addresses challenges such as basepoint alignment and homotopy anomalies while enabling certified computation and practical image processing applications.

Formal digital homology is the program of constructing homological invariants directly for digital images—typically subsets of $\mathbb{Z}^d$ equipped with an adjacency relation—while retaining the algebraic structure, functoriality, and homotopical content expected from algebraic topology. In the literature, this program has developed along several non-equivalent chain models, most prominently digital simplicial, singular simplicial, cubical singular, and $c_1$-cubical theories, together with chain-level reduction methods, certified implementations, and links to digital homotopy groups and Hurewicz-type results. A persistent theme is that the digital setting does not replicate classical topology verbatim: different homology theories need not coincide, ordinary digital homotopy does not always control induced homology maps, and even standard homotopy-equivalence intuitions can fail in the pointed setting (Jamil et al., 2019, Staecker, 2021, Boxer et al., 2015).

1. Foundational setting and scope

A digital image is treated in the cited work as a subset $X \subseteq \mathbb{Z}^d$ equipped with an adjacency relation $\kappa$, or, in pointed form, as $(X,x_0,\kappa)$. Within this framework, digitally continuous maps, digital intervals such as $I=[0,1]_\mathbb{Z}$, and digital homotopies $H:[0,m]_\mathbb{Z}\times X \to Y$ provide the basic categorical and homotopical infrastructure for defining algebraic invariants (Jamil et al., 2019, Boxer et al., 2015).

One of the central motivations for formal digital homology is that classical invariance statements do not automatically survive digitization. In particular, the paper "Homotopy equivalence of finite digital images" (Haarmann et al., 2014) emphasizes that, for digital images, “the Euler characteristic and the homology groups do not remain invariants in the digital setting.” The same line of work catalogs small connected digital images up to homotopy equivalence and introduces numerical invariants such as $L_m(X)$, the number of equivalence classes of simple, irreducible $m$-loops, precisely because classical homological data can miss digital homotopy distinctions (Haarmann et al., 2014).

A further foundational complication concerns basepoints. "Remarks on pointed digital homotopy" (Boxer et al., 2015) exhibits digital images with $c_u$-adjacencies that are homotopic but not pointed homotopic, introduces the tighter notion of “tight at the basepoint (TAB)” pointed homotopy, and proves that some loops are homotopic in the usual pointed sense but not TAB equivalent. This establishes that basepoint management is not a minor technicality in digital topology; it affects the algebraic structure available for homology-adjacent constructions such as loop spaces and fundamental groups (Boxer et al., 2015).

These results delimit the scope of formal digital homology. The subject is not merely a discretization of ordinary singular homology, but a family of algebraic theories adapted to lattice adjacency, finite combinatorics, and digital homotopy relations, with explicit attention to where classical analogies hold and where they fail.

2. Chain models and homology theories

The most systematic homology construction in the supplied literature is digital cubical singular homology. For a digital image $c_1$0, an $c_1$1-dimensional digitally singular cube is a $c_1$2-continuous map $c_1$3, where $c_1$4. The free abelian group generated by digitally singular $c_1$5-cubes is denoted $c_1$6, the subgroup generated by degenerate cubes is $c_1$7, and the chain group is

$c_1$8

For a digital $c_1$9-cube $X \subseteq \mathbb{Z}^d$0, the boundary operator is

$X \subseteq \mathbb{Z}^d$1

with $X \subseteq \mathbb{Z}^d$2 and $X \subseteq \mathbb{Z}^d$3 the front and back $X \subseteq \mathbb{Z}^d$4-faces. The identity $X \subseteq \mathbb{Z}^d$5 yields a chain complex, and the homology groups are defined by

$X \subseteq \mathbb{Z}^d$6

Functoriality is obtained by induced chain maps from $X \subseteq \mathbb{Z}^d$7-continuous maps $X \subseteq \mathbb{Z}^d$8 (Jamil et al., 2019).

Another strand constructs digital homology and cohomology modules from digital simplices rather than cubes. In "Digital (co)homology modules and digital Pontryagin algebras" (Lee, 2011), a digital $X \subseteq \mathbb{Z}^d$9-simplex is a map $\kappa$0, and the chain module $\kappa$1 is the free $\kappa$2-module on all digital $\kappa$3-simplices. The boundary is

$\kappa$4

and the homology module is

$\kappa$5

This approach extends further to cohomology, cross products, and Pontryagin-type algebraic structure on pointed digital Hopf spaces (Lee, 2011).

A later comparative study distinguishes four digital homology theories: simplicial homology of the clique complex, singular simplicial homology, cubical homology in the sense of Jamil and Ali, and $\kappa$6-cubical homology for digital images in $\kappa$7 with $\kappa$8-adjacency. The paper proves that the two simplicial theories are isomorphic to each other, while the simplicial theories are distinct from the cubical theories. It also records that, for $\kappa$9, all four theories coincide, whereas for $(X,x_0,\kappa)$0 the distinctions become substantive (Staecker, 2021).

For $(X,x_0,\kappa)$1-digital images, "Computability of digital cubical singular homology of $(X,x_0,\kappa)$2-digital images" (Jamil et al., 2022) isolates a computationally simpler theory $(X,x_0,\kappa)$3, whose chain groups are generated by elementary $(X,x_0,\kappa)$4-cubes in $(X,x_0,\kappa)$5. The boundary operator is

$(X,x_0,\kappa)$6

and the paper proves functoriality of $(X,x_0,\kappa)$7 as well as a surjective chain map

$(X,x_0,\kappa)$8

from digital cubical singular chains to $(X,x_0,\kappa)$9-cubical chains. A stated open question is whether $I=[0,1]_\mathbb{Z}$0 is injective on homology for all $I=[0,1]_\mathbb{Z}$1-digital images (Jamil et al., 2022).

3. Homotopy, strong homotopy, and Hurewicz-type structure

A major issue in formal digital homology is the interaction between homology and digital homotopy. The comparative paper "Digital homotopy relations and digital homology theories" (Staecker, 2021) shows that homotopic maps have the same induced homomorphisms in cubical homology, whereas strong homotopic maps additionally have the same induced homomorphisms in the simplicial theory. Strong homotopy is presented there as a new type of homotopy relation, with a difference from ordinary digital homotopy “analogous to the difference between digital 4-adjacency and 8-adjacency in the plane” (Staecker, 2021).

The same phenomenon is isolated earlier in "Strong homotopy of digitally continuous functions" (Staecker, 2019). That paper proves that if $I=[0,1]_\mathbb{Z}$2 is finite and $I=[0,1]_\mathbb{Z}$3 are strongly homotopic, then $I=[0,1]_\mathbb{Z}$4 for all $I=[0,1]_\mathbb{Z}$5. It also gives a counterexample showing that digital homotopy alone does not guarantee equality of induced homomorphisms on homology: on the digital cycle $I=[0,1]_\mathbb{Z}$6, a constant map and the identity are homotopic, but induce different maps on $I=[0,1]_\mathbb{Z}$7 (Staecker, 2019). This directly challenges the common misconception that any digital homotopy relation is sufficient for homological invariance.

The strongest digital analogue of a classical bridge between homotopy and homology appears in "Digital Hurewicz Theorem and Digital Homology Theory" (Jamil et al., 2019). For a pointed, $I=[0,1]_\mathbb{Z}$8-connected digital image $I=[0,1]_\mathbb{Z}$9, the paper constructs a natural surjective homomorphism

$H:[0,m]_\mathbb{Z}\times X \to Y$0

whose kernel is the commutator subgroup. Consequently,

$H:[0,m]_\mathbb{Z}\times X \to Y$1

The construction sends a loop class $H:[0,m]_\mathbb{Z}\times X \to Y$2 to the class $H:[0,m]_\mathbb{Z}\times X \to Y$3, where the $H:[0,m]_\mathbb{Z}\times X \to Y$4 are the 1-cube subdivisions of a loop $H:[0,m]_\mathbb{Z}\times X \to Y$5 of length $H:[0,m]_\mathbb{Z}\times X \to Y$6 (Jamil et al., 2019).

The relation to higher homotopy is now explicit as well. "A Second Homotopy Group for Digital Images" (Lupton et al., 2023) defines

$H:[0,m]_\mathbb{Z}\times X \to Y$7

as extension-homotopy classes of maps $H:[0,m]_\mathbb{Z}\times X \to Y$8, proves that $H:[0,m]_\mathbb{Z}\times X \to Y$9 is an abelian group, and computes $L_m(X)$0 for a digital 2-sphere via a triangle-counting degree function. This suggests a broader homotopy-theoretic environment in which digital homology sits, although the supplied sources stop short of stating a full higher Hurewicz theory (Lupton et al., 2023).

4. Pointed loops, eventual constancy, and algebraic refinement

Formal digital homology is closely tied to how loops are represented. In the traditional development of the digital fundamental group, loops of different lengths are compared using trivial extensions. "Remarks on pointed digital homotopy" (Boxer et al., 2015) replaces this by eventually constant paths $L_m(X)$1, defined by the condition that there exist $L_m(X)$2 and $L_m(X)$3 with $L_m(X)$4 for all $L_m(X)$5. An eventually constant loop is an eventually constant path with $L_m(X)$6, and the resulting set of EC homotopy classes forms a group $L_m(X)$7 under concatenation. The paper proves

$L_m(X)$8

while emphasizing that eventually constant loops are often easier to work with than trivial extensions (Boxer et al., 2015).

The same paper introduces the TAB condition. A loop $L_m(X)$9 at basepoint $m$0 is TAB if there does not exist $m$1 such that $m$2. TAB equivalence is strictly finer than standard loop homotopy, and the paper shows explicitly that some loops are homotopic but not TAB equivalent. At the same time, TAB equivalence “does not naturally form a group under the standard loop product,” which reveals that finer pointed invariants need not inherit classical algebraic closure properties (Boxer et al., 2015).

These loop-theoretic refinements matter for homology because the digital Hurewicz theorem depends on a workable fundamental-group formalism, and because careful endpoint control is required for homotopy invariance statements. The eventual-constant framework is also used to correct an earlier flawed proof that homotopy equivalent digital images have isomorphic fundamental groups even when the homotopy equivalence does not preserve the basepoint (Boxer et al., 2015). A plausible implication is that rigorous chain-level and loop-level bookkeeping is not auxiliary in digital topology; it is part of the core formalism.

5. Algorithmic, effective, and certified computation

A substantial part of formal digital homology concerns computability. "Effective persistent homology of digital images" (Romero et al., 2014) combines effective homology, persistent homology, and discrete vector fields to produce algorithms for homological digital image processing. Given a filtered digital image encoded as a cellular or simplicial complex $m$3, the method constructs filtration-compatible reductions

$m$4

to a much smaller critical complex $m$5, preserving persistent homology and enabling explicit lifting of persistent generators back to the original image (Romero et al., 2014).

The algebra behind these reductions is shared with the certified framework of "A certified reduction strategy for homological image processing" (Poza et al., 2013). There, a chain complex $m$6 is reduced by an admissible discrete vector field $m$7, and reduction data are expressed as $m$8 satisfying the usual identities, including

$m$9

The paper formalizes the reduction strategy in Coq/SSReflect, integrates Haskell as an oracle for computationally intensive subroutines, and applies the resulting verified pipeline to digital-image problems in bioinformatics, notably synapse counting via the rank of $c_u$0 (Poza et al., 2013).

An older but closely related chain-homotopical model is the AM-model of "Chain Homotopies for Object Topological Representations" (Gonzalez-Diaz et al., 2011). An AM-model $c_u$1 for a simplicial complex $c_u$2 is determined by a concrete chain homotopy $c_u$3, with projection

$c_u$4

The model stores integer homology generators, representative cycles, and cohomological information such as the invariant $c_u$5, and it is extended in that work to 3D binary digital images, together with update algorithms for union, intersection, difference, and inverse under voxel-set operations (Gonzalez-Diaz et al., 2011).

For direct computation on $c_u$6-digital images, the simpler $c_u$7 theory is explicitly positioned as “much faster and more practical for computation” than full digital cubical singular homology $c_u$8, because the chain groups use only elementary cubes rather than all singular cubes. The surjective chain map $c_u$9 from $c_1$00 to $c_1$01 therefore serves not only as a theoretical comparison map but also as a computational bridge (Jamil et al., 2022).

6. Localization, applications, and open directions

Formal digital homology is not restricted to global invariants. "Locating topological structures in digital images via local homology" (Hu, 2023) develops a local-system framework for binary images $c_1$02, with $c_1$03, based on decompositions $c_1$04 and the short filtration

$c_1$05

The paper defines the local merging number $c_1$06 as the number of barcodes $c_1$07, and the local outer-merging number $c_1$08 as the number of barcodes $c_1$09, then applies a sliding-window algorithm to produce heatmaps that approximate the locations of holes in digital images (Hu, 2023).

A different extension appears in intersection homology. "Stratified Formal Deformations and Intersection Homology of Data Point Clouds" (Banagl et al., 2020) introduces stratified formal deformations, stratified spines, and a layered-spine algorithm for filtered simplicial complexes associated to point clouds. The paper proves that if two filtered polyhedra are related by a stratified formal deformation, then they are stratified homotopy equivalent and have isomorphic intersection homology for any perversity. This is not digital homology in the narrow lattice sense, but it shows how homological formalization for discrete data extends to singular and stratified settings (Banagl et al., 2020).

Recent applied work uses digital homology as a feature extractor rather than only as an invariant. "Topological Invariant-Based Iris Identification via Digital Homology and Machine Learning" (Öztel et al., 13 Aug 2025) computes $c_1$10, $c_1$11, and their ratio on grid subregions of normalized iris images using oriented digital simplicial complexes on binary images. The paper reports that logistic regression on these topological features achieved $c_1$12 accuracy, compared with $c_1$13 for a CNN baseline, and presents this as the first use of topological invariants from formal digital homology for iris recognition (Öztel et al., 13 Aug 2025).

Several open directions remain explicit in the sources. The relation between $c_1$14 and $c_1$15 is not completely resolved (Jamil et al., 2022). Strong homotopy, rather than ordinary digital homotopy, appears to be the correct context for some homological invariance statements (Staecker, 2019). The failure of classical homology to behave as a digital homotopy invariant motivates alternative invariants such as $c_1$16 and newer geometric invariants such as the outer perimeter for digital pictures in $c_1$17 (Haarmann et al., 2014, Lee et al., 3 Sep 2025). This suggests that formal digital homology is best understood not as a single settled theory, but as an active algebraic-topological framework in which model choice, adjacency, homotopy relation, and computational representation all materially affect the resulting invariant.