Require Import Classes.interfaces.canonical_names.
[Loading ML file number_string_notation_plugin.cmxs (using legacy method) ... done]
Require Import Algebra.AbGroups.
Require Import Algebra.Rings.CRing.
Require Import Spaces.Int Spaces.Pos.
Require Import WildCat.Core.

(** * In this file we define the ring [cring_Z] of integers with underlying abelian group [abgroup_Z] defined in Algebra.AbGroups.Z. We also define multiplication by an integer in a general ring, and show that [cring_Z] is initial. *)

(** The ring of integers *)
Definition cring_Z : CRing.
CRing
Proof.
CRing
  snapply Build_CRing'.
AbGroup
One ?R
Mult ?R
Commutative mult
Associative mult
LeftDistribute mult plus
LeftIdentity mult 1
  -
AbGroup exact abgroup_Z.
  -
One abgroup_Z exact 1%int.
  -
Mult abgroup_Z exact int_mul.
  -
Commutative mult exact int_mul_comm.
  -
Associative mult exact int_mul_assoc.
  -
LeftDistribute mult plus exact int_dist_l.
  -
LeftIdentity mult 1 exact int_mul_1_l.
Defined.

Local Open Scope mc_scope.

(** Given a ring element [r], we get a map [Int -> R] sending an integer to that multiple of [r]. *)
Definition rng_int_mult (R : Ring) := grp_pow_homo : R -> Int -> R.

(** Multiplying a ring element [r] by an integer [n] is equivalent to first multiplying the unit [1] of the ring by [n], and then multiplying the result by [r].  This is distributivity of right multiplication by [r] over the sum. *)
Definition rng_int_mult_dist_r {R : Ring} (r : R) (n : cring_Z)
  : rng_int_mult R r n = (rng_int_mult R 1 n) * r.
R: Ring
r: R
n: cring_Z
rng_int_mult R r n = rng_int_mult R 1 n * r
Proof.
R: Ring
r: R
n: cring_Z
rng_int_mult R r n = rng_int_mult R 1 n * r
  cbn.
R: Ring
r: R
n: cring_Z
grp_pow r n = grp_pow 1 n * r
  rhs napply (grp_pow_natural (grp_homo_rng_right_mult r)); cbn.
R: Ring
r: R
n: cring_Z
grp_pow r n = grp_pow (1 * r) n
  by rewrite rng_mult_one_l.
Defined.

(** Similarly, there is a left-distributive law. *)
Definition rng_int_mult_dist_l {R : Ring} (r : R) (n : cring_Z)
  : rng_int_mult R r n = r * (rng_int_mult R 1 n).
R: Ring
r: R
n: cring_Z
rng_int_mult R r n = r * rng_int_mult R 1 n
Proof.
R: Ring
r: R
n: cring_Z
rng_int_mult R r n = r * rng_int_mult R 1 n
  cbn.
R: Ring
r: R
n: cring_Z
grp_pow r n = r * grp_pow 1 n
  rhs napply (grp_pow_natural (grp_homo_rng_left_mult r)); cbn.
R: Ring
r: R
n: cring_Z
grp_pow r n = grp_pow (r * 1) n
  by rewrite rng_mult_one_r.
Defined.

(** [rng_int_mult R 1] preserves multiplication.  This requires that the specified ring element is the unit. *)
Instance issemigrouppreserving_mult_rng_int_mult (R : Ring)
  : IsSemiGroupPreserving (A:=cring_Z) (Aop:=(.*.)) (Bop:=(.*.)) (rng_int_mult R 1).
R: Ring
IsSemiGroupPreserving (rng_int_mult R 1)
Proof.
R: Ring
IsSemiGroupPreserving (rng_int_mult R 1)
  intros x y.
R: Ring
x, y: cring_Z
rng_int_mult R 1 (sg_op x y) =
sg_op (rng_int_mult R 1 x) (rng_int_mult R 1 y)
  cbn; unfold sg_op.
R: Ring
x, y: cring_Z
grp_pow 1 (x * y)%int = grp_pow 1 x * grp_pow 1 y
  lhs napply grp_pow_int_mul.
