This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Quadratic heptagon cohomology

Igor G. Korepanov
(October 2021)
Abstract

A cohomology theory is proposed for the recently discovered heptagon relation—an algebraic imitation of a 5-dimensional Pachner move 4–3. In particular, ‘quadratic cohomology’ is introduced, and it is shown that it is quite nontrivial, and even more so if compare heptagon with either its higher analogues, such as enneagon or hendecagon, or its lower analogue, pentagon. Explicit expressions for the nontrivial quadratic heptagon cocycles are found in dimensions 4 and 5.

To the memory of Aristophanes Dimakis

1 Introduction

1.1 Heptagon and cohomology

This paper is the continuation of paper [7] where the first nontrivial heptagon relation was found. We recall here that by heptagon relation, we mean an algebraic imitation of a Pachner move 4–3 in a triangulation of a five-dimensional piecewise linear (PL) manifold, see [10, 9] for Pachner moves and [7, 2, 3, 6, 8] for heptagon and other polygon relations. Discovering heptagon relations may be viewed as a preparational algebraic work for constructing invariants of these manifolds and related topological field theories.

It is known, however, that often more refined invariants can be obtained if we use not only a relation like heptagon but also its cohomology. Enough to mention, as an example, invariants of knots and knotted surfaces coming from just quandles and from quandle cohomology, reviewed in [1].

It can be expected that, for five-dimensional PL manifolds, heptagon 5-cocycles will play the principal role. As explained in [7], we color the 4-faces of a triangulation with elements of a field FF, and declare some of the colorings for (the faces of) each 5-simplex permitted. Roughly speaking, heptagon itself is expected to give, as a manifold MM invariant, the dimension of the vector space of its triangulation’s permitted colorings, corrected by some simple multiplier. Different values c[M]c[M] of a heptagon 5-cocycle cc on MM can add more information to that invariant.

Field FF must be big enough to allow for some sets of its elements to be in a ‘general position’, see, for instance, an assumption made below right after formula (3). When speaking of quadratic cohomology, we also assume that its characteristic is not 2. Moreover, for some of our calculations, FF must be of characteristic 0, which is explicitly indicated in the relevant places in the text.

The heptagon relation and its cohomology studied here are nonconstant. This means that the specific objects belonging to a simplex (such as e.g. the matrix determining its permitted colorings or the coefficients in the expression for a cocycle) depend on parameters that are different for different simplices. The difference between ‘constant’ and ‘nonconstant’ cohomology theories can be seen on the hexagon example by comparing papers [6] and [8].

1.2 The main result

The main result of this paper is the existence of a non-trivial 5-cocycle for the heptagon relation introduced in [7], together with explicit algebraic formulas for it. This looks actually quite striking if compared with the apparent non-existence of a similar cocycle for other odd polygon relations of the same kind. Namely, we analyze here also pentagon, enneagon (9-gon) and hendecagon (11-gon).

Recall that the existence of higher (than pentagon and heptagon) odd polygon relations was announced in [7, Subsection 6.3], together with a brief but explicit explanation of the key step for their construction. We still leave their general analysis for future works, but as we want to compare heptagon with pentagon, enneagon and hendecagon, we simply write out necessary formulas for these, and content ourself with the fact that, in these cases, the formulas (including polygon relations as such) can be checked directly using computer algebra.

Anyhow, we could not do without computer algebra altogether, even for the heptagon, both when searching for our 5-cocycle and when checking its validity. This probably means that there are hidden algebraic structures, yet to be discovered.

1.3 Notation changes with respect to paper [7]

Aristophanes Dimakis taught me a more elegant, than in [7], way of vertex and simplex numbering in polygon relations, used in [2, 3]. Accordingly, our Pachner move now replaces the cluster of 5-simplices with numbers 1, 3, 5 and 7 with the cluster of 5-simplices 2, 4 and 6. The heptagon looks now as in Figure 1

Refer to caption
Figure 1: Heptagon relation

rather than [7, Figure 1], and reads

A123(1)A145(3)A246(5)A356(7)=A356(6)A245(4)A123(2),A_{123}^{(1)}A_{145}^{(3)}A_{246}^{(5)}A_{356}^{(7)}=A_{356}^{(6)}A_{245}^{(4)}A_{123}^{(2)}\,, (1)

instead of [7, Eq. (1)]. Note that the subscripts in (1) did not change.

Also, we change the meaning of letter nn, to bring it in conformity with [3]: our odd polygons are now (2n+1)(2n+1)-gons, so n=2n=2 for pentagon, n=3n=3 for heptagon, and so on.

1.4 Contents of the rest of the paper

