Algebra --- Classical Algebra, using Explicit Structures and Locales

This directory contains proofs in classical algebra. It is intended as a base for any algebraic development in Isabelle. Emphasis is on reusability. This is achieved by modelling algebraic structures as first-class citizens of the logic (not axiomatic type classes, say). The library is expected to grow in future releases of Isabelle. Contributions are welcome.

GroupTheory, including Sylow's Theorem

These proofs are mainly by Florian Kammüller. (Later, Larry Paulson simplified some of the proofs.) These theories were indeed the original motivation for locales. Here is an outline of the directory's contents:

Rings and Polynomials

Legacy Development of Rings using Axiomatic Type Classes

This development of univariate polynomials is separated into an abstract development of rings and the development of polynomials itself. The formalisation is based on [Jacobson1985], and polynomials have a sparse, mathematical representation. These theories were developed as a base for the integration of a computer algebra system to Isabelle [Ballarin1999], and was designed to match implementations of these domains in some typed computer algebra systems. Summary:

Rings: Classes of rings are represented by axiomatic type classes. The following are available:

  ring:		Commutative rings with one (including a summation
		operator, which is needed for the polynomials)
  domain:	Integral domains
  factorial:	Factorial domains (divisor chain condition is missing)
  pid:		Principal ideal domains
  field:	Fields
Also, some facts about ring homomorphisms and ideals are mechanised.

Polynomials: Polynomials have a natural, mathematical representation. Facts about the following topics are provided:

  • Degree function
  • Universal Property, evaluation homomorphism
  • Long division (existence and uniqueness)
  • Polynomials over a ring form a ring
  • Polynomials over an integral domain form an integral domain
  • [Jacobson1985] Nathan Jacobson, Basic Algebra I, Freeman, 1985.

    [Ballarin1999] Clemens Ballarin, Computer Algebra and Theorem Proving, Author's PhD thesis, 1999.


    Last modified on $Date$

    Clemens Ballarin.