Documentation

equational_theories.Subgraph

Dual to Problem A1 from Putnam 2001

This implication is Problem A1 from Putnam 2001

The below results for Equation1571 are out of order because early ones are lemmas for later ones

theorem Subgraph.ProveEquation1571Consequence {n : } {G : Type u_1} [Magma G] (eq1571 : Equation1571 G) (law : Law.MagmaLaw (Fin (n + 1))) (eq : equation1571Reducer law.lhs = equation1571Reducer law.rhs) :
G law
@[reducible, inline]
abbrev Subgraph.Eq1689.pow3 {G : Type u_1} [Magma G] (a : G) :
G
Equations
Instances For
    @[reducible, inline]
    abbrev Subgraph.Eq1689.pow5 {G : Type u_1} [Magma G] (a : G) :
    G
    Equations
    Instances For
      @[reducible, inline]
      abbrev Subgraph.Eq1689.f {G : Type u_1} [Magma G] (a b : G) :
      G
      Equations
      Instances For
        @[reducible, inline]
        abbrev Subgraph.Eq1689.g {G : Type u_1} [Magma G] (a b : G) :
        G
        Equations
        Instances For
          theorem Subgraph.Eq1689.lem_fixf_implies_eq2 {G : Type u_1} [Magma G] (h : Equation1689 G) (hfixf : ∀ (b : G), ∃ (c : G), f b c = b) :
          theorem Subgraph.Eq1689.lem_1 {G : Type u_1} [Magma G] (h : Equation1689 G) (a b c : G) :
          a f (f a b) c = f a b
          theorem Subgraph.Eq1689.lem_2 {G : Type u_1} [Magma G] (h : Equation1689 G) (a b c : G) :
          a g b c = f a b
          theorem Subgraph.Eq1689.lem_fixf {G : Type u_1} [Magma G] (h : Equation1689 G) (a : G) :
          ∃ (b : G), f a b = a

          This result was first obtained by Kisielewicz in 1997 via computer assistance.

          Putnam 1978, problem A4, part (b)

          Putnam 1978, problem A4, part (a)

          The Bol loop and Moufang loop identities are all weakenings of t

          inductive Subgraph.Th :
          Instances For
            theorem Subgraph.add3 (a b c : Th) :
            add (add a b) c = Th.t3
            theorem Subgraph.add3_ (a b c : Th) :
            add a (add b c) = Th.t3