All Projects → math-comp → Abel

math-comp / Abel

Licence: other
A proof of Abel-Ruffini theorem.

Programming Languages

Coq
218 projects
Nix
1067 projects
Makefile
30231 projects

Projects that are alternatives of or similar to Abel

stablesort
Stable sort algorithms and their stability proofs in Coq
Stars: ✭ 19 (-26.92%)
Mutual labels:  coq, ssreflect, mathcomp
autosubst
Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
Stars: ✭ 41 (+57.69%)
Mutual labels:  coq, ssreflect, mathcomp
finmap
Finite sets, finite maps, multisets and generic sets
Stars: ✭ 45 (+73.08%)
Mutual labels:  coq, ssreflect, mathcomp
Actuary
Formalization of the basic actuarial mathematics using Coq
Stars: ✭ 17 (-34.62%)
Mutual labels:  coq, ssreflect, mathcomp
gaia
Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]
Stars: ✭ 15 (-42.31%)
Mutual labels:  coq, ssreflect, mathcomp
multinomials
Multinomials for the Mathematical Components library.
Stars: ✭ 12 (-53.85%)
Mutual labels:  coq, ssreflect, mathcomp
odd-order
The formal proof of the Odd Order Theorem
Stars: ✭ 20 (-23.08%)
Mutual labels:  coq, ssreflect, mathcomp
coqeal
The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
Stars: ✭ 62 (+138.46%)
Mutual labels:  coq, mathcomp
fm-notes
Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
Stars: ✭ 19 (-26.92%)
Mutual labels:  coq
LibHyps
A Coq library providing tactics to deal with hypothesis
Stars: ✭ 14 (-46.15%)
Mutual labels:  coq
alea
Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]
Stars: ✭ 20 (-23.08%)
Mutual labels:  coq
mcoq
Mutation analysis tool for Coq verification projects
Stars: ✭ 22 (-15.38%)
Mutual labels:  coq
vericert
A formally verified high-level synthesis tool based on CompCert and written in Coq.
Stars: ✭ 63 (+142.31%)
Mutual labels:  coq
rupicola
Gallina to Bedrock2 compilation toolkit
Stars: ✭ 41 (+57.69%)
Mutual labels:  coq
ltac2-tutorial
Ltac2 tutorial
Stars: ✭ 27 (+3.85%)
Mutual labels:  coq
fcsl-pcm
Partial Commutative Monoids
Stars: ✭ 20 (-23.08%)
Mutual labels:  coq
chapar
A framework for verification of causal consistency for distributed key-value stores and their clients in Coq [maintainer=@palmskog]
Stars: ✭ 29 (+11.54%)
Mutual labels:  coq
MtacAR
Mtac in Agda
Stars: ✭ 29 (+11.54%)
Mutual labels:  coq
FreeSpec
A framework for implementing and certifying impure computations in Coq
Stars: ✭ 48 (+84.62%)
Mutual labels:  coq
coq-art
Coq code and exercises from the Coq'Art book [maintainers=@ybertot,@Casteran]
Stars: ✭ 57 (+119.23%)
Mutual labels:  coq

Abel - Ruffini Theorem as a Mathematical Component

Docker CI

This repository contains a proof of Abel - Galois Theorem (equivalence between being solvable by radicals and having a solvable Galois group) and Abel - Ruffini Theorem (unsolvability of quintic equations) in the Coq proof-assistant and using the Mathematical Components library.

Meta

Building and installation instructions

The easiest way to install the latest released version of Abel - Ruffini Theorem as a Mathematical Component is via OPAM:

opam repo add coq-released https://coq.inria.fr/opam/released
opam install coq-mathcomp-abel

To instead build and install manually, do:

git clone https://github.com/math-comp/abel.git
cd abel
make   # or make -j <number-of-cores-on-your-machine> 
make install

Organization of the code

  • abel.v itself contains the main theorems:

    • galois_solvable_by_radical (requires explicit roots of unity),
    • ext_solvable_by_radical (equivalent, and still requires roots of unity),
    • radical_solvable_ext (no mention of roots of unity),
    • AbelGalois, (equivalence obtained from the above two, requires roots of unity), and consequences on solvability of polynomial
    • and their consequence on the example polynomial X⁵ -4X + 2: example_not_solvable_by_radicals,
  • xmathcomp/various.v contains various (rather straightforward) extensions that should be added to various mathcomp packages asap with potential minor modifications,

  • xmathcomp/char0.v contains 0 characteristic specific results, that could use a refactoring for a smoother integration with mathcomp. e.g. ratr could get a canonical structure or rmorphism when the target field is a lmodType ratr, and we could provide a wrapperNullCharType akin to PrimeCharType (from finfield.v),

  • xmathcomp/cyclotomic.v contains complementary results about cyclotomic polynomials,

  • xmathcomp/map_gal.v contains complementary results about galois groups and galois extensions, including various isomorphisms, minimal galois extensions, solvable extensions, and mapping galois groups and galois extensions from a splitting field to another. This last construction is essential in switching to fields with roots of unity when we do not have them yet,

  • xmathcomp/classic_ext.v contains the theory of classic extensions by arbitrary polynomials, most of the results there are in the classically monad, making the results available either for a boolean goal or a classical goal. This was instrumental in eliminating references to some embarrassing roots of the unity.

  • xmathcomp/algR.v contains a proof that the real subset of algC (isomorphic to {x : algC | x \is Num.real}) is a real closed field (and archimedean), and endows this type algR with appropriate canonical instances.

  • xmathcomp/real_closed_ext.v contains some missing lemmas from the library math-comp/real_closed, in particular bounding the number of real roots of a polynomial by one plus the number of real roots of its derivative,

Development information

Developping with nix

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].