R: Ring
x, y: cring_Z
grp_pow (grp_pow 1 x) y = grp_pow 1 x * grp_pow 1 y
  napply rng_int_mult_dist_l.
Defined.

(** [rng_int_mult R 1] is a ring homomorphism *)
Definition rng_homo_int (R : Ring) : (cring_Z : Ring) $-> R.
R: Ring
(cring_Z : Ring) $-> R
Proof.
R: Ring
(cring_Z : Ring) $-> R
  snapply Build_RingHomomorphism.
R: Ring
cring_Z -> R
R: Ring
abstract_algebra.IsSemiRingPreserving ?rng_homo_map
  1: exact (rng_int_mult R 1).
R: Ring
abstract_algebra.IsSemiRingPreserving
  (rng_int_mult R 1)
  repeat split.
R: Ring
IsSemiGroupPreserving (rng_int_mult R 1)
R: Ring
IsSemiGroupPreserving (rng_int_mult R 1)
R: Ring
IsUnitPreserving (rng_int_mult R 1)
  1,2: exact _.
R: Ring
IsUnitPreserving (rng_int_mult R 1)
  apply rng_plus_zero_r.
Defined.

(** The integers are the initial commutative ring *)
Instance isinitial_cring_Z : IsInitial cring_Z.
IsInitial cring_Z
Proof.
IsInitial cring_Z
  unfold IsInitial.
forall y : CRing,
{f : cring_Z $-> y &
forall g : cring_Z $-> y, f $== g}
  intro R.
R: CRing
{f : cring_Z $-> R &
forall g : cring_Z $-> R, f $== g}
  exists (rng_homo_int R).
R: CRing
forall g : cring_Z $-> R, rng_homo_int R $== g
  intros g x.
R: CRing
g: cring_Z $-> R
x: cring_Z
rng_homo_int R x = g x
  unfold rng_homo_int, rng_int_mult; cbn.
R: CRing
g: cring_Z $-> R
x: cring_Z
grp_pow 1 x = g x
  induction x as [|x|x].
R: CRing
g: cring_Z $-> R
grp_pow 1 0%int = g 0%int
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 x = g x
grp_pow 1 x.+1%int = g x.+1%int
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 (- x)%int = g (- x)%int
grp_pow 1 (- x).-1%int = g (- x).-1%int
  -
R: CRing
g: cring_Z $-> R
grp_pow 1 0%int = g 0%int by rhs exact (grp_homo_unit g).
  -
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 x = g x
grp_pow 1 x.+1%int = g x.+1%int rewrite grp_pow_succ.
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 x = g x
sg_op 1 (grp_pow 1 x) = g x.+1%int
    change (x.+1%int) with (1 + x)%int.
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 x = g x
sg_op 1 (grp_pow 1 x) = g (1 + x)%int
    rewrite (rng_homo_plus g 1 x).
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 x = g x
sg_op 1 (grp_pow 1 x) = g 1 + g x
    rewrite rng_homo_one.
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 x = g x
sg_op 1 (grp_pow 1 x) = 1 + g x
    f_ap.
  -
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 (- x)%int = g (- x)%int
grp_pow 1 (- x).-1%int = g (- x).-1%int rewrite grp_pow_pred.
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 (- x)%int = g (- x)%int
sg_op (inv 1) (grp_pow 1 (- x)%int) = g (- x).-1%int
    rewrite IHx.
R: CRing
g: cring_Z $-> R
x: nat
IHx: grp_pow 1 (- x)%int = g (- x)%int
sg_op (inv 1) (g (- x)%int) = g (- x).-1%int
    clear IHx.
R: CRing
g: cring_Z $-> R
x: nat
sg_op (inv 1) (g (- x)%int) = g (- x).-1%int
    change (-1 + g (-x)%int = g (-x).-1%int).
R: CRing
g: cring_Z $-> R
x: nat
-1 + g (- x)%int = g (- x).-1%int
    rewrite <- (rng_homo_minus_one g).
R: CRing
g: cring_Z $-> R
x: nat
g (-1) + g (- x)%int = g (- x).-1%int
    lhs_V napply (rng_homo_plus g).
R: CRing
g: cring_Z $-> R
x: nat
g (-1 + (- x)%int) = g (- x).-1%int
    f_ap.
Defined.