Below,

  • \bullet

    in Section 2, we recall our heptagon relation introduced in [7],

  • \bullet

    in Section 3, we introduce both a general cohomology theory for heptagon and its specific ‘quadratic’ version,

  • \bullet

    in Section 4, we present a quadratic cocycle in dimension 4, and show its uniqueness,

  • \bullet

    in Section 5, we present a quadratic cocycle in dimension 5 together with some related reasonings and observations,

  • \bullet

    in Section 6, we find out that, while analogues of the heptagon 4-cocycle exist for pentagon, enneagon and hendecagon, such analogues of the heptagon 5-cocycle do not exist,

  • \bullet

    finally, in Section 7, we discuss possible directions of further research.

2 Heptagon relation

Here we recall some conventions and facts from [7].

2.1 Notations

Recall that (1) and Figure 1 mean the equalness of two products of matrices acting in the direct sum of six copies of field FF. We represent this direct sum as the 6-row space, so our matrices act on rows from the right. Each matrix Aabc(p)A_{abc}^{(p)} acts nontrivially only in the copies (or: on the row elements) number aa, bb and cc. Circles with numbers in Figure 1 depict the seven 5-simplices taking part in move 4–3, while edges correspond to 4-faces: edge ijij depicts the 4-face common for simplices ii and jj, including the case where these belong to the different sides of Figure 1 (recall that the lhs and rhs of a Pachner move have the same boundary). The order of ii and jj is here, by definition, irrelevant: edge/face ijij is the same as jiji.

It proved also convenient for us to denote the vertices of simplices taking part in the Pachner move by the same letters (or numbers) as 5-simplices, using the following principle: 5-simplex ii has all vertices 1,,71,\ldots,7 except ii. That is, 5-simplex 11 can also be denoted as 234567234567; accordingly, 4-face 1212 is the same as 3456734567.

Note that below, in Subsection 2.3, we speak of edges of these simplices, not to be confused with edges of Figure 1.

2.2 Explicit expression for matrix entries

Explicitly, entries of matrices Aabc(p)A_{abc}^{(p)} are described as follows. First, we introduce a matrix

=(α1α2α3α4α5α6α7β1β2β3β4β5β6β7γ1γ2γ3γ4γ5γ6γ7)\mathcal{M}=\begin{pmatrix}\alpha_{1}&\alpha_{2}&\alpha_{3}&\alpha_{4}&\alpha_{5}&\alpha_{6}&\alpha_{7}\\ \beta_{1}&\beta_{2}&\beta_{3}&\beta_{4}&\beta_{5}&\beta_{6}&\beta_{7}\\ \gamma_{1}&\gamma_{2}&\gamma_{3}&\gamma_{4}&\gamma_{5}&\gamma_{6}&\gamma_{7}\end{pmatrix} (2)

with entries in FF, and determinants

dijk=|αiαjαkβiβjβkγiγjγk|d_{ijk}=\left|\begin{matrix}\alpha_{i}&\alpha_{j}&\alpha_{k}\\ \beta_{i}&\beta_{j}&\beta_{k}\\ \gamma_{i}&\gamma_{j}&\gamma_{k}\end{matrix}\right| (3)

made of triples of its columns. We assume that the entries of \mathcal{M} are generic enough in the exact sense that dijkd_{ijk} does not vanish for any pairwise different i,j,ki,j,k.

Each separate matrix A(p)A^{(p)} looks as in Figure 2.

Refer to caption
Figure 2: Matrix A(p)A^{(p)} for heptagon

By definition, the entry of A(p)A^{(p)} corresponding to the input (lower) leg ip=piip=pi and output (upper) leg lp=pllp=pl is

(A(p))iplp=djlpdklpdijpdikp,\left(A^{(p)}\right)_{ip}^{lp}=\frac{d_{jlp}d_{klp}}{d_{ijp}d_{ikp}}, (4)

where jpjp and kpkp are the other input legs of A(p)A^{(p)}.

It was proved in [7] that matrices (4) satisfy (1).

2.3 Edge vectors

The main technical tool used in [7] to construct our heptagon relation was edge vectors—permitted colorings of the Pachner move such that nonzero colors are ascribed only to 4-faces containing a given edge b=ijb=ij. Recall that the explicit expression for the component eb|ue_{b}|_{u} of edge vector ebe_{b} corresponding to 4-face uu is

eij|u=dilmdjlm,e_{ij}|_{u}=d_{ilm}d_{jlm}, (5)

where ll and mm are the two vertices not belonging to uu (while ii and jj, of course, do belong).

Any four vectors eij,eik,eil,eime_{ij},e_{ik},e_{il},e_{im} corresponding to edges with a common vertex ii are linearly dependent:

