4

I am contemplating the Church-Rosser property and I clearly misunderstand it, but I do not exactly know why. If $x$ and $y$ are such that $x \overset{*}{\leftrightarrow} y$, then $x \overset{*}{\rightarrow} y$ and since $y \overset{*}{\rightarrow} y$, we have that both $x$ and $y$ reduce to $y$ (or $x$, for that matter). So, $x \downarrow y$. I am obviously making a mistake, but where?

$\rightarrow$ is an abstract relation on some set ("reduction"). $\overset{*}{\rightarrow}$ is its reflexive transitive closure, $\overset{*}{\leftrightarrow}$ is the associated reflexive transitive symmetric closure, $\downarrow$ is confluence.

babou
  • 19,445
  • 40
  • 76
Alex M.
  • 145
  • 6
  • Please define the notations $x \overset{}{\leftrightarrow} y$ and $x \downarrow y$, as they're used for several things. (So is $x \overset{}{\rightarrow} y$, for that matter; I presume that you mean that there exists a rewriting sequence from $x$ to $y$, but please confirm.) – Gilles 'SO- stop being evil' Mar 18 '15 at 22:13
  • Well, those who know what the C-R property is about surely understand my question, but here they are: $\rightarrow$ is an abstract relation on some set ("reduction"), $\overset{}{\rightarrow}$ is its reflexive transitive closure, $\overset{}{\leftrightarrow}$ is the associated reflexive transitive symmetric closure, $\downarrow$ is confluence. – Alex M. Mar 18 '15 at 22:21

2 Answers2

3

If $x$ and $y$ are such that $x \leftrightarrow^* y$, then $x \rightarrow^* y$

This is not true in general. It is not even true if $\rightarrow$ is confluent!

For example, consider the lambda calculus with for $\beta$ reduction. $(\lambda x. x) y \rightarrow y$, therefore $(\lambda x. x) y \leftrightarrow^* y$, but it is not the case that $y \rightarrow^* (\lambda x. x) y$ ($y$ does not reduce to any term).


The statement $x \leftrightarrow^* y$ means that there exists a chain of reductions $x \leftarrow \rightarrow \leftarrow \leftarrow \leftarrow \rightarrow \ldots \rightarrow \leftarrow \leftarrow y$, indiscriminately mixing “reduces to” and “reduced from”. This is a lot coarser than the statement that $x$ and $y$ converge, which is usually written $x \rightarrow^* \leftarrow^* y$. A relation is Church-Rosser if for all $x$ and $y$ such that $x \leftrightarrow^* y$, it is the case that $x \rightarrow^* \leftarrow^*$. Church-Rosser means that whenever there is a chain of reductions in arbitrary directions, then there exists another chain of reductions where all the $\rightarrow$ arrows are to the left of all the $\leftarrow$ arrows.


it just seems to me that the reflexive transitive closure of any relation trivially has the C-R property

No. Taking the reflexive transitive closure doesn't help Church-Rosser along. Church-Rosser is in fact a property of the reflexive closure of a relation (if two relations have the same reflexive closure, then one is CR iff the other is) — you can see in the definition that arrows in the same direction are always taken in a group.

For example, a partial order is not in general confluent. Confluence, for a partial order, is the existence of a least upper bound.

cody
  • 8,184
  • 29
  • 62
Gilles 'SO- stop being evil'
  • 43,613
  • 8
  • 118
  • 182
  • Indeed, $\overset{*}{\leftrightarrow}$ means a chain of $\rightarrow$ and $\leftarrow$, with no a priori control on how these arrows are oriented - this is what I had missed on a first reading. – Alex M. Mar 19 '15 at 14:21
1

The mistake in your reasonning is that the reflexive transitive symmetric closure $x \overset{*}{\leftrightarrow} y$ of the relation is neither the relation $x \rightarrow y$ nor its transitive symmetric closure $x \overset{*}{\rightarrow} y$. The transitive closure of a relation is usually a different relation (unless the original relation was already transitive), and the same holds for its reflexive transitive symmetric closure.

You have to prove that if $x \overset{*}{\leftrightarrow} y$ is verified, then there is a $z$ such that $(x \overset{*}{\rightarrow} z) \wedge (y \overset{*}{\rightarrow} z)$, i.e. both $x$ and $y$ must derive $z$, but using only repeatedly the relation $\rightarrow$, i.e. its transitive symmetric closure $\overset{*}{\rightarrow}$.

You cannot use the relation $\rightarrow$ backward as $\overset{*}{\leftrightarrow}$ would permit.

More precisely in your reasonning, you cannot infer from $x \overset{*}{\leftrightarrow} y\;$ that $x \overset{*}{\rightarrow} y$, as you do on the second line of your question.

babou
  • 19,445
  • 40
  • 76