Questions tagged [proof-assistants]

A proof assistant is software used for creating and checking formal proofs; examples include Coq and HOL. This tag is not to be used for requesting assistance on finding proofs. General questions about proof assistants can also be asked on the Proof Assistants Stack Exchange site.

Filter by
Sorted by
Tagged with
3 votes
0 answers
185 views

Conversion of proofs between HoTT and ZFC

HoTT provides a foundation of math that remains mysterious for many mathematicians including me. Hence this question. There are several implementations of math based on ZFC, an example being MetaMath. ...
user avatar
  • 4,005
7 votes
0 answers
369 views

Theorem proving in Lean, for areas that aren't quite ready for it

While taking a break from being stuck, I have found myself addicted to playing with the Lean Theorem Prover. (Beware, if you visit this link might you might find yourself hooked...) Playing with this ...
user avatar
  • 6,705
3 votes
1 answer
221 views

Checking elementary proofs with proof checkers

I am not sure if this is the right place to post this, but I have seen discussions related to proof checking here, so let me post it. If there is better place for it, please give me a hint as to where ...
user avatar
  • 888
0 votes
0 answers
174 views

Can ∞-category be defined in proof assistants?

Can ∞-category be defined in proof assistants? For example, we can directly consider a function such as ...
user avatar
  • 281
67 votes
11 answers
8k views

The use of computers leading to major mathematical advances II

I would like to ask about recent examples, mainly after 2015, where experimentation by computers or other use of computers has led to major mathematical advances. This is a continuation of a question ...
16 votes
1 answer
825 views

Available frameworks for homotopy type theory

I am thinking about trying to formalise some parts of classical unstable homotopy theory in homotopy type theory, especially the EHP and Toda fibrations, and some related work of Gray, Anick and Cohen-...
user avatar
6 votes
0 answers
343 views

Proof of Tennenbaum's Theorem by McCarty

Tennenbaum's Theorem in its usual form states that for any countable non-standard model $M$ of PA there is no way to code the elements of $M$ as natural numbers such that either the addition or ...
user avatar
  • 191
3 votes
1 answer
375 views

Can Tychonoff's theorem be applied to topological spaces generated by program output in ZFC?

I am confused about an issue in set theory. Tychonoff's theorem says that "an arbitrary product of compact topological spaces is compact". We often talk of an index set $I$ and then for each ...
user avatar
29 votes
4 answers
3k views

What is the endgoal of formalising mathematics?

Recently, I've become interested in proof assistants such as Lean, Coq, Isabelle, and the drive from many mathematicians (Kevin Buzzard, Tom Hales, Metamath, etc) to formalise all of mathematics in ...
137 votes
5 answers
22k views

What makes dependent type theory more suitable than set theory for proof assistants?

In his talk, The Future of Mathematics, Dr. Kevin Buzzard states that Lean is the only existing proof assistant suitable for formalizing all of math. In the Q&A part of the talk (at 1:00:00) he ...
user avatar
  • 1,447
5 votes
1 answer
158 views

Information density of proofs?

I am a CS person so please excuse the hand-waving. Given a set of machine-represented proofs, each different (but not necessarily proving a different thing), what sort of information-theoretic ...
user avatar
10 votes
2 answers
704 views

Gödel's ontological proof & Benzmüller's work

For a decade or so, Christoph Benzmüller from Berlin has explored Gödel's ontological proof (and variants) of existence of God. He uses the proof assistant Isabelle/HOL. He recently posted a preprint, ...
user avatar
  • 47.1k
3 votes
1 answer
605 views

Data abstraction in set theory via Urelements

I am working in a setting of set theory where set theory is embedded in simply-typed higher-order logic, basically as described for example in Chad E. Brown and Cezary Kaliszyk and Karol Pak (2019) ...
user avatar
-3 votes
1 answer
417 views

PCP theorem to check hard proofs [closed]

Is it technically possible to check formidable proofs like Mochizuki's using PCP theorem before mathematicians spend time in understanding the mechanics of the proof? If so why have mathematicians not ...
user avatar
  • 1,708
97 votes
2 answers
9k views

Extent of “unscientific”, and of wrong, papers in research mathematics

This question is cross-posted from academia.stackexchange.com where it got closed with the advice of posting it on MO. Kevin Buzzard's slides (PDF version) at a recent conference have really ...
0 votes
0 answers
367 views

Artificial intelligence simulating mathematicians (what a distopia!)

This is kind of soft and naive question, so feel free to shame on me :) I start from the fact that, in my opinion, what humans are interested in about mathematics are things that we find deep and ...
user avatar
13 votes
2 answers
1k views

How does proof assistant organize knowledge?

