Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Prove associativity of composition of relations

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Prove associativity of composition of relations


Chronological Thread 
  • From: scott constable <sdconsta AT syr.edu>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Prove associativity of composition of relations
  • Date: Wed, 11 May 2016 13:52:49 -0400
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=sdconsta AT syr.edu; spf=None smtp.mailfrom=sdconsta AT syr.edu; spf=None smtp.helo=postmaster AT smtp1.syr.edu
  • Ironport-phdr: 9a23:hIX2eBU0s9OP/bASx9BkQhdKJDbV8LGtZVwlr6E/grcLSJyIuqrYZheAt8tkgFKBZ4jH8fUM07OQ6PCxHzVeqs/Z7jgrS99laVwssY0uhQsuAcqIWwXQDcXBSGgEJvlET0Jv5HqhMEJYS47UblzWpWCuv3ZJQk2sfTR8Kum9IIPOlcP/j7n0oM2CJVwWz2PlP/tbF1afk0b4joEum4xsK6I8mFPig0BjXKBo/15uPk+ZhB3m5829r9ZJ+iVUvO89pYYbCf2pN/dwcbsNBzM/dmsx+cfDtB/ZTALJ6GFPfH8Rl09TCA/Z8FnxWZHqriLwsuc1jDKWNsrwVqw9cS+z9eFmRAK+23RPDCIw7GyC0p84t6lcuh/0/xE=

Fabian,

I also think you are correct that proving equality would require additional axioms. I don't have a problem with adding additional axioms; it would be useful to know which axiom(s) would be required to prove equality.

~Scott

On Wed, May 11, 2016 at 1:10 PM, Fabian Kunze <fkunze AT fakusb.de> wrote:

Hello Scott,

I'm pretty sure that, without additional axioms, you will just be able to prove "<->" instead of equality, e. g. "P ∘ Q ∘ R <-> (P ∘ Q) ∘ R."

Does this suffice?

Best,
Fabian


scott constable <sdconsta AT syr.edu> schrieb am Mi., 11. Mai 2016 19:07:
Correction: "I think it should be possible to prove associativity of my definition of composition"...

On Wed, May 11, 2016 at 1:06 PM, scott constable <sdconsta AT syr.edu> wrote:
Thanks for the quick response Frédéric, but I already have a large project which relies heavily on my definition of composition, and the CoLoR library uses a different definition of composition. Hence I would have to rework a lot of my project to fit the CoLoR definition. I think it should be possible to prove associativity of my definition of relation in Coq, and I would like to know how to do so.

~Scott

On Wed, May 11, 2016 at 1:00 PM, Frédéric Blanqui <frederic.blanqui AT inria.fr> wrote:
Hello. You will find useful developments on relations in CoLoR.Util.RelUtil.v (coq-color on opam). See http://color.inria.fr/doc/CoLoR.Util.Relation.RelUtil.html for the definitions and theorems without the proofs. Best regards, Frédéric.


Le 11/05/2016 18:51, scott constable a écrit :
Hi All,

I have the following definition of composition:

Inductive Compose : T → V → Prop :=
| comp_intro : ∀ x y z, R1 x y → R2 y z → Compose x z.

Notation "P ∘ R" := (Compose R P) (at level 55, right associativity).

And I am hopelessly lost as to how to prove this theorem:

Lemma compose_assoc : ∀ (R : U → V → Prop) (Q : V → T → Prop)
                          (P : T → W → Prop), P ∘ Q ∘ R = (P ∘ Q) ∘ R.

Any help would be extremely appreciated!

Thanks in advance,

~Scott Constable







Archive powered by MHonArc 2.6.18.

Top of Page