Diagrammatic Proof Research Articles

Who's Afraid of Mathematical Diagrams?

Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions.   Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs.  In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show that diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability.  I then consider whether diagrams can be essential to the proofs in which they appear.@font-face{font-family:"Cambria Math";panose-1:2 4 5 3 5 4 6 3 2 4;mso-font-charset:0;mso-generic-font-family:roman;mso-font-pitch:variable;mso-font-signature:-536870145 1107305727 0 0 415 0;}@font-face{font-family:Calibri;panose-1:2 15 5 2 2 2 4 3 2 4;mso-font-charset:0;mso-generic-font-family:swiss;mso-font-pitch:variable;mso-font-signature:-536859905 -1073697537 9 0 511 0;}p.MsoNormal, li.MsoNormal, div.MsoNormal{mso-style-unhide:no;mso-style-qformat:yes;mso-style-parent:"";margin:0in;line-height:200%;mso-pagination:widow-orphan;font-size:12.0pt;font-family:"Calibri",sans-serif;mso-fareast-font-family:Calibri;}.MsoChpDefault{mso-style-type:export-only;mso-default-props:yes;font-family:"Calibri",sans-serif;mso-ascii-font-family:Calibri;mso-fareast-font-family:Calibri;mso-hansi-font-family:Calibri;mso-bidi-font-family:Calibri;}.MsoPapDefault{mso-style-type:export-only;line-height:200%;}div.WordSection1{page:WordSection1;}

Fitch-Style Modal Necessity as a Substructural Sequent-Style System

The question of defining a Jaskowski-Fitch natural deduction system for modal logic has been settled since the very introduction of such formalisms in the middle of the last century. In contrast, a sequent-style formulation of this approach has only been discussed since the turn of this century but exclusively from the point of view of type theories. In this paper we propose a substructural sequent-style deductive system, based on previous ideas by Borghuis and Clouston, which captures Fitch-style for modal logic in a faithful way, meaning that the features of the original diagrammatic proofs are enforced by the sequent rules. This answers the question of what is a sequent-style version of Fitch-style natural deduction in the case of the necessity fragment of minimal modal logic S4.

Operator growth in open quantum systems: lessons from the dissipative SYK

We study the operator growth in open quantum systems with dephasing dissipation terms, extending the Krylov complexity formalism of [1]. Our results are based on the study of the dissipative q-body Sachdev-Ye-Kitaev (SYKq) model, governed by the Markovian dynamics. We introduce a notion of “operator size concentration” which allows a diagrammatic and combinatorial proof of the asymptotic linear behavior of the two sets of Lanczos coefficients (an and bn) in the large q limit. Our results corroborate with the semi-analytics in finite q in the large N limit, and the numerical Arnoldi iteration in finite q and finite N limit. As a result, Krylov complexity exhibits exponential growth following a saturation at a time that grows logarithmically with the inverse dissipation strength. The growth of complexity is suppressed compared to the closed system results, yet it upper bounds the growth of the normalized out-of-time-ordered correlator (OTOC). We provide a plausible explanation of the results from the dual gravitational side.

Trisection diagrams and twists of 4-manifolds

A theorem of Katanaga, Saeki, Teragaito, and Yamada relates Gluck and Price twists of 4-manifolds. Using trisection diagrams, we give a purely diagrammatic proof of this theorem, and answer a question of Kim and Miller.

Wall Polynomials on the Real Line: A Classical Approach to OPRL Khrushchev’s Formula

