Advances in Mathematical Physics

Volume 2018, Article ID 7496762, 5 pages

https://doi.org/10.1155/2018/7496762

## A Mathematical Bridge between Discretized Gauge Theories in Quantum Physics and Approximate Reasoning in Pairwise Comparisons

Correspondence should be addressed to Jean-Pierre Magnot; moc.liamg@tongam.pj

Received 2 October 2017; Revised 16 December 2017; Accepted 26 December 2017; Published 23 January 2018

Academic Editor: Andrei D. Mironov

Copyright © 2018 Jean-Pierre Magnot. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We describe a mathematical link between aspects of information theory, called pairwise comparisons, and discretized gauge theories. The link is made by the notion of holonomy along the edges of a simplex. This correspondence leads to open questions in both fields.

#### 1. Introduction

We present here an overview, addressed to physicists, of a possible bridge between gauge theories (and also some aspects of quantum gravity) with pairwise comparisons matrices and their applications in information theory and approximate reasoning. This is the reason why we rapidly summarize features in physics (assuming that they are known by the reader) and give more details for selected features on pairwise comparisons (PC) matrices (assuming that this field is less known). This paper is a companion work to [1–3] where, after a tentative in [4], the extension of the notion of classical PC matrices to matrices with coefficients in a group is considered, partially motivated (in my case) by the striking similarities with mathematical constructions in discretized gauge theories. A not complete list of reference about PC matrices is [5–7], oriented in our perspective, and a very partial list of references about gauge theories and their discretized forms is [8–19].

We begin with an oriented survey of selected problems in discretization of gauge theories, where is a Lie group, and a selection of features in evaluation of inconsistency in pairwise comparisons with coefficients in Then we describe, following [1, 2], a straightforward extension of PC matrices with coefficients in to a general Lie group The link with gauge theories is performed via holonomy, which appears in discretizations described in [3, 16]. In order to make a link with questions raised by computer scientists in private communications, we have to precise that any matrix group is a finite dimensional Lie group and that most finite dimensional groups can be expressed as matrix groups, for inversion and multiplication of matrices. We finish with the possible interpretations in both sides of this correspondence, first from quantities on PC matrices to gauge theories and secondly from second quantization to approximate reasoning.

#### 2. A Short and Not Complete Survey of Each Field of Knowledge

We present here the two fields under consideration, discretized gauge theories and pairwise comparisons in approximate reasoning, in a way to highlight the correspondence.

##### 2.1. Gauge Theories Discretized

The phase space of a (continuum) gauge theory is a space of connections on a (finite dimensional) principal bundle with structure group and with base . We denote by the space of connections considered. If is not compact and Riemannian, one often uses the space of connections which are smooth and square-integrable. A gauge theory is defined by an action functional which has to be minimized.

A discretized gauge theory is defined on a triangulation, a cubification or any other way to discretize the manifold , and the principal bundle can be often trivial. Let us highlight two kind of discretizations:(i)Whitney’s discretization [20], where a connection is integrated on the 1-vertices of the chosen triangulation. This mimics a finite element method of approximation for scalar functions, and the discretized connection generates a -approximation of , which -converges to when refining the triangulation. The action functional is then evaluated on the finite dimensional space of connections instead of the infinite dimensional space This is, to our knowledge the most widely developed approach, but this approach seems to fail partially for nonabelian theories, partly because the trivialization is not gauge covariant. This leads to gauge-fixing strategies.(ii)Holonomy discretization, mostly inspired by the ideas of quantum gravity [16], where connections along the edges are discretized through their holonomy. This approach requires mathematical precisions by fixing a preliminary gauge on the 1-vertices of the discretized manifold, but in a final analysis, only theories depending of secondary characteristic classes (e.g., Chern-Simons theory) can give rise to pathologies in gauge covariance, whereas gauge theories arising from primary characteristic classes (e.g., Yang-Mills theories) are fully gauge covariant when discretized [3].

##### 2.2. Pairwise Comparisons, Consistency, and Inconsistency

A pairwise comparisons (PC) matrix is a matrixsuch that (i),(ii),(iii).