λi,ij(ijklm)eij+λi,ik(ijklm)eik+λi,il(ijklm)eil+λi,im(ijklm)eim=0,\lambda_{i,ij}^{(ijklm)}e_{ij}+\lambda_{i,ik}^{(ijklm)}e_{ik}+\lambda_{i,il}^{(ijklm)}e_{il}+\lambda_{i,im}^{(ijklm)}e_{im}=0, (6)

where λi,ij(ijklm)\lambda_{i,ij}^{(ijklm)} are some numbers whose explicit expression is given in [7, Eq. (13)].

3 Cohomology theory

3.1 Nonconstant heptagon cohomology: generalities

In this subsection, we define “nonconstant heptagon cohomology” in a general context.

Our definition will depend on a chosen simplicial complex KK. In principle, KK can be of any dimension, although the main work in this paper will take place in the standard 6-simplex K=Δ6K=\Delta^{6}, whose boundary is the union of the lhs and rhs of any five-dimensional Pachner move.

Suppose that every 4-simplex uKu\subset K is colored by some element 𝗑uX\mathsf{x}_{u}\in X of a set XX of colors (for instance, our field X=FX=F), and that a subset RvR_{v} of permitted colorings is defined in the set of all colorings of every 5-simplex vv (for instance, by declaring that the “output” colors must be determined by the “input” ones, using matrix (4)).

We also define the set of permitted colorings for any simplex of KK of dimension >5>5: the coloring is permitted provided its restrictions on all 5-faces of that simplex are permitted. As for an individual 4-simplex, all its colorings 𝗑X\mathsf{x}\in X are permitted by definition.

The set of all permitted colorings of an mm-simplex i0imi_{0}\dots i_{m} will be denoted i0im\mathfrak{C}_{i_{0}\dots i_{m}}. We assume here that the vertices of any simplex are ordered: i0<<imi_{0}<\ldots<i_{m}.

Let an abelian group GG be given. By definition, an mm-cochain 𝔠\mathfrak{c} taking values in GG, for m3m\geq 3, consists of arbitrary mappings

𝔠i0im:i0imG\mathfrak{c}_{i_{0}\dots i_{m}}\colon\;\,\mathfrak{C}_{i_{0}\dots i_{m}}\to G (7)

for all mm-simplices Δm=i0imK\Delta^{m}=i_{0}\dots i_{m}\subset K.

The coboundary δ𝔠\delta\mathfrak{c} of 𝔠\mathfrak{c} consists then of mappings (δ𝔠)i0im+1(\delta\mathfrak{c})_{i_{0}\dots i_{m+1}} acting on a permitted coloring ri0im+1r\in\mathfrak{C}_{i_{0}\dots i_{m+1}} of (m+1)(m+1)-simplex i0im+1i_{0}\dots i_{m+1} according to the following formula:

(δ𝔠)i0im+1(r)=k=0m+1(1)k𝔠i0ik^im+1(r|i0ik^im+1),(\delta\mathfrak{c})_{i_{0}\dots i_{m+1}}(r)=\sum_{k=0}^{m+1}(-1)^{k}\,\mathfrak{c}_{i_{0}\dots\widehat{i_{k}}\dots i_{m+1}}(r|_{i_{0}\dots\widehat{i_{k}}\dots i_{m+1}}), (8)

where each r|i0ik^im+1r|_{i_{0}\dots\widehat{i_{k}}\dots i_{m+1}}—the restriction of rr onto the mm-simplex i0ik^im+1i_{0}\dots\widehat{i_{k}}\dots i_{m+1}—is of course a permitted coloring of this latter simplex.

Our ‘nonconstant heptagon cohomology’ is the cohomology of the following heptagon cochain complex:

0C4δC5δC6δ,0\to C^{4}\stackrel{{\scriptstyle\delta}}{{\to}}C^{5}\stackrel{{\scriptstyle\delta}}{{\to}}C^{6}\stackrel{{\scriptstyle\delta}}{{\to}}\dots\,, (9)

where CmC^{m} means the group of all mm-cochains.

3.2 Quadratic cohomology

It turns out that there are some interesting variations of the cochain definition (7). For instance, preprint [6] (although devoted to constant hexagon cohomology) suggests that homogeneous polynomials of a given degree may be used instead of general functions (7)—of course, in a situation where the notion of polynomial in the variables determining a permitted coloring makes sense.

Of special interest for us in this paper will be quadratic cochains. That is, let G=FG=F be the same field FF that we are using for the set of colors, and mappings 𝔠i0im\mathfrak{c}_{i_{0}\dots i_{m}} in (7) be quadratic forms on the linear spaces of permitted colorings of corresponding mm-simplices i0imi_{0}\ldots i_{m}.

