Documentation

FLT.Assumptions.KnownIn1980s

A tactic for theorems known in the 1980s #

knownin1980s is like sorry -- it can be used to prove an arbitrary theorem.

Usage #

KMB will allow uses of knownin1980s in the FLT repo, but only when it is used to prove a result which he is convinced that he is able to prove on paper using only results which were well-known pre-1990.

An invocation of knownin1980s must always be accompanied by comments which indicate how one might prove this theorem using only results which were in the mathematical literature before 1990. Ideally this is a concrete reference to the pre-1990 literature. However, during this phase of the project, a commented sketck of an argument which is not explicitly in the literature but which is relatively short and uses only techniques known in the 1980s is fine.

Ultimate deprecation of the tactic #

KMB's vision of the evolution of the FLT project is as follows. In this initial stage of evolution, we allow liberal usage of the tactic to justify any proof which was known to humanity pre-1990, ranging from standard results about elliptic curves or modular forms to deep theorems such as the work of Mazur on elliptic curves, Taylor and others on attaching Galois representations to Hilbert modular forms, Langlands on cyclic base change and so on. The first goal of the project should be to get a proof of FLT which is sorry-free but which uses knownin1980s liberally.

After this initial phase, the work will turn to completely removing the use of knownin1980s, replacing it with a much smaller list of mathematical statements (perhaps around ten), each of which will have a clear reference to a pre-1990 statement in the literature and each of which will probably represent a serious formalization challenge.

KMB is optimistic that both of the above phases can be achieved by September 2029, when the EPSRC funding for the proposal runs out. At that point we shall review the status of autoformalization tools and see whether the process can be finished by such tools, or whether more manual work will be required.

axiom knownin1980s {P : Prop} :
P

knownin1980s is a term which provides a proof of an arbitrary proposition. In this current phase of the FLT project, knownin1980s will be allowed as a proof of any theorem which would have been easy for an expert to deduce from the pre-1990 literature. This stretches from standard easy statements about things like elliptic curves to much deeper results which are relatively short derivations from deep results published pre-1990 such as Taylor's theorem attaching Galois representations to Hilbert modular forms, Langlands' work on cyclic base change and so on.

An invocation of knownin1980s should always be accompanied by comments which indicate how one might prove this theorem using only results which were in the mathematical literature before 1990. Note that it does not have to be a precise reference to the literature; an argument which is not explicitly in the literature but which is relatively short and uses only techniques known in the 1980s is fine.

knownin1980s is a term which provides a proof of an arbitrary proposition. In this current phase of the FLT project, knownin1980s will be allowed as a proof of any theorem which would have been easy for an expert to deduce from the pre-1990 literature. This stretches from standard easy statements about things like elliptic curves to much deeper results which are relatively short derivations from deep results published pre-1990 such as Taylor's theorem attaching Galois representations to Hilbert modular forms, Langlands' work on cyclic base change and so on.

An invocation of knownin1980s should always be accompanied by comments which indicate how one might prove this theorem using only results which were in the mathematical literature before 1990. Note that it does not have to be a precise reference to the literature; an argument which is not explicitly in the literature but which is relatively short and uses only techniques known in the 1980s is fine.

Equations
    Instances For