Chain Homotopy and Homology Calculator

A tool to verify the chain homotopy equation and visualize the relationship between chain maps.

Chain Homotopy Verifier

This calculator verifies the chain homotopy identity: f - g = dh + hd for small chain complexes over integers. Enter the matrix representations for the boundary maps (d), chain maps (f, g), and the proposed chain homotopy (h).

---

---

Enter valid matrix values to see the result.

What is Calculating Homology using Chain Homotopy?

In the field of algebraic topology, homology is a powerful tool for distinguishing different topological spaces. It works by associating a sequence of abelian groups, called homology groups, to a space. These groups provide algebraic invariants that capture information about the “holes” of various dimensions in the space. A chain complex is the foundational algebraic structure used to define homology. It is a sequence of modules (like vector spaces or abelian groups) connected by linear maps called boundary operators, with the crucial property that the composition of any two consecutive maps is zero.

A chain map is a map between two chain complexes that respects their structure. A key question is to determine when two different chain maps are “equivalent” from the perspective of homology. This is where chain homotopy comes in. A chain homotopy is a specific algebraic relation between two chain maps, say f and g. If a chain homotopy exists between f and g, they are said to be chain homotopic. The most important consequence, and the reason we care about this concept, is that chain homotopic maps induce the exact same map on the homology groups. Therefore, this calculator doesn’t compute homology groups directly, but rather verifies the chain homotopy condition, which proves the two maps are indistinguishable at the level of homology.

The Chain Homotopy Formula and Explanation

Given two chain complexes (C, dᶜ) and (D, dᵈ), and two chain maps f, g: C → D, a chain homotopy h is a collection of maps hₙ: Cₙ → Dₙ₊₁ that satisfy the following equation for all dimensions n.

fₙ – gₙ = dᵈₙ₊₁ hₙ + hₙ₋₁ dᶜₙ

This formula connects the difference between the two chain maps (fₙ - gₙ) to the boundary operators of the complexes and the homotopy maps.

Variables in the Chain Homotopy Formula

Variable	Meaning	Unit / Type	Typical Range
fₙ, gₙ	Chain maps from Cₙ to Dₙ.	Matrices (linear maps)	Entries are typically integers or field elements.
dᶜₙ, dᵈₙ	Boundary operators for complexes C and D.	Matrices (linear maps)	Must satisfy d∘d=0.
hₙ	The chain homotopy map from Cₙ to Dₙ₊₁.	Matrices (linear maps)	The “glue” that connects f and g.
n	The dimension or degree in the chain complex.	Integer	… -1, 0, 1, 2, …

Practical Examples

Example 1: A Verified Homotopy

Let’s use the default values in the calculator. We are checking the homotopy relation at dimension n=1. We want to see if f₁ - g₁ equals d₂ᵈh₁ + h₀d₁ᶜ.

• Inputs: The matrices for dᶜ, dᵈ, f₁, g₁, h₁, and h₀ as defined in the calculator’s default state.
• Calculation:
  • f₁ - g₁ results in the matrix [[0, -1, 0], [0, 0, -1]].
  • d₂ᵈh₁ and h₀d₁ᶜ are calculated and then added together, also resulting in [[0, -1, 0], [0, 0, -1]].
• Result: Since both sides of the equation yield the same matrix, the homotopy is verified. This proves that the maps f and g will have the same effect on the first homology group, H₁(C).

Example 2: A Failed Homotopy

Let’s alter the input slightly. Change the h₁ matrix from [,] to [,] and re-calculate.

• Inputs: Same as above, but with a modified h₁.
• Calculation:
  • f₁ - g₁ remains [[0, -1, 0], [0, 0, -1]].
  • The new d₂ᵈh₁ + h₀d₁ᶜ will now compute to a different matrix because h₁ has changed.
• Result: The two resulting matrices will not be equal. The calculator will report that the equation is not satisfied, meaning the provided h is NOT a valid chain homotopy between f and g.

How to Use This Chain Homotopy Calculator

1. Define Dimensions: Start by setting the dimensions of the vector spaces in your chain complexes C and D. The calculator is set up for a small complex (C₂ → C₁ → C₀) and (D₂ → D₁ → D₀).
2. Enter Boundary Maps: Input the matrices for the boundary maps (d). Ensure their dimensions are correct and that they satisfy the condition d²=0 (though this calculator does not verify that).
3. Enter Chain Maps: Input the matrices for the two chain maps, f and g, that you want to compare.
4. Propose a Homotopy: Input the matrices for the proposed chain homotopy, h. Remember that hₙ maps from Cₙ to Dₙ₊₁.
5. Verify: Click the “Verify Homotopy” button. The calculator performs the matrix algebra for the chain homotopy formula.
6. Interpret Results: The primary result will state whether the homotopy equation holds. The intermediate calculation section shows the matrices for both sides of the equation, allowing you to see the verification yourself.

Key Factors That Affect Chain Homotopy

• The Ring/Field: Calculations are done over integers here, but in general, they happen over a ring or field. The properties of this algebraic structure are fundamental.
• The Boundary Maps (d): The structure of the chain complexes themselves is paramount. The d maps define what constitutes a “cycle” and a “boundary”, which are the core components of homology.
• The Choice of Chain Maps (f, g): The existence of a homotopy depends entirely on the two maps being compared. Some pairs of maps are homotopic, others are not.
• The Existence of `h`: The most crucial factor is whether a suitable map `h` (the homotopy) even exists. Its existence is what makes two maps equivalent in this context. It’s not guaranteed to exist for any arbitrary f and g.
• Dimensionality: The dimensions of the vector spaces (Cₙ, Dₙ) constrain the sizes of the matrices and the complexity of the calculations.
• Commutativity: The chain map definition itself requires diagrams to commute (fd = df). While the homotopy diagram itself does not commute, the chain map property is a prerequisite.

Frequently Asked Questions (FAQ)

1. What is a chain complex?

A chain complex is a sequence of abelian groups or modules connected by homomorphisms (called boundary operators) such that the composition of any two adjacent maps is the zero map.

2. What is the main takeaway from f and g being chain homotopic?

If two maps are chain homotopic, they induce the same map on homology groups (f* = g*). This means they are equivalent from the perspective of homology.

3. Does this calculator compute the homology groups Hₙ(C)?

No. This tool is designed to verify the chain homotopy relationship between two maps, not to compute the homology groups themselves. Calculating homology groups like H_n = ker(d_n) / im(d_{n+1}) is a different, more involved process.

4. What does it mean if the verification fails?

It means the specific map `h` you provided is not a valid chain homotopy between `f` and `g`. It does not necessarily mean that `f` and `g` are not chain homotopic, only that the witness `h` you supplied is incorrect. Another `h` might exist.

5. Are the inputs unitless?

Yes. The inputs are dimensions of abstract vector spaces and the entries of matrices representing linear maps. They are purely numerical and do not have physical units.

6. What does the condition d²=0 mean?

The condition that the boundary of a boundary is zero (d∘d=0) is fundamental. It ensures that every boundary is a cycle, allowing the definition of homology as cycles modulo boundaries.

7. Where does the formula `f-g = dh+hd` come from?

It is the algebraic formalization of the topological idea of a homotopy. Just as a homotopy `H: X × [0,1] → Y` deforms one map `f` into another map `g`, a chain homotopy algebraically “deforms” the chain map `f` into `g`.

8. Can any two chain maps be connected by a homotopy?

No. Only maps that are equivalent in their action on homology can be chain homotopic. For example, the zero map and the identity map on a complex with non-trivial homology cannot be chain homotopic.