The counting matrix of a simplicial complex

Oliver Knill

arxiv: 1907.09092 · v1 · pith:DQV5SBRUnew · submitted 2019-07-22 · 🧮 math.CO

The counting matrix of a simplicial complex

Oliver Knill This is my paper

Pith reviewed 2026-05-24 18:28 UTC · model grok-4.3

classification 🧮 math.CO

keywords counting matrixsimplicial complexunimodular matrixGreen functionpositive definitespectral symmetryzeta functionenergy theorem

0 comments

The pith

The counting matrix of any finite abstract simplicial complex is always in SL(n,Z) with an explicit inverse given by signed star intersections.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines the counting matrix K for a finite abstract simplicial complex G, where each entry K(x,y) counts the subsimplices contained in the intersection of two sets x and y. It establishes that this matrix always has determinant one and integer inverse. The inverse entries are given by a formula involving the signed sizes of intersections of the stars of x and y. The matrix is positive definite, and K and its inverse share exactly the same eigenvalues. This produces a functional equation for the associated zeta function and an energy identity in which the sum of all inverse entries equals the number of sets in G.

Core claim

For a finite abstract simplicial complex G with n sets, the counting matrix K defined by K(x,y) equal to the number of subsimplices in x intersect y is always an element of SL(n,Z). Its inverse is given explicitly by K inverse of (x,y) equals w(x) w(y) times the cardinality of the intersection of the stars W plus of x and W plus of y, where w(x) equals negative one to the dimension of x. The spectra of K and K inverse therefore coincide, the matrix Q equals K minus K inverse has spectrum equal to its negative, the zeta function summing lambda to the minus s over eigenvalues lambda of K satisfies z(a plus i b) equals z(negative a plus i b), and the sum of all entries of the inverse equals n.

What carries the argument

The counting matrix K(x,y) that records the number of common subsimplices in the intersection of x and y.

If this is right

The counting matrix K is always positive definite.
The eigenvalues of K equal the eigenvalues of K inverse.
The difference matrix Q equals K minus K inverse satisfies spec(Q) equals negative spec(Q).
The zeta function built from the eigenvalues of K obeys the functional equation z(a plus i b) equals z(negative a plus i b).
The sum of all entries of the inverse matrix equals the number n of sets in G.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The construction supplies a direct combinatorial route to the inverse without solving a linear system.
The same counting procedure that produces the connection matrix L can be refined to produce K while preserving unimodularity.
The agreement between the spectra of K and its inverse is a stronger symmetry than the one obtained for the connection matrix.

Load-bearing premise

The unimodularity and explicit inverse rest on the standard combinatorial definition of the star of a set together with the sign convention w(x) equals negative one to the dimension of x, and on G being a finite abstract simplicial complex.

What would settle it

A single finite abstract simplicial complex for which the determinant of its counting matrix is not equal to 1, or for which the proposed inverse formula fails to multiply back to the identity matrix.

Figures

Figures reproduced from arXiv: 1907.09092 by Oliver Knill.

