Recall from 2026-05-12:

Let be the basis matrices where encountered during simplex method for a given right-hand side vector . Then we found that each is integral if there are integral vectors such that

or for short.

Consider then the SNF of :

Let . Then it follows that

Since is unimodular, this boils down the system

But , so if and only if

i.e.,

Therefore,

Thus, our condition becomes that there exists some where the first -entries are , i.e.,

where is the projection function onto the first -entries.


Let’s instead look at the relation between and the feasible bases.

Let be a triangle and , the chain going partially around the boundary of . There are two cases for constraints:

Case 1: : Then the corresponding constraint in is given by

Thus, the basis must contain or . If it selects , then we get an issue in another constraint:

Case 2: : Then the corresponding constraint in is given by

If the basis chooses , then we get

which forces the selection of or . But, the simplex method won’t select both and at the same time. So it must choose . So the basic variables are .

Similarly, if the basis chooses , then we are forced to take .


Notice that our basis matrix of the form

Upon performing EROs, we get that

where

  • is an identity matrix corresponding to the identity columns
  • comes from the boundary matrix consisting of rows covered by
  • is the remaining boundary matrix entries in which

But further EROs lets us cancel which leaves us with

Note that is simply a submatrix of . Since the entries of are of the form , it follows that

Thus,

For now we assume (with support of numerical tests) that every square submatrix of has for some prime and . Then it would follow that

where is a power of .

Unfortunately, the also satisfies this result, which implies that the SNF condition is not sufficient for the congruence condition. My assumption is that it has to do with having torsion or not.

The homology class has torsion of order if and

i.e., .

Let’s assume that there is a feasible basis such that , i.e., . Numerical tests suggest that for some . In other words, has torsion of order .

Conjecture: If there is a feasible basis such that , then there is a chain such that , i.e., has torsion of order .