Remember (Subsection 1.1) that our field FF is of characteristic 2\neq 2. Hence, there is a polarization for any quadratic cochain. By definition, this is the symmetric bilinear cochain depending on two (independent from each other) permitted colorings:

𝔠i0impol:i0im×i0imF,\mathfrak{c}_{i_{0}\dots i_{m}}^{\mathrm{pol}}\colon\quad\mathfrak{C}_{i_{0}\dots i_{m}}\times\mathfrak{C}_{i_{0}\dots i_{m}}\to F, (10)

where each 𝔠i0impol\mathfrak{c}_{i_{0}\dots i_{m}}^{\mathrm{pol}} is the polarization of the corresponding 𝔠i0im\mathfrak{c}_{i_{0}\dots i_{m}} in (7).

Mapping (10) can be treated as a scalar product of two permitted colorings of simplex i0imi_{0}\dots i_{m}. So, to define a quadratic cochain is essentially the same as to define a scalar product for all corresponding simplices. In what follows, we will make extensive use of this fact.

4 Quadratic 4-cocycle

Here and in the next Section 5, we are working within the simplicial complex K=Δ6=1234567K=\Delta^{6}=1234567, and even within its boundary δΔ6\delta\Delta^{6} which consists of seven 5-simplices and is the union of the two parts of a five-dimensional Pachner move.

Let xipx_{ip} denote the color of face ipip. Recall that ipip means, in this context, the 4-face containing all vertices 1,,71,\ldots,7 except ii and pp.

Proposition 1.

The cochain consisting of mappings

xipcipxip2,x_{ip}\mapsto c_{ip\,}x_{ip}^{2}, (11)

where

cip=ι1i,pι2i,pι1<ι2dι1ι2p,c_{ip}=\prod_{\begin{subarray}{c}\iota_{1}\neq i,p\\ \iota_{2}\neq i,p\\ \iota_{1}<\iota_{2}\end{subarray}}d_{\iota_{1}\iota_{2}p}, (12)

is a quadratic 4-cocycle.

Geometrically, the product in (12) goes over the ten edges ι1ι2\iota_{1}\iota_{2} of 4-face ipip.

We introduce the following scalar product of two arbitrary colorings xx and yy of a 5-simplex pp:

ipϵi(p)cipxipyip=x,y4(p),\sum_{i\neq p}\epsilon_{i}^{(p)}c_{ip}\,x_{ip}y_{ip}=\langle x,y\rangle_{4}^{(p)}, (13)

where ϵi(p)=±1\epsilon_{i}^{(p)}=\pm 1 is the alternating sign on the set {1,,7}{p}\{1,\ldots,7\}\setminus\{p\} taken in the increasing order: the first element has sign ++, the second—sign -, …, the iith—sign ϵi(p)\epsilon_{i}^{(p)}. For permitted xx and yy this is, of course, just the coboundary of (11) for 5-simplex pp, hence, what we must prove is that (13) vanishes for permitted xx and yy.

Pay attention to the subscript 44 in the rhs of (13): it serves to distinguish this product from another one introduced below in (15).

Proof of Proposition 1.

Take, first, edge vectors for two non-intersecting edges as xx and yy. For instance, consider 5-simplex 123456123456 (that is, p=7p=7), and let x=e12x=e_{12} and y=e34y=e_{34}. Then, there are just two nonvanishing summands (i=5i=5 and 66) in the lhs of (13), and they are easily seen to cancel each other.

Then we note that only restrictions of colorings onto 5-simplex pp take part in (13), and if we put m=pm=p in (6), and restrict the lhs of (6) onto pp, then there remain only three terms in the obtained linear dependence—because vertex pp and hence edge ipip do not belong to the 5-simplex pp, see the second paragraph of Subsection 2.1.

Now it is not hard to see that we can use such three-term linear dependences to show that (13) vanishes for any edge vectors xx and yy. ∎

Proposition 2.

There are no 4-cocycles linearly independent from cocycle given by (11) and (12).

Proof.

We note first what follows, for instance, from the fact that e12,e344(7)\langle e_{12},e_{34}\rangle_{4}^{(7)} must vanish. Recall that ‘77’ means here the 5-simplex 123456123456, and it has only two 4-faces containing edges 1212 and 3434 at once—1234512345 and 1234612346, or, in other notations (see Subsection 2.1), 6767 and 5757. Hence, the vanishing of e12,e344(7)\langle e_{12},e_{34}\rangle_{4}^{(7)} determines c57/c67c_{57}/c_{67} uniquely. Similarly, all ratios between coefficients cipc_{ip} are also determined uniquely. ∎

5 Quadratic 5-cocycle

5.1 Why a nontrivial quadratic 5-cocycle must exist

We first calculate the numbers of linearly independent quadratic 4-, 5- and 6-cochains in our simplicial complex K=Δ6=1234567K=\Delta^{6}=1234567.