**Figure 1.** Figure 1: Contour lines of the zeta function ζ(s) of a random complex. In this case, the f-vector is f = (10, 22, 13, 2). The level curves of |ζ(s)| are seen in the region {|Re(s)| ≤ 4, 0 ≤ Im(s) ≤ 30}. The functional equation implies that the roots are symmetric with respect to the imaginary axes [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗

**Figure 2.** Figure 2: Contour lines of the zeta function ζ(s) of the complete complex K5. Again, |ζ(s)| are seen in the region {|Re(s)| ≤ 4, 0 ≤ Im(s) ≤ 30}. There are no results yet about the structure of the roots even not in the special case of complete graphs. We know only the functional equation so far [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗

**Figure 3.** Figure 3: Contour lines of the zeta function ζ(s) of the cyclic complex C40. The contours of |ζ(s)| are seen in the region {|Re(s)| ≤ 4, 0 ≤ Im(s) ≤ 30}. In the pro-finite limit n → ∞, the zeta function of a one dimensional complex is explicit [8]. In two and higher dimensions we don’t know the profinite limit. Also the universal density of state limit of K is unexplored [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗

**Figure 4.** Figure 4: Contour lines of the zeta function ζ(s) of the 3-sphere complex obtained by suspending the octahedron. In this case, the f-vector is f = (8, 24, 32, 16). The function |ζ(s)| is again seen in the region {|Re(s)| ≤ 4, 0 ≤ Im(s) ≤ 30} [PITH_FULL_IMAGE:figures/full_fig_p012_4.png] view at source ↗

**Figure 5.** Figure 5: The matrices K, K−1 and as comparison, the matrices L, L−1 are seen below. The complex G is generated by A = {{1, 2, 3, 4, 5}, {5, 6, 7, 8, 9}, {1, 2, 8, 9}} and contains 70 sets. The fvector is (9, 24, 24, 11, 2). The 70 × 70 counting matrix K has determinant 1, the connection matrix L has determinant −1. There are 35 odd dimensional sets. The matrix has 35 positive eigenvalues, the matrix K has 70 pos… view at source ↗

read the original abstract

For a finite abstract simplicial complex G with n sets, define the n x n matrix K(x,y) which is the number of subsimplices in the intersection of x and y. We call it the counting matrix of G. Similarly as the connection matrix L which is L(x,y)=1 if x and y intersect and 0 else, the counting matrix K is unimodular. Actually, K is always in SL(n,Z). The inverse of K has the Green function entries K^(-1)(x,y)=w(x) w(y) |W^+(x) intersected W^+y|, where W^+(x) is the star of x, the sets in G which contain x and w(x)=(-1)^dim(x). The matrix K is always positive definite. The spectra of K and K^(-1) always agree so that the matrix Q=K-K^(-1) has the spectral symmetry spec(Q)=-spec(Q) and the zeta function z(s) summing l(k)^(-s) with eigenvalues l(k) of K satisfies the functional equation z(a+ib)=z(-a+ib). The energy theorem in this case tells that the sum of the matrix elements of K^(-1)(x,y) is equal to the number sets in G. In comparison, we had in the connection matrix case the identity that the sum of the matrix elements of L^(-1) is the Euler characteristic of G.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Knill's counting matrix K is unimodular with an explicit inverse formula and shares its spectrum with the inverse.

read the letter

The main points are that this paper defines the counting matrix K whose entries count common subsimplices in intersections of sets in a finite abstract simplicial complex, shows K always has determinant 1, gives an explicit inverse using signed star intersections, and proves K and K inverse have the same eigenvalues. The energy sum on the inverse entries equals the number of sets, and the spectral zeta satisfies a functional equation from the symmetry. This is new relative to the earlier connection matrix L. The inverse formula and the spectral agreement are not just rephrasings of prior results. The paper does well by making the construction direct and tying it to the zeta matrix of the face poset, where K factors as Z Z transpose with Z upper triangular and determinant 1, which immediately gives the unimodularity. The stress-test factorization checks out against the abstract claims. Soft spots are limited. The work stays inside finite abstract simplicial complexes and does not address larger topological questions or produce applications beyond this setting. Positive definiteness and the energy theorem are asserted but rest on the same poset setup, so they are not independent surprises. The abstract presents results without steps, but the underlying combinatorics looks standard once the star and sign conventions are fixed. This is for people working in combinatorial topology or poset matrix methods who want explicit formulas rather than broad theorems. A reader interested in algebraic constructions on simplicial complexes will find concrete things to check or extend. It deserves a serious referee because the claims are specific, the evidence from the factorization is reproducible, and the spectral symmetry is a clean observation even if the overall scope is narrow. I would send it to peer review.

Referee Report

0 major / 2 minor

Summary. The manuscript defines the counting matrix K of a finite abstract simplicial complex G with n faces by K(x,y) equal to the number of subsimplices contained in the intersection x ∩ y. It asserts that K always lies in SL(n,ℤ), supplies the explicit inverse formula K^{-1}(x,y)=w(x)w(y)|W^+(x)∩W^+(y)| where w(x)=(-1)^{dim x} and W^+(x) denotes the star of x, states that K is positive definite, proves that the spectra of K and K^{-1} coincide (hence spec(Q)=-spec(Q) for Q=K-K^{-1} and the associated zeta function satisfies a functional equation), and records an energy identity asserting that the sum of all entries of K^{-1} equals n. These properties are contrasted with the earlier connection matrix L, for which the corresponding sum equals the Euler characteristic of G.

Significance. The results furnish an explicit family of unimodular integer matrices canonically attached to any finite abstract simplicial complex, together with closed-form inverses and spectral symmetries. The underlying factorization K=ZZ^T, where Z is the zeta matrix of the face poset (upper-triangular with 1s on the diagonal after any linear extension), immediately yields det(K)=1 and recovers the stated inverse via the Möbius function; this combinatorial origin is a strength that places the claims on firm ground.

minor comments (2)

The abstract refers to 'the energy theorem in this case' without indicating whether this is a general result from an earlier paper or a new derivation specific to K; a brief sentence locating the theorem would improve readability.
Notation for the intersection |W^+(x) intersected W^+y| should be standardized to |W^+(x) ∩ W^+(y)| throughout the text and abstract.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading and positive evaluation of the manuscript. We are pleased that the referee finds the results on the counting matrix K, its unimodularity, explicit inverse, positive definiteness, spectral symmetries, and energy identity to be of interest, and we appreciate the recommendation to accept.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper derives the unimodularity of K (det(K)=1) and the explicit inverse formula directly from the combinatorial definition of K(x,y) as the count of common subsimplices together with the standard zeta matrix factorization K = Z Z^T of the face poset (Z upper-triangular with 1s on the diagonal after any linear extension). This factorization is external to the paper and does not depend on prior results by the same author. The inverse entries are shown to match the Möbius inversion formula expressed via stars and the sign w(x)=(-1)^dim(x), again using only the poset structure. Spectral agreement and the energy theorem follow as algebraic consequences of det(K)=1 and the inverse formula. The reference to the earlier connection matrix is an explicit analogy, not a load-bearing premise. No fitted parameters, self-definitional loops, or uniqueness theorems imported from self-citations appear in the central claims.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on the combinatorial definition of an abstract simplicial complex, the standard notions of star and dimension sign, and the intersection-counting construction of K; no free parameters or invented entities are introduced.

axioms (2)

domain assumption G is a finite abstract simplicial complex (closed under taking subsets).
Invoked in the opening sentence to define the matrix K on the n sets of G.
standard math The star W^+(x) consists of all sets in G containing x, and w(x) = (-1)^dim(x).
Used directly in the stated formula for the inverse entries.

pith-pipeline@v0.9.0 · 5784 in / 1434 out tokens · 22991 ms · 2026-05-24T18:28:41.911606+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1 (Unimodularity). K∈SL(n,Z). Proof. (Sketch) ... induction on cell attachment ... det(K(t)) ...
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 2 (Green-Star). K⁻¹(x,y)=ω(x)ω(y)|W⁺(x)∩W⁺(y)|

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages · 8 internal anchors

[1]

Burde and H

G. Burde and H. Zieschang. Development of the concept of a complex. In History of Topology. Elsevier, 1999

work page 1999
[2]

Dehn and P

M. Dehn and P. Heegaard. Analysis situs. Enzyklopaedie d. Math. Wiss , III.1.1:153–220, 1907

work page 1907
[3]

Ferrario and R.A

D.L. Ferrario and R.A. Piccinini. Simplicial Structures in Topology . Springer, 2011

work page 2011
[4]

J. Jonsson. Simplicial Complexes of Graphs , volume 1928 of Lecture Notes in Mathematics . Springer, 2008

work page 1928
[5]

O. Knill. Universality for Barycentric subdivision. http://arxiv.org/abs/1509.06092, 2015

work page internal anchor Pith review Pith/arXiv arXiv 2015
[6]

O. Knill. One can hear the Euler characteristic of a simplicial complex. https://arxiv.org/abs/1711.09527, 2017

work page internal anchor Pith review Pith/arXiv arXiv 2017
[7]

O. Knill. The amazing world of simplicial complexes. https://arxiv.org/abs/1804.08211, 2018

work page internal anchor Pith review Pith/arXiv arXiv 2018
[8]

O. Knill. An elementary Dyadic Riemann hypothesis. https://arxiv.org/abs/1801.04639, 2018

work page internal anchor Pith review Pith/arXiv arXiv 2018
[9]

O. Knill. Dehn-Sommerville from Gauss-Bonnet. https://arxiv.org/abs/1905.04831, 2019

work page internal anchor Pith review Pith/arXiv arXiv 1905
[10]

O. Knill. The energy of a simplicial complex. https://arxiv.org/abs/1907.03369, 2019

work page internal anchor Pith review Pith/arXiv arXiv 1907
[11]

O. Knill. A parametrized Poincare-Hopf theorem and clique cardinalities of graphs. https://arxiv.org/abs/1906.06611, 2019

work page internal anchor Pith review Pith/arXiv arXiv 1906
[12]

O. Knill. The zeta function for circular graphs. http://arxiv.org/abs/1312.4239, December 2013

work page internal anchor Pith review Pith/arXiv arXiv 2013
[13]

Mukherjee and S

S.K. Mukherjee and S. Bera. A simple elementary proof of The Unimodularity Theorem of Oliver Knill. Linear Algebra and Its applications , pages 124–127, 2018

work page 2018
[14]

J.R. Munkres. Elements of Algebraic Topology . Addison-Wesley, 1984. Department of Mathematics, Harvard University, Cambridge, MA, 02138

work page 1984

[1] [1]

Burde and H

G. Burde and H. Zieschang. Development of the concept of a complex. In History of Topology. Elsevier, 1999

work page 1999

[2] [2]

Dehn and P

M. Dehn and P. Heegaard. Analysis situs. Enzyklopaedie d. Math. Wiss , III.1.1:153–220, 1907

work page 1907

[3] [3]

Ferrario and R.A

D.L. Ferrario and R.A. Piccinini. Simplicial Structures in Topology . Springer, 2011

work page 2011

[4] [4]

J. Jonsson. Simplicial Complexes of Graphs , volume 1928 of Lecture Notes in Mathematics . Springer, 2008

work page 1928

[5] [5]

O. Knill. Universality for Barycentric subdivision. http://arxiv.org/abs/1509.06092, 2015

work page internal anchor Pith review Pith/arXiv arXiv 2015

[6] [6]

O. Knill. One can hear the Euler characteristic of a simplicial complex. https://arxiv.org/abs/1711.09527, 2017

work page internal anchor Pith review Pith/arXiv arXiv 2017

[7] [7]

O. Knill. The amazing world of simplicial complexes. https://arxiv.org/abs/1804.08211, 2018

work page internal anchor Pith review Pith/arXiv arXiv 2018

[8] [8]

O. Knill. An elementary Dyadic Riemann hypothesis. https://arxiv.org/abs/1801.04639, 2018

work page internal anchor Pith review Pith/arXiv arXiv 2018

[9] [9]

O. Knill. Dehn-Sommerville from Gauss-Bonnet. https://arxiv.org/abs/1905.04831, 2019

work page internal anchor Pith review Pith/arXiv arXiv 1905

[10] [10]

O. Knill. The energy of a simplicial complex. https://arxiv.org/abs/1907.03369, 2019

work page internal anchor Pith review Pith/arXiv arXiv 1907

[11] [11]

O. Knill. A parametrized Poincare-Hopf theorem and clique cardinalities of graphs. https://arxiv.org/abs/1906.06611, 2019

work page internal anchor Pith review Pith/arXiv arXiv 1906

[12] [12]

O. Knill. The zeta function for circular graphs. http://arxiv.org/abs/1312.4239, December 2013

work page internal anchor Pith review Pith/arXiv arXiv 2013

[13] [13]

Mukherjee and S

S.K. Mukherjee and S. Bera. A simple elementary proof of The Unimodularity Theorem of Oliver Knill. Linear Algebra and Its applications , pages 124–127, 2018

work page 2018

[14] [14]

J.R. Munkres. Elements of Algebraic Topology . Addison-Wesley, 1984. Department of Mathematics, Harvard University, Cambridge, MA, 02138

work page 1984