Proof of a Conjecture of S. Mac Lane

Abstract Some sufficient conditions on a Symmetric Monoidal Closed category K are obtained such that a diagram in a free SMC category generated by the set A of atoms commutes if and only if all its interpretations in K are commutative. In particular, the category of vector spaces on any field satisfies these conditions (this is the only case considered in the original Mac Lane conjecture). Instead of diagrams, pairs of derivations in Intuitionistic Multiplicative Linear logic can be considered (together with categorical equivalence). Two derivations of the same sequent are equivalent if and only if all their interpretations in K are equal. In fact, the assignment of values (objects of K) to atoms is defined constructively for each pair of derivations. Taking into account a mistake in R. Voreadou's proof of the “abstract coherence theorem” found by the author, it was necessary to modify her description of the class of non-commutative diagrams in SMC categories; our proof of S. Mac Lane conjecture also proves the correctness of the modified description.

[1]  M. E. Szabo Algebra of proofs , 1978 .

[2]  Wang Yi,et al.  Diagnostic Model-Checking for Real-Time Systems , 1995, Hybrid Systems.

[3]  S. Solov′ev The category of finite sets and Cartesian closed categories , 1983 .

[4]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[5]  G. M. Kelly,et al.  A generalization of the functorial calculus , 1966 .

[6]  Saunders Mac Lane,et al.  Topology and logic as a source of algebra , 1976 .

[7]  A cut-elimination theorem , 1972 .

[8]  Andrew M. Pitts,et al.  Category Theory and Computer Science , 1987, Lecture Notes in Computer Science.

[9]  Pierre Lescanne,et al.  Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution , 1996, PLILP.

[10]  Richard Statman,et al.  Completeness, invariance and λ-definability , 1982, Journal of Symbolic Logic.

[11]  C. Barry Jay Coherence in category theory and the Church-Rosser property , 1992, Notre Dame J. Formal Log..

[12]  G. Mints,et al.  Closed categories and the theory of proofs , 1981 .

[13]  Paul Pettersson,et al.  Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II , 1998, TACAS.

[14]  S. V. Soloviev On the conditions of full Coherence in closed categories , 1991 .

[15]  G. M. Kelly,et al.  Coherence in closed categories , 1971 .

[16]  C. Barry Jay The structure of free closed categories , 1990 .

[17]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[18]  Wang Yi,et al.  Compositional and symbolic model-checking of real-time systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.