Searcharxiv⌕ Search

arXiv subjects

Noson S. Yanofsky

Publications and source records attributed to Noson S. Yanofsky.

14 recordsLinked to original sources

Document Understanding, Measurement, and Manipulation Using Category Theory

We apply category theory to extract multimodal document structure which leads us to develop information theoretic measures, content summarization and extension, and self-supervised improvement of large pretrained models. We first develop a mathematical representation of a document as a category of question-answer pairs. Second, we develop an orthogonalization procedure to divide the information contained in one or more documents into non-overlapping pieces. The structures extracted in the first and second steps lead us to develop methods to measure and enumerate the information contained in a document. We also build on those steps to develop new summarization techniques, as well as to develop a solution to a new problem viz. exegesis resulting in an extension of the original document. Our question-answer pair methodology enables a novel rate distortion analysis of summarization techniques. We implement our techniques using large pretrained models, and we propose a multimodal extension of our overall mathematical framework. Finally, we develop a novel self-supervised method using RLVR to improve large pretrained models using consistency constraints such as composability and closure under certain operations that stem naturally from our category theoretic framework.

cs.CL↗

Computability and Complexity of Categorical Structures

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by categories. Since there are infinitary constructions in category theory, it is shown that category theory is strictly more powerful than Turing machines. In particular, categories can solve the Halting Problem for Turing machines. We also show that categories can solve any problem in the arithmetic hierarchy.

cs.CC↗

Theoretical Computer Science for the Working Category Theorist

Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as "What is a computation?", "What is computable?", "What is efficiently computable?","What is information?", "What is random?", "What is an algorithm?", etc. We will present many of the major themes and theorems with the basic language of category theory. Surprisingly, many interesting theorems and concepts of theoretical computer science are easy consequences of functoriality and composition when you look at the right categories and functors connecting them.

cs.LO↗

The Role of Symmetry in Mathematics

Over the past few decades the notion of symmetry has played a major role in physics and in the philosophy of physics. Philosophers have used symmetry to discuss the ontology and seeming objectivity of the laws of physics. We introduce several notions of symmetry in mathematics and explain how they can also be used in resolving different problems in the philosophy of mathematics. We use symmetry to discuss the objectivity of mathematics, the role of mathematical objects, the unreasonable effectiveness of mathematics and the relationship of mathematics to physics.

math.HO↗

Why Mathematics Works So Well

A major question in philosophy of science involves the unreasonable effectiveness of mathematics in physics. Why should mathematics, created or discovered, with nothing empirical in mind be so perfectly suited to describe the laws of the physical universe? We review the well-known fact that the symmetries of the laws of physics are their defining properties. We show that there are similar symmetries of mathematical facts and that these symmetries are the defining properties of mathematics. By examining the symmetries of physics and mathematics, we show that the effectiveness is actually quite reasonable. In essence, we show that the regularities of physics are a subset of the regularities of mathematics.

physics.hist-ph↗

Galois Theory of Algorithms

Many different programs are the implementation of the same algorithm. The collection of programs can be partitioned into different classes corresponding to the algorithms they implement. This makes the collection of algorithms a quotient of the collection of programs. Similarly, there are many different algorithms that implement the same computable function. The collection of algorithms can be partitioned into different classes corresponding to what computable function they implement. This makes the collection of computable functions into a quotient of the collection of algorithms. Algorithms are intermediate between programs and functions: Programs $\twoheadrightarrow$ Algorithms $\twoheadrightarrow$ Functions. \noindent Galois theory investigates the way that a subobject sits inside an object. We investigate how a quotient object sits inside an object. By looking at the Galois group of programs, we study the intermediate types of algorithms possible and the types of structures these algorithms can have.

math.RA↗

Mathematics via Symmetry

We state the defining characteristic of mathematics as a type of symmetry where one can change the connotation of a mathematical statement in a certain way when the statement's truth value remains the same. This view of mathematics as satisfying such symmetry places mathematics as comparable with modern views of physics and science where, over the past century, symmetry also plays a defining role. We explore the very nature of mathematics and its relationship with natural science from this perspective. This point of view helps clarify some standard problems in the philosophy of mathematics.

math.HO↗

Kolmogorov Complexity of Categories

Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to describe categories, functors, and natural transformations. With this in hand, we define the informational content of these categorical structures as the shortest program that describes such structures. Some basic consequences of our definition are presented including the fact that equivalent categories have equal Kolmogorov complexity. We also prove different theorems about what can and cannot be described by our programming language.

math.CT↗

Towards a Definition of an Algorithm

We define an algorithm to be the set of programs that implement or express that algorithm. The set of all programs is partitioned into equivalence classes. Two programs are equivalent if they are essentially the same program. The set of equivalence classes forms the category of algorithms. Although the set of programs does not even form a category, the set of algorithms form a category with extra structure. The conditions we give that describe when two programs are essentially the same turn out to be coherence relations that enrich the category of algorithms with extra structure. Universal properties of the category of algorithms are proved.

math.LO↗

An Introduction to Quantum Computing

Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.

quant-ph↗

A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points

Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses the semantic paradoxes, and how they arise as diagonal arguments and fixed point theorems in logic, computability theory, complexity theory and formal language theory.

math.LO↗

Coherence, Homotopy and 2-Theories

2-Theories are a canonical way of describing categories with extra structure. 2-theory-morphisms are used when discussing how one structure can be replaced with another structure. This is central to categorical coherence theory. We place a Quillen model category structure on the category of 2-theories and 2-theory-morphisms where the weak equivalences are biequivalences of 2-theories. A biequivalence of 2-theories (Morita equivalence) induces and is induced by a biequivalence of 2-categories of algebras. This model category structure allows one to talk of the homotopy of 2-theories and discuss the universal properties of coherence.

math.CT↗

The Syntax of Coherence

This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded, many coherence results become simple statements about the quasi-Yoneda lemma and 2-theory-morphisms. Given two 2-theories and a 2-theory-morphism between them, we explore the induced relationship between the corresponding 2-categories of algebras. The strength of the induced quasi-adjoints are classified by the strength of the 2-theory-morphism. These quasi-adjoints reflect the extent to which one structure can be replaced by another. A two-dimensional analogue of the Kronecker product is defined and constructed. This operation allows one to generate new coherence laws from old ones.

math.CT↗

Obstructions to Coherence: Natural Noncoherent Associativity

We study what happens when coherence fails. Categories with a tensor product and a natural associativity isomorphism that does not necessarily satisfy the pentagon coherence requirements (called associative categories) are considered. Categorical versions of associahedra where naturality squares commute and pentagons do not, are constructed (called Catalan groupoids, $\An$). These groupoids are used in the construction of the free associative category. They are also used in the construction of the theory of associative categories (given as a 2-sketch). Generators and relations are given for the fundamental group, $π(\An)$, of the Catalan groupoids -- thought of as a simplicial complex. These groups are shown to be more than just free groups. Each associative category, $B$, has related fundamental groups $π(\bf B_n)$ and homomorphisms $π(P_n):π(\An) \longrightarrow π(\bf B_n)$. If the images of the $π(P_n)$ are trivial, i.e. there is only one associativity path between any two objects, then the category is coherent. Otherwise the images of $π(P_n)$ are obstructions to coherence. Some progress is made in classifying noncoherence of associative categories.

math.QA↗