4-cochains

There are 21 linearly independent 4-cochains, one for each 4-dimensional face ipip, namely cochains xip2x_{ip}^{2}.

5-cochains

For each 5-simplex, the linear space of permitted colorings is 3-dimensional: three arbitrary “input” colors determine three “output” ones. The space of quadratic forms of 3 variables is 6-dimensional. And there are seven 5-simplices (that is, simplices with six vertices!) in the heptagon relation.

Hence, there is the 7×6=427\times 6=42-dimensional linear space consisting of 7-tuples of quadratic forms, one for each 5-simplex.

6-cochains

There are six independent “input” colors for the whole heptagon (see again Figure 1), so there are 6×72=21\frac{6\times 7}{2}=21 linearly independent quadratic forms.

We now write out a fragment of sequence (9) for quadratic cochains, assuming that the characteristic of our field FF is zero:

(214-cochains)rank=20𝛿(425-cochains)rank=21𝛿(216-cochains).\begin{pmatrix}21\\ \text{4-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=20]{\textstyle\delta}\begin{pmatrix}42\\ \text{5-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=21]{\textstyle\delta}\begin{pmatrix}21\\ \text{6-cochains}\end{pmatrix}. (14)

Here follows the explanations.

First, “21 cochains” stays in (14) for “21-dimensional space of cochains”, and so on.

Second, the rank of the left coboundary operator δ\delta in (14) is 2020 and not 2121 because there exists exactly one nonzero 21-tuple that gives exactly zero on each 5-simplex, according to Propositions 1 and 2.

Third, the rank of the right operator δ\delta is surely 21\leq 21, and this is already enough to conclude that the cohomology space dimension in the middle term is 422021=1\geq 42-20-21=1. Actually, a direct calculation, made in characteristic 0, shows that the rank of the right δ\delta is exactly 2121 for generic matrices \mathcal{M} (2), but is looks, at this moment, more difficult to understand why it is so. It is also unknown whether the assumption made right after formula (3) is enough to guarantee that \mathcal{M} is generic in this sense.

5.2 Explicit form of 5-cocycle

We define now one more scalar product, this time between two permitted colorings of a 5-simplex pp. For the case where these colorings are the restrictions of edge vectors eije_{ij} and ekle_{kl}, respectively, on pp, we set

eij,ekl5(p)=defdetηp(dikpdjlp+dilpdjkp),\langle e_{ij},e_{kl}\rangle_{5}^{(p)}\,\stackrel{{\scriptstyle\mathrm{def}}}{{=}}\,\det\eta_{p}\cdot(d_{ikp}d_{jlp}+d_{ilp}d_{jkp}), (15)

where

ηp=(αi2αj2αk2αl2αm2αn2βi2βj2βk2βl2βm2βn2γi2γj2γk2γl2γm2γn2αiβiαjβjαkβkαlβlαmβmαnβnαiγiαjγjαkγkαlγlαmγmαnγnβiγiβjγjβkγkβlγlβmγmβnγn),\eta_{p}=\begin{pmatrix}\alpha_{i}^{2}&\alpha_{j}^{2}&\alpha_{k}^{2}&\alpha_{l}^{2}&\alpha_{m}^{2}&\alpha_{n}^{2}\\[2.15277pt] \beta_{i}^{2}&\beta_{j}^{2}&\beta_{k}^{2}&\beta_{l}^{2}&\beta_{m}^{2}&\beta_{n}^{2}\\[2.15277pt] \gamma_{i}^{2}&\gamma_{j}^{2}&\gamma_{k}^{2}&\gamma_{l}^{2}&\gamma_{m}^{2}&\gamma_{n}^{2}\\[2.15277pt] \alpha_{i}\beta_{i}&\alpha_{j}\beta_{j}&\alpha_{k}\beta_{k}&\alpha_{l}\beta_{l}&\alpha_{m}\beta_{m}&\alpha_{n}\beta_{n}\\[2.15277pt] \alpha_{i}\gamma_{i}&\alpha_{j}\gamma_{j}&\alpha_{k}\gamma_{k}&\alpha_{l}\gamma_{l}&\alpha_{m}\gamma_{m}&\alpha_{n}\gamma_{n}\\[2.15277pt] \beta_{i}\gamma_{i}&\beta_{j}\gamma_{j}&\beta_{k}\gamma_{k}&\beta_{l}\gamma_{l}&\beta_{m}\gamma_{m}&\beta_{n}\gamma_{n}\end{pmatrix}, (16)

and i,,ni,\ldots,n are the numbers from 1 through 7 except pp, going in the increasing order.