The standard proof of Khrushchev’s formula for orthogonal polynomials on the unit circle given in Khrushchev (J Approx Theory 108:161–248, 2001, J Approx Theory 116:268–342, 2002) combines ideas from continued fractions and complex analysis, depending heavily on the theory of Wall polynomials. Using operator theoretic tools instead, Khrushchev’s formula has been recently extended to the setting of orthogonal polynomials on the real line in the determinate case (Grünbaum and Velázquez in Adv Math 326:352–464, 2018). This paper develops a theory of Wall polynomials on the real line, which serves as a means to prove Khrushchev’s formula for any sequence of orthogonal polynomials on the real line. This real line version of Khrushchev’s formula is used to rederive the characterization given in Simon (J Approx Theory 126:198–217, 2004) for the weak convergence of p_n^2mathrm{d}mu , where p_n are the orthonormal polynomials with respect to a measure mu supported on a bounded subset of the real line (Theorem 8.1). The generality and simplicity of such a Khrushchev’s formula also permits the analysis of the unbounded case. Among other results, we use this tool to prove that no measure mu supported on an unbounded subset of the real line yields a weakly convergent sequence p_n^2mathrm{d}mu (Corollary 8.10), but there exist instances such that p_n^2mathrm{d}mu becomes vaguely convergent (Example 8.5 and Theorem 8.6). Some other asymptoptic results related to the convergence of p_n^2mathrm{d}mu in the unbounded case are obtained via Khrushchev’s formula (Theorems 8.3, 8.7, 8.8, Proposition 8.4, Corollary 8.9). In the bounded case, we include a simple diagrammatic proof of Khrushchev’s formula on the real line which sheds light on its graph theoretical meaning, linked to Pólya’s recurrence theory for classical random walks.

High-level axioms for graphical linear algebra

• We present useful symmetrical axioms for graphical linear algebra. • We use only the diagrammatic language and its associated reasoning principles. • We develop an approach to matrices, proving its equivalence to the classical one. We focus on a modular, graphical language—graphical linear algebra—and use it as high-level language for calculational reasoning. We propose a minimal framework of axioms that highlight the dualities and symmetries of linear algebra, and showcase the resulting diagrammatic calculus. Our work develops a relational approach to linear algebra, closely connected to classical relational algebra. With the symmetrical high-level axioms we are able to provide a fully diagrammatic proof that a fragment of Graphical Linear Algebra is equivalent to matrix algebra.

Two constructive proofs on d-majorization and thermo-majorization

Two constructive proofs on d-majorization and thermo-majorization are provided. In the first part, we present a diagrammatic proof of the equivalence between d-majorization and the existence of a proper stochastic matrix. We explicitly construct the desired stochastic matrix by using a graphical argument. In the second part, we present a constructive proof of the equivalence between the Gibbs-preserving map and thermal operation in classical systems. We construct the desired thermal operation and a heat bath which emulates any Gibbs-preserving map with arbitrary accuracy.

Gustafson’s Isomorphism and the Zassenhaus Lemma via a Common Commutative Diagram

We propose a diagrammatic proof of Gustafson’s isomorphism theorem concerning block matrices over rings. The same commutative diagram in a group-theoretic setting is used to prove the Zassenhaus lemma.

Diagrammatic proof of the large N melonic dominance in the SYK model

A crucial result on the celebrated Sachdev-Ye-Kitaev model is that its large $N$ limit is dominated by melonic graphs. In this letter we offer a rigorous, diagrammatic proof of that result by direct, combinatorial analysis of its Feynman graphs.

Parallel Self-Testing of the GHZ State with a Proof by Diagrams

Quantum self-testing addresses the following question: is it possible to verify the existence of a multipartite state even when one's measurement devices are completely untrusted? This problem has seen abundant activity in the last few years, particularly with the advent of parallel self-testing (i.e., testing several copies of a state at once), which has applications not only to quantum cryptography but also quantum computing. In this work we give the first error-tolerant parallel self-test in a three-party (rather than two-party) scenario, by showing that an arbitrary number of copies of the GHZ state can be self-tested. In order to handle the additional complexity of a three-party setting, we use a diagrammatic proof based on categorical quantum mechanics, rather than a typical symbolic proof. The diagrammatic approach allows for manipulations of the complicated tensor networks that arise in the proof, and gives a demonstration of the importance of picture-languages in quantum information.

Parallel Self-Testing of the GHZ State with a Proof by Diagrams