I am reading a paper Ittay Weiss, The QED Manifesto after Two Decades — Version 2.0, Journal of Software, 11 no. 8 (2016) pp. 803–815, doi:10.17706/jsw.11.8.803-815 The paper says Goal 7: ...
user avatar
  • 131
50 votes
2 answers
4k views

Automatically solving olympiad geometry problems

Warning: I am only an amateur in the foundations of mathematics. My understanding of this Wikipedia page about Tarski's axiomatization of plane geometry (and especially the discussion about ...
user avatar
34 votes
1 answer
1k views

Real manifolds in a theorem prover?

Which of the formal computer proof verification systems (like Lean, Coq, Agda, Idris, Isabelle-HOL, HOL-Light, Mizar etc) have a basic theory of real manifolds? Up to, say, the definition of a smooth ...
user avatar
6 votes
3 answers
2k views

The Lucas argument vs the theorem-provers -- who wins and why?

In his paper, "Minds, Machines and Gödel", J.R. Lucas writes the following: Gödel's theorem [First Incompleteness Theorem, that is—my comment] must apply to cybernetic machines, because it is of ...
user avatar
3 votes
4 answers
1k views

A complete formalization of EGA in Lean

I have been lately thinking about the feasibility of creating a "mediocre algebraic geometer" AI. I thought that to train it, one could feed it some large chunks of algebraic geometry presented in an ...
user avatar
45 votes
2 answers
4k views

On proof-verification using Coq

So i recently learnt that there is now a certain software called ''Coq'' by which one can check the validity of mathematical proofs. My questions are: Are there limitations on the kinds of proofs ...
user avatar
131 votes
28 answers
15k views

Which mathematical definitions should be formalised in Lean?

The question. Which mathematical objects would you like to see formally defined in the Lean Theorem Prover? Examples. In the current stable version of the Lean Theorem Prover, topological groups ...
8 votes
1 answer
231 views

Creativity and the mechanization of elementary geometry

In plane geometry, it is customary to say that checking proofs is a mechanical process but that finding new theorems is a creative activity. Citing J. Hadamard, "logic only sanctions the conquests of ...
user avatar
  • 17k
8 votes
1 answer
317 views

Automated geometry theorem provers

What is the state of the art concerning automated geometry theorem provers (AGTP)? I can see that a few computer algebra softwares and dynamic geometry softwares (e.g. geogebra) have embedded provers ...
user avatar
  • 17k
32 votes
1 answer
640 views

Proof assistant for working in weaker foundations?

In some of my works I need to prove some results within the internal logic of categories with not much structures (like pretoposes or even just categories with finite limits). The kind of things I ...
user avatar
  • 32.2k
19 votes
1 answer
748 views

Proof assistant, Cura te ipsum

By a bona fide bug in a proof assistant I mean a software flaw which is serious enough to create a possibility of "proving" something which is actually false. This is not a purely ...
user avatar
150 votes
6 answers
15k views

Proofs shown to be wrong after formalization with proof assistant