As edge vectors make not a basis but an overfull system of vectors in the linear space of all permitted colorings, the following proposition is necessary to justify this definition.

Proposition 3.

Formula (15) defines a scalar product in the linear space of permitted colorings of 5-simplex pp correctly.

Proof.

It must be checked that the definition (15) agrees with the three-term linear dependences mentioned in the proof of Proposition 1. Consider such a linear dependence

λ1eij1|p+λ2eij2|p+λ3eij3|p=0,\lambda_{1}e_{ij_{1}}|_{p}+\lambda_{2}e_{ij_{2}}|_{p}+\lambda_{3}e_{ij_{3}}|_{p}=0, (17)

and, on the other hand, the determinants djlpd_{jlp} and djkpd_{jkp} entering in the rhs of (15). It is a simple consequence from the explicit form [7, Eq. (13)] of lambdas and a Plücker bilinear relation for determinants that a similar to (17) relation holds for any of these determinants, for instance,

λ1dj1lp+λ2dj2lp+λ3dj3lp=0.\lambda_{1}d_{j_{1}lp}+\lambda_{2}d_{j_{2}lp}+\lambda_{3}d_{j_{3}lp}=0. (18)

Hence, for the scalar product defined according to (15) we also have the desirable equality showing that definition (15) is self-consistent:

λ1eij1,ekl5(p)+λ2eij2,ekl5(p)+λ3eij3,ekl5(p)=0.\lambda_{1}\langle e_{ij_{1}},e_{kl}\rangle_{5}^{(p)}+\lambda_{2}\langle e_{ij_{2}},e_{kl}\rangle_{5}^{(p)}+\lambda_{3}\langle e_{ij_{3}},e_{kl}\rangle_{5}^{(p)}=0. (19)

Proposition 4.

Formulas (15) and (16) define, indeed, a cocycle:

p=17(1)peij,ekl5(p)=0\sum_{p=1}^{7}(-1)^{p}\langle e_{ij},e_{kl}\rangle_{5}^{(p)}=0 (20)

for any two edges ijij and klkl.

Proof.

Direct calculation. ∎

5.3 Nontriviality

Proposition 5.

Cocycle defined according to (15) and (16) is nontrivial—not a coboundary.

Proof.

Coboundary is, in this situation, a linear combination of xip2x_{ip}^{2} taken over 4-faces. The scalar product x,y5(p)\langle x,y\rangle_{5}^{(p)} corresponding to such a cocycle would then be a linear combination of products xipyipx_{ip}y_{ip}. This would imply, taking (5) into account, that e12,e345(7)\langle e_{12},e_{34}\rangle_{5}^{(7)}, e13,e245(7)\langle e_{13},e_{24}\rangle_{5}^{(7)} and e14,e235(7)\langle e_{14},e_{23}\rangle_{5}^{(7)} would all three coincide—but they are actually all different. ∎

5.4 One more observation

Matrix \mathcal{M} (2) can be reduced, by a linear transformation of its rows, to the form where its three first columns form an identity matrix. Suppose this has been already done, that is,

(α1α2α3β1β2β3γ1γ2γ3)=(100010001),\begin{pmatrix}\alpha_{1}&\alpha_{2}&\alpha_{3}\\ \beta_{1}&\beta_{2}&\beta_{3}&\\ \gamma_{1}&\gamma_{2}&\gamma_{3}\end{pmatrix}=\begin{pmatrix}1&0&0\\ 0&1&0\\ 0&0&1\end{pmatrix}, (21)

and consider the determinant of matrix η7\eta_{7} (16) for such \mathcal{M}. A calculation shows that

detη7=α4β4α5γ5β6γ6α4γ4α5β5β6γ6α4β4β5γ5α6γ6\displaystyle\det\eta_{7}=\alpha_{4}\beta_{4}\alpha_{5}\gamma_{5}\beta_{6}\gamma_{6}-\alpha_{4}\gamma_{4}\alpha_{5}\beta_{5}\beta_{6}\gamma_{6}-\alpha_{4}\beta_{4}\beta_{5}\gamma_{5}\alpha_{6}\gamma_{6} (22)
+β4γ4α5β5α6γ6+α4γ4β5γ5α6β6β4γ4α5γ5α6β6\displaystyle+\beta_{4}\gamma_{4}\alpha_{5}\beta_{5}\alpha_{6}\gamma_{6}+\alpha_{4}\gamma_{4}\beta_{5}\gamma_{5}\alpha_{6}\beta_{6}-\beta_{4}\gamma_{4}\alpha_{5}\gamma_{5}\alpha_{6}\beta_{6} (23)
=defdh(α4α5α6β4β5β6γ4γ5γ6),\displaystyle\stackrel{{\scriptstyle\mathrm{def}}}{{=}}-\operatorname{dh}\begin{pmatrix}\alpha_{4}&\alpha_{5}&\alpha_{6}\\ \beta_{4}&\beta_{5}&\beta_{6}&\\ \gamma_{4}&\gamma_{5}&\gamma_{6}\end{pmatrix}, (24)