Quantum self-testing addresses the following question: is it possible to verify the existence of a multipartite state even when one's measurement devices are completely untrusted? This problem has seen abundant activity in the last few years, particularly with the advent of parallel self-testing (i.e., testing several copies of a state at once), which has applications not only to quantum cryptography but also quantum computing. In this work we give the first error-tolerant parallel self-test in a three-party (rather than two-party) scenario, by showing that an arbitrary number of copies of the GHZ state can be self-tested. In order to handle the additional complexity of a three-party setting, we use a diagrammatic proof based on categorical quantum mechanics, rather than a typical symbolic proof. The diagrammatic approach allows for manipulations of the complicated tensor networks that arise in the proof, and gives a demonstration of the importance of picture-languages in quantum information.

Invariants of the special orthogonal group and an enhanced Brauer category

We first give a short intrinsic, diagrammatic proof of the First Fundamental Theorem of invariant theory (FFT) for the special orthogonal group SO _m(\mathbb C) , given the FFT for O _m(\mathbb C) . We then define, by means of a presentation with generators and relations, an enhanced Brauer category \widetilde{\mathcal B}(m) by adding a single generator to the usual Brauer category \mathcal B(m) , together with four relations. We prove that our category \widetilde{\mathcal B}(m) is actually (and remarkably) equivalent to the category of representations of SO _m generated by the natural representation. The FFT for SO _m amounts to the surjectivity of a certain functor \mathcal F on Hom spaces, while the Second Fundamental Theorem for SO _m says simply that \mathcal F is injective on Hom spaces. This theorem provides a diagrammatic means of computing the dimensions of spaces of homomorphisms between tensor modules for SO _m (for any m ).

An equivalence between truncations of categorified quantum groups and Heisenberg categories

We introduce a simple diagrammatic 2-category $\mathscr{A}$ that categorifies the image of the Fock space representation of the Heisenberg algebra and the basic representation of $\mathfrak{sl}_\infty$. We show that $\mathscr{A}$ is equivalent to a truncation of the Khovanov--Lauda categorified quantum group $\mathscr{U}$ of type $A_\infty$, and also to a truncation of Khovanov's Heisenberg 2-category $\mathscr{H}$. This equivalence is a categorification of the principal realization of the basic representation of $\mathfrak{sl}_\infty$. As a result of the categorical equivalences described above, certain actions of $\mathscr{H}$ induce actions of $\mathscr{U}$, and vice versa. In particular, we obtain an explicit action of $\mathscr{U}$ on representations of symmetric groups. We also explicitly compute the Grothendieck group of the truncation of $\mathscr{H}$. The 2-category $\mathscr{A}$ can be viewed as a graphical calculus describing the functors of $i$-induction and $i$-restriction for symmetric groups, together with the natural transformations between their compositions. The resulting computational tool is used to give simple diagrammatic proofs of (apparently new) representation theoretic identities.

What Did Glaucon Draw?: A Diagrammatic Proof for Plato's Divided Line

Despite the frequency and intensity of scholarly attention to Plato's important divided line passage in Republic 6, an ancient puzzle has repeatedly baffled interpreters: the two middle segments of the line are of equal length, although Socrates declares that the degree of clarity and truth increases in proportion to the contents of each of the line's four segments. The missing piece of the puzzle, I argue, is provided by the practice of ancient Greek geometry: diagrams were drawn with a compass and straightedge. Thus, as actually constructed in the fifth and fourth centuries BCE, the diagram itself vindicates Plato's text.

Encoding !-tensors as !-graphs with neighbourhood orders

Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to mark repeated structure inside a diagram. This led to !-graphs being implemented in the diagrammatic proof assistant Quantomatic. Having a partially automated program for rewriting diagrams has proven very useful, but being based on !-graphs, only commutative theories are allowed. An enriched abstract tensor notation, called !-tensors, has been used to formalise the notion of !-boxes in non-commutative structures. This work-in-progress paper presents a method to encode !-tensors as !-graphs with some additional structure. This will allow us to leverage the existing code from Quantomatic and quickly provide various tools for non-commutative diagrammatic reasoning.

Speedith: A Reasoner for Spider Diagrams