Are there examples of originally widely accepted proofs that were later discovered to be wrong by attempting to formalize them using a proof assistant (e.g. Coq, Agda, Lean, Isabelle, HOL, Metamath, ...
38 votes
4 answers
2k views

Is there research on human-oriented theorem proving?

I know there is already a research community that is working on automatic theorem proving mostly using logic (and things like Coq and ACL2). However, I came across a lecture from a fields medalist W.T....
user avatar
5 votes
0 answers
258 views

formalization of coordinate-free linear algebra in a proof assistant

I am aware of projects that formalize linear algebra in existing proof assistants (i.e. Coq), but it seems like most of them are based on matrices. I was wondering if it's done in a coordinate-free ...
user avatar
  • 151
6 votes
1 answer
460 views

Are there any recent advances in formalizing the undecidability of $\mathit{CH}$?

The website Formalizing 100 Theorems by Freek Wiedijk contains a list of some theorems that were chosen at some point as good candidates for formalization (because of their complexity, their ...
user avatar
16 votes
1 answer
2k views

Axioms of Choice in constructive mathematics

There is a widely accepted opinion that the Axiom of Countable Choice (further, ACC) $$ \forall n\in \mathbb{N} . \exists x \in X . \varphi [n, x] \implies \exists f: \mathbb{N} \longrightarrow X . \...
user avatar
25 votes
0 answers
832 views

Where to submit this work with several unusual features?

I appreciate that questions about where to submit are generally considered off-topic, but I hope that the unusual features of the present case may make it acceptable. I have put a monograph on github ...
user avatar
37 votes
1 answer
4k views

How much mathematics has been formally verified?

That's a vague question so allow me to tighten it up a bit. I recently noticed that there is a formal machine verified proof of the Central Limit Theorem (CLT) implemented with Isabelle. This ...
user avatar
  • 7,495
13 votes
3 answers
2k views

Is there research on Machine Learning techniques to discover conjectures (theorems) in a wide range of mathematics beyond mathematical logic?

Although there already exists active research area, so-called, automated theorem proving, mostly work on logic and elementary geometry. Rather than only logic and elementary geometry, are there ...
user avatar
14 votes
3 answers
1k views

Algorithmic complexity of formal proof verification?

In this question, suppose $S$ is some popular real-world automated proof system that is stronger than or equivalent to Peano Arithmetic. I would be happy with a positive answer to the following for ...
user avatar
3 votes
1 answer
61 views

Determine a sign of the limitation of a certain integral

I can't determine a sign of an integral written below and it has hit a dead end. My setting is rather special. Let $a\in(0,1)$ be a given constant and $(x_{\varepsilon},y_{\varepsilon})\in[0,a)\times[...
user avatar
  • 201
1 vote
0 answers
197 views

Complexity of reordering a matrix which consists independent sub matrices

Introduction: Given a matrix A of a $k$ regular graph G. The matrix A can be divided into 4 sub matrices based on adjacency of vertex $x \in G$. $A_x$ is the symmetric matrix of the graph $(G-x)$, ...
user avatar
  • 257
23 votes
3 answers
1k views

What technical and/or theoretical challenges are involved in automatically extracting proofs from books and papers into Coq code?

Over the years, advances in machine learning has allowed us to communicate and interact, using the same natural language, more and more semantically with computers, e.g. Google, Siri, Watson, etc. On ...
4 votes
1 answer
829 views

Set-theoretic tautologies

Let us consider unquantifed formulas of a set theory (for example, NBG), more precisely, the formulas, constructed from variables and the constants $\emptyset, V$ (the empty set and the class of all ...
user avatar
15 votes
4 answers
2k views

Does formalizing math require search and creativity, or is it near-mechanical?

I remember reading somewhere that it takes about a week to convert a page of math into something a proof-assistant like Isabelle or HOL Light would accept. Is this type of conversion something that ...
51 votes
3 answers
5k views

Function extensionality: does it make a difference? why would one keep it out of the axioms?

Yesterday I was shocked to discover that function extensionality (the statement that if two functions $f$ and $g$ on the same domain satisfy $f\left(x\right) = g\left(x\right)$ for all $x$ in the ...
user avatar
80 votes
4 answers
7k views

Wanted: a "Coq for the working mathematician"

Sorry for a possibly off-topic question -- there are four StackExchange subs each of which could be construed as the proper place for this question, and I've just picked the one I'm most familiar with....
user avatar
40 votes
35 answers
5k views

Formalizations of category theory in proof assistants

What are the existing formalizations of category theory in proof assistants? I'm primarily interested in public-domain code implementing category theory in a proof assistant (Coq, Agda, Isabelle/HOL, ...
21 votes
2 answers
3k views

At which level is it currently possible to write formal proofs?

I am wondering whether I should try to have some fun using proof systems. I have never used such a system, but I have some experiences in logic and programming. My question is: At which level of ...
user avatar
  • 2,364
0 votes
1 answer
508 views

prod and sig in COQ

Hello, Apparently in COQ the type prod (with one constructor pair) corresponds to cartesian product and the type sig (with one constructor exist) to dependent sum but how is described the fact that ...
user avatar
2 votes
2 answers
881 views

How to interpret conflicting formal proofs about "a mod 0 = ? "

The proof assistants Coq and Isabelle give conflicting formal proofs about $a \mod 0 \qquad \forall a \in \mathbb{Z}$. According to Coq $$ a \mod 0 = 0$$ and Isabelle proves $$ a \mod = a$$ ...
user avatar
  • 23.3k
5 votes
0 answers
3k views

Why should I trust Coq when assumption-free proof of False in Coq exists? [closed]

Damien Pous announced code for assumption-free proof of False in Coq which means inconsistency in Coq (without using exploits, lol). Damien is critical of "fully certified decision procedure ...
user avatar
  • 23.3k
52 votes
7 answers
10k views

How true are theorems proved by Coq?

Less tongue in cheek, is it known what the relative consistency is for theorems proved with an automatic theorem prover? Of course this depends somewhat on what assumptions one makes with respect to ...
user avatar
3 votes
1 answer
1k views

Proving inequalities over algebraic structures

I've been looking at proof techniques in formal systems like Coq and Agda recently, and encountered the newring tactic described here for proving equalities over ...
user avatar
  • 177