Finite mathematics as the most general (fundamental) mathematics
- URL: http://arxiv.org/abs/2203.09482v2
- Date: Tue, 20 Aug 2024 19:27:55 GMT
- Title: Finite mathematics as the most general (fundamental) mathematics
- Authors: Felix M Lev,
- Abstract summary: Quantum theory based on a finite ring of characteristic $p$ is more general than standard quantum theory because the latter is a degenerate case of the former in the formal limit $ptoinfty$.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The purpose of this paper is to explain at the simplest possible level why finite mathematics based on a finite ring of characteristic $p$ is more general (fundamental) than standard mathematics. The belief of most mathematicians and physicists that standard mathematics is the most fundamental arose for historical reasons. However, simple {\it mathematical} arguments show that standard mathematics (involving the concept of infinities) is a degenerate case of finite mathematics in the formal limit $p\to\infty$: standard mathematics arises from finite mathematics in the degenerate case when operations modulo a number are discarded. Quantum theory based on a finite ring of characteristic $p$ is more general than standard quantum theory because the latter is a degenerate case of the former in the formal limit $p\to\infty$.
Related papers
- MathBench: Evaluating the Theory and Application Proficiency of LLMs with a Hierarchical Mathematics Benchmark [82.64129627675123]
MathBench is a new benchmark that rigorously assesses the mathematical capabilities of large language models.
MathBench spans a wide range of mathematical disciplines, offering a detailed evaluation of both theoretical understanding and practical problem-solving skills.
arXiv Detail & Related papers (2024-05-20T17:52:29Z) - Machine learning and information theory concepts towards an AI
Mathematician [77.63761356203105]
The current state-of-the-art in artificial intelligence is impressive, especially in terms of mastery of language, but not so much in terms of mathematical reasoning.
This essay builds on the idea that current deep learning mostly succeeds at system 1 abilities.
It takes an information-theoretical posture to ask questions about what constitutes an interesting mathematical statement.
arXiv Detail & Related papers (2024-03-07T15:12:06Z) - MathGloss: Building mathematical glossaries from text [0.620048328543366]
MathGloss is a database of undergraduate concepts in mathematics.
It uses modern natural language processing (NLP) tools and resources already available on the web.
arXiv Detail & Related papers (2023-11-21T14:49:00Z) - TheoremQA: A Theorem-driven Question Answering dataset [100.39878559382694]
GPT-4's capabilities to solve these problems are unparalleled, achieving an accuracy of 51% with Program-of-Thoughts Prompting.
TheoremQA is curated by domain experts containing 800 high-quality questions covering 350 theorems.
arXiv Detail & Related papers (2023-05-21T17:51:35Z) - Physics in a finite geometry [0.0]
negating the axiom of infinity results in physics acting in a finite geometry where it is ensured that all classical field theories are quantizable.
This paper shows that negating the axiom of infinity results in physics acting in a finite geometry where it is ensured that all classical field theories are quantizable.
arXiv Detail & Related papers (2022-12-06T12:14:08Z) - Quantum teleportation in the commuting operator framework [63.69764116066747]
We present unbiased teleportation schemes for relative commutants $N'cap M$ of a large class of finite-index inclusions $Nsubseteq M$ of tracial von Neumann algebras.
We show that any tight teleportation scheme for $N$ necessarily arises from an orthonormal unitary Pimsner-Popa basis of $M_n(mathbbC)$ over $N'$.
arXiv Detail & Related papers (2022-08-02T00:20:46Z) - Qudit lattice surgery [91.3755431537592]
We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits.
We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.
arXiv Detail & Related papers (2022-04-27T23:41:04Z) - NaturalProofs: Mathematical Theorem Proving in Natural Language [132.99913141409968]
We develop NaturalProofs, a multi-domain corpus of mathematical statements and their proofs.
NaturalProofs unifies broad coverage, deep coverage, and low-resource mathematical sources.
We benchmark strong neural methods on mathematical reference retrieval and generation tasks.
arXiv Detail & Related papers (2021-03-24T03:14:48Z) - Noisy Deductive Reasoning: How Humans Construct Math, and How Math
Constructs Universes [0.5874142059884521]
We present a computational model of mathematical reasoning according to which mathematics is a fundamentally process.
We show that this framework gives a compelling account of several aspects of mathematical practice.
arXiv Detail & Related papers (2020-10-28T19:43:14Z) - A Finitist's Manifesto: Do we need to Reformulate the Foundations of
Mathematics? [1.384477926572109]
This essay is a call for practicing mathematicians who have been sleep-walking in their infinitary paradise take heed.
Much of mathematics relies upon (i) the "existence" of objects that contain an infinite number of elements, (ii) our ability, "in theory", to compute with an arbitrary level of precision, or (iii) our ability, "in theory", to compute for an arbitrarily large number of time steps.
arXiv Detail & Related papers (2020-09-14T14:44:08Z) - Symmetries in Foundation of Quantum Theory and Mathematics [0.0]
We consider finite quantum theory (FQT) where states are elements of a space over a finite ring or field with characteristic $p$ and operators of physical quantities act in this space.
We prove that, with the same approach to symmetry, FQT and finite mathematics are more general than standard quantum theory and classical mathematics.
arXiv Detail & Related papers (2020-03-05T04:46:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.