where function ‘dh\operatorname{dh}’ on 3×33\times 3 matrices was introduced in [5, Eq. (7)] in connection with what seemed a completely different problem—evolution of a discrete-time dynamical system, where one step of evolution consisted in taking, first, the usual inverse of a matrix, and second—the “Hadamard inverse”, that is, inverting each matrix entry separately.

6 Absense of similar cocycles for pentagon, enneagon and hendecagon

6.1 (𝟐𝒏+𝟏)\boldsymbol{(2n+1)}-gon relations for other 𝒏\boldsymbol{n}

It was announced in [7, Subsection 6.3] that our heptagon relation can be generalized to any (2n+1)(2n+1)-gon, n=2,3,n=2,3,\ldots. The form of such relations has been explained in detail in [3, Section II.B] (while different (2n+1)(2n+1)-gon relations of the same form were presented in [3, Section III]).

Here we want only to comment on the results of computer calculations for pentagon, enneagon (9-gon) and hendecagon (11-gon). This allows us just to say that all mentioned polygon relations do hold, and this can be checked directly using computer algebra, if we set the entries of the corresponding matrices A(p)A^{(p)} to have the following entries:

(A(p))iplp=jijpinputsdjlpdijp.\left(A^{(p)}\right)_{ip}^{lp}=\prod_{\begin{subarray}{c}j\neq i\\ jp\;\mathrm{inputs}\end{subarray}}\frac{d_{jlp}}{d_{ijp}}\,. (25)

In greater detail: the product in (25) runs over all jj such that the lower (input) legs of A(p)A^{(p)} are marked jpjp, except j=ij=i, see again Figure 2 for the heptagon example. The determinants dijkd_{ijk} are the same as in (3), except that matrix \mathcal{M} (2) must have 2n+12n+1 columns (but still three rows).

Our definition (25) generalizes (4), of course. It works actually for all (2n+1)(2n+1)-gons, but the proof of this general fact (not relying on computer algebra) will appear elsewhere.

6.2 (𝟐𝒏𝟐)\boldsymbol{(2n-2)}-cocycles

Nontrivial (2n2)(2n-2)-cocycles are given, for a general nn, by the very same formulas (11) and (12). The conceptual and general proof of this statement—a generalization of our Proposition 1—requires, however, some preparatory work, and we leave it for a future paper specifically addressing these issues. As far as only pentagon, enneagon and hendecagon relations are concerned, it can be checked quite easily using computer algebra.

Their uniqueness—the generalization of Proposition 2—also holds, and this time not much work is required. For clarity, we show how to do it on the example of enneagon. According to [7, Subsection 6.3], edge vectors are replaced, for enneagon, with triangle vectors. Consider 7-simplex 12345678—also denoted simply ‘9’—and triangle vectors for 123 and 456. The mentioned 7-simplex contains only two 6-faces, namely 12345671234567 and 12345681234568, also called 8989 and 7979, containing both these triangles. Scalar product e123,e4566(9)\langle e_{123},e_{456}\rangle_{6}^{(9)}—the analogue of e12,e344(7)\langle e_{12},e_{34}\rangle_{4}^{(7)} from the proof of Proposition 2—must vanish, and this determines c79/c89c_{79}/c_{89} uniquely. Similarly, all ratios between coefficients cipc_{ip} are also determined uniquely.

6.3 Sequences of two coboundary operators for pentagon, enneagon and hendecagon

We now write out the analogues of sequence (14) for pentagon, enneagon and hendecagon, assuming again the zero characteristic for field FF.

Pentagon

(102-cochains)rank=9𝛿(153-cochains)rank=6𝛿(64-cochains)\begin{pmatrix}10\\ \text{2-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=9]{\textstyle\delta}\begin{pmatrix}15\\ \text{3-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=6]{\textstyle\delta}\begin{pmatrix}6\\ \text{4-cochains}\end{pmatrix} (26)

Enneagon

(366-cochains)rank=35𝛿(907-cochains)rank=55𝛿(558-cochains)\begin{pmatrix}36\\ \text{6-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=35]{\textstyle\delta}\begin{pmatrix}90\\ \text{7-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=55]{\textstyle\delta}\begin{pmatrix}55\\ \text{8-cochains}\end{pmatrix} (27)

Hendecagon