In this paper, we introduce Speedith which is an interactive diagrammatic theorem prover for the well-known language of spider diagrams. Speedith provides a way to input spider diagrams, transform them via the diagrammatic inference rules, and prove diagrammatic theorems. Speedith's inference rules are sound and complete, extending previous research by including all the classical logic connectives. In addition to being a stand-alone proof system, Speedith is also designed as a program that plugs into existing general purpose theorem provers. This allows for other systems to access diagrammatic reasoning via Speedith, as well as a formal verification of diagrammatic proof steps within standard sentential proof assistants. We describe the general structure of Speedith, the diagrammatic language, the automatic mechanism that draws the diagrams when inference rules are applied on them, and how formal diagrammatic proofs are constructed.

A Quantum Dynamical Approach to Matrix Khrushchev's Formulas

AbstractKhrushchev's formula is the cornerstone of the so‐called Khrushchev theory, a body of results which has revolutionized the theory of orthogonal polynomials on the unit circle. This formula can be understood as a factorization of the Schur function for an orthogonal polynomial modification of a measure on the unit circle. No such formula is known in the case of matrix‐valued measures. This constitutes the main obstacle to generalize Khrushchev theory to the matrix‐valued setting, which we overcome in this paper.It was recently discovered that orthogonal polynomials on the unit circle and their matrix‐valued versions play a significant role in the study of quantum walks, the quantum mechanical analogue of random walks. In particular, Schur functions turn out to be the mathematical tool which best codify the return properties of a discrete time quantum system, a topic in which Khrushchev's formula has profound and surprising implications.We will show that this connection between Schur functions and quantum walks is behind a simple proof of Khrushchev's formula via “quantum” diagrammatic techniques for CMV matrices. This does not merely give a quantum meaning to a known mathematical result, since the diagrammatic proof also works for matrix‐valued measures. Actually, this path‐counting approach is so fruitful that it provides different matrix generalizations of Khrushchev's formula, some of them new even in the case of scalar measures.Furthermore, the path‐counting approach allows us to identify the properties of CMV matrices which are responsible for Khrushchev's formula. On the one hand, this helps to formalize and unify the diagrammatic proofs using simple operator theory tools. On the other hand, this is the origin of our main result which extends Khrushchev's formula beyond the CMV case, as a factorization rule for Schur functions related to general unitary operators.© 2016 Wiley Periodicals, Inc.

Chebyshev polynomials and the Frohman–Gelca formula

Using Chebyshev polynomials, C. Frohman and R. Gelca introduced a basis of the Kauffman bracket skein module of the torus. This basis is especially useful because the Jones–Kauffman product can be described via a very simple Product-to-Sum formula. Presented in this work is a diagrammatic proof of this formula, which emphasizes and demystifies the role played by Chebyshev polynomials.

Counter-Example Construction with Euler Diagrams

One of the traditional applications of Euler diagrams is as a representation or counterpart of the usual set-theoretical models of given sentences. However, Euler diagrams have recently been investigated as the counterparts of logical formulas, which constitute formal proofs. Euler diagrams are rigorously defined as syntactic objects, and their inference systems, which are equivalent to some symbolic logical systems, are formalized. Based on this observation, we investigate both counter-model construction and proof-construction in the framework of Euler diagrams. We introduce the notion of "counter-diagrammatic proof", which shows the invalidity of a given inference, and which is defined as a syntactic manipulation of diagrams of the same sort as inference rules to construct proofs. Thus, in our Euler diagrammatic framework, the completeness theorem can be formalized in terms of the existence of a diagrammatic proof or a counter-diagrammatic proof.

That We See That Some Diagrammatic Proofs Are Perfectly Rigorous

Mistaken reasons for thinking diagrammatic proofs aren't rigorous are explored. The main result is that a confusion between the contents of a proof procedure (what's expressed by the referential elements in a proof procedure) and the unarticulated mathematical aspects of a proof procedure (how that proof procedure is enabled) gives the impression that diagrammatic proofs are less rigorous than language proofs. An additional (and independent) factor is treating the impossibility of naturally generalizing a diagrammatic proof procedure as an indication of lack of rigor.