The coefficients are traditionally called* ratios* and are supposed to translate into a score the comparison of two states with numbers and When there exists a family of positive real numbers such thatthe PC matrix is called* consistent*. When it is not consistent, the formuladoes not hold for at least one choice of indexes By the way, it is easy to explain the inconsistency in PC matrices when we consider cycles of three comparisons, called triads and represented here as , relative to the PC matrixwhich do not have the “morphism of groupoid” property such asThe use of “inconsistency” has a meaning of a measure of inconsistency in this study, not the concept itself. In order to measure inconsistency, we define mapscalled inconsistency indicators, which are vanishing on consistent PC matrices and which intend to measure the lack of consistency, that is, intuitively speaking, the distance of a PC matrix to the nearest consistent PC matrix. In applications, PC matrices are modified with algorithms (which are often recursive) in order to minimize the chosen inconsistency indicator. One approach to inconsistency (originated in [6] and generalized in [5]) can be reduced to a simple observation: (i)Search all triads (which generate all 3 by 3 PC submatrices) and locate the worst triad with an inconsistency indicator ().(ii)The inconsistency indicator evaluated on the worst triad becomes the inconsistency indicator evaluated on the entire PC matrix.

Expressing it a bit more formally in terms of triads (the upper triangle of a PC submatrix ), we haveThe expression stands for the distance of the triad to the “nearest” consistent PC matrix. When this distance increases, the also increases. It is important to notice here that this definition allows us to localize the inconsistency in the PC matrix, which is of importance for most applications. For higher rank matrices, is evaluated on each matrix, taking the supremum of the obtained values.

Another possible definition of the inconsistency indicator can also be defined (following [7]) as since the matrix is consistent if and only if for any the following equation holds:This is equivalent to

One of the main features in applications is to minimize the inconsistency indicator This is the reason why, instead of using the inconsistency indicator defined before, there is plethora of inconsistency indicators. Each inconsistency indicator intends to measure how far a PC matrix is from the set of consistent PC matrices, which, for PC matrices, is a 2-dimensional manifold of matrices of the formUnfortunately, the notion and the theory of inconsistency indicators are not actually fixed and achieved, and many competing, incompatible approaches are actually developed. In order to relate PC matrices to gauge theories, we need to generalize (quite straightway) the framework described before, changing the group to any Lie group . In the setting of gauge theories, is in most cases a finite dimensional, compact (or at least unimodular) group which can be represented as a matrix group. But this assumption is not technically necessary for the generalization and will be only recovered when discussing the possible correspondences announced.

#### 3. The Matrix of Holonomies and Pairwise Comparisons

We first follow [2]. Let be a set of indexes among , , or for some

*Definition 1. *Let be a group. A PC matrix is a matrix such that(1),(2), where is the inversion in ,(3)

The matrix is* covariantly consistent* if

Due to the contravariant composition thereafter, we will use the following notion: the PC matrix is* contravariantly consistent* ifThese two notions are dual and depend on which order we require for the group multiplication. Similarly, a contravariant consistent PC matrix generates a covariant consistent PC matrix setting For convenience, we use the term* covariant PC matrix* (resp.,* contravariant PC matrix*) when covariant consistency (resp., contravariant consistency) is naturally required. In order to make the difference more clear with the more general cases described in next section, we have to recall that each coefficient here is in a group, and hence there is no vanishing coefficient in the matrix .

Theorem 2.

Let andbe an -simplex. This simplex can be generalized to the infinite dimension:where the summation over is done by integration with respect to the counting measure. In the sequel, will denote , or Let be the -vertices of Since is smoothly contractible, any -principal bundle over is isomorphic to and a -connection 1-form on is a 1-form , which extends to a -covariant 1-form in , with respect to the coadjoint action of on We define a gauge with where the piecewise smooth paths are defined by the standard composition of the paths along -vertices of setting:Let Hol the (mathematical) holonomy on loops relative to a fixed connection We set Let us recall that, for two paths and such that exists (i.e., ), if , and , we have This enables the (physics) definition of holonomy present, for example, in [16] that we apply to the edges and identify with the coefficients :

In the light of these specifications, we set, for any connection , and the required notion of consistency is contravariant consistency.

Proposition 3. * is a PC matrix with coefficients in *

*Proof. *This follows from holonomy in “reverse orientation.”

Let be the loop based on along the border of the oriented 2-vertex , where is the composition of paths.

Contravariant consistency seems to fit naturally with flatness of connections: By fixing an* indicator map*, defined in [4] asto , we get a generalization of the* inconsistency indicator* by settingFor example, if is a left-invariant distance on , a natural indicator map can be

Such definitions extend to triangularized manifolds along the lines of [3], where one can see that the notion of holonomy on a manifold can be discretized, inserting “gaps” (i.e., 0 entries) on a larger matrix gathering all the PC matrices over the simplexes of the triangulation, along the lines of [2]. We then recover the discretization of connections via holonomies described in [16]. When In (classical) pairwise comparisons, matrix coefficients are scalar, which enable simplifying the settings obtained. The indicator appears as the distance of the holonomy of the loop to identity.

#### 4. Correspondences and Open Questions

We give the table of correspondences (see Table 1) that we comment on. We first highlight how the notions on PC matrices correspond to geometric objects.