(558-cochains)rank=54𝛿(1659-cochains)rank=111𝛿(12010-cochains)\begin{pmatrix}55\\ \text{8-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=54]{\textstyle\delta}\begin{pmatrix}165\\ \text{9-cochains}\end{pmatrix}\xrightarrow[\mathrm{rank}=111]{\textstyle\delta}\begin{pmatrix}120\\ \text{10-cochains}\end{pmatrix} (28)

The ranks of the left operators δ\delta are always less than the number of (2n2)(2n-2)-faces (and (2n2)(2n-2)-cochains) by one, due to the reasons explained in the previous Subsection 6.2.

The ranks of the right operators δ\delta are again (like it was for sequence (14)) more complicated, and were calculated using computer algebra and for generic parameters (entries of matrix \mathcal{M} (2) analogues).

It follows from these ranks that there are no nontrivial cocycles in the middle terms, in a surprising contrast with the heptagon case!

7 Discussion

Finally, some comments on possible directions of further research.

Other polygons and characteristics

Rank calculations for the right arrows in (26), (27) and (28) were done only for the zero characteristic of field FF, and for a few lowest polygons. It is not known what awaits us outside these restrictions.

Homogeneous polynomial (𝟐𝒏𝟏)\boldsymbol{(2n-1)}-cocycles in finite characteristic from quadratic (𝟐𝒏𝟐)\boldsymbol{(2n-2)}-cocycles in characteristic 𝟎\boldsymbol{0}

This can be done in the following four steps.

  1. (i)

    Polarization: switch to the bilinear form corresponding to a given quadratic cocycle. There appear thus two permitted colorings, each enters linearly:

    cijxij2cijxijyij.c_{ij}x_{ij}^{2}\mapsto c_{ij}x_{ij}y_{ij}.
  2. (ii)

    Raise xijx_{ij} into a degree pkp^{k}, while yijy_{ij} into a degree plp^{l},  k,l=1,2,k,l=1,2,\ldots. It may call to mind Frobenius endomorphisms, but note that we are still in characteristic 0. We get polynomial cochain

    cijxijpkyijpl,c_{ij}x_{ij}^{p^{k}}y_{ij}^{p^{l}},

    homogeneous separately in xx’s and yy’s.

  3. (iii)

    Take the coboundary. As we started with a cocycle, the result is divisible by pp, other terms cancel out.

  4. (iv)

    Divide by pp and reduce modulo pp, like it is done in a usual Bockstein homomorphism.

From heptagon to hexagon with two-component colors

Consider a 4-dimensional Pachner move 3–3 and then the bicones over its lhs (initial configuration) and rhs (final configuration). Bicone means here the same as the join [4, Chapter 0] with the boundary I={0,1}\partial I=\{0,1\} of the unit segment I=[0,1]I=[0,1]. It is an easy exercise to see that the lhs bicone can be transformed into the rhs one by, first, a 5-dimensional Pachner move 3–4 and, second, move 4–3. If there are now permitted colorings defined for the 4-faces of the 5-simplices involved, like in this paper, then we can attach two colors, or call it a two-component color, to each 3-face of 4-simplices in the 3–3 move from which we started. It will be interesting to study connections of this construction with papers [6, 8].

References

  • [1] Scott Carter, Seiichi Kamada, Masahico Saito, Surfaces in 4-space, Encyclopaedia of Mathematical Sciences, Volume 142, Springer 2004.
  • [2] Aristophanes Dimakis and Folkert Müller-Hoissen, Simplex and polygon equations, SIGMA 11 (2015), paper 042, 49 pages.
  • [3] Aristophanes Dimakis and Igor G. Korepanov, Grassmannian-parameterized solutions to direct-sum polygon and simplex equations, J. Math. Phys. 62 (2021), 051701.
  • [4] Allen Hatcher, Algebraic topology, Cambridge University Press, 2002.
  • [5] I.G. Korepanov, Exact solutions and mixing in an algebraic dynamical system, Theoretical and Mathematical Physics, 143:1 (2005), 599–614.
  • [6] I.G. Korepanov, N.M. Sadykov, Hexagon cohomologies and polynomial TQFT actions, arXiv:1707.02847.
  • [7] I.G. Korepanov, Heptagon relation in a direct sum, Algebra i Analiz, 33:4 (2021), 125–140 (Russian). English translation: arXiv:2003.10335.
  • [8] Igor G. Korepanov, Nonconstant hexagon relations and their cohomology, Lett. Math. Phys. 111, paper 1 (2021), arXiv:1812.10072.
  • [9] W.B.R. Lickorish, Simplicial moves on complexes and manifolds, Geom. Topol. Monogr. 2 (1999), 299–320. arXiv:math/9911256.
  • [10] U. Pachner, PL homeomorphic manifolds are equivalent by elementary shellings, Europ. J. Combinatorics 12 (1991), 129–145.