wip merge complex - a fix

[topbloke-formulae.git] / article.tex

diff --git a/article.tex b/article.tex
index 023a18a9340c7670e3ee89011177eb9010165e69..b97f7bb606db5b814b129ec5561dc39ef6c62042 100644 (file)
--- a/article.tex
+++ b/article.tex
@@ -81,7 +81,8 @@
 \newcommand{\Largenexists}{\mathop{\hbox{\Large$\nexists$}}}
 
 \newcommand{\qed}{\square}
-\newcommand{\proof}[1]{{\it Proof.} #1 $\qed$}
+\newcommand{\proofstarts}{{\it Proof:}}
+\newcommand{\proof}[1]{\proofstarts #1 $\qed$}
 
 \newcommand{\gathbegin}{\begin{gather} \tag*{}}
 \newcommand{\gathnext}{\\ \tag*{}}
@@ -262,7 +263,7 @@ XXX proof TBD.
 
 \subsection{No Replay for Merge Results}
 
-If we are constructing $C$, given
+If we are constructing $C$, with,
 \gathbegin
   \mergeof{C}{L}{M}{R}
 \gathnext
@@ -270,7 +271,7 @@ If we are constructing $C$, given
 \gathnext
   R \le C
 \end{gather}
-No Replay is preserved.  {\it Proof:}
+No Replay is preserved.  \proofstarts
 
 \subsubsection{For $D=C$:} $D \isin C, D \le C$.  OK.
 
@@ -424,7 +425,7 @@ Merge Results applies. $\qed$
 \subsection{Desired Contents}
 
 \[ D \isin C \equiv [ D \notin \pry \land D \isin L ] \lor D = C \]
-{\it Proof.}
+\proofstarts
 
 \subsubsection{For $D = C$:}
 
@@ -473,6 +474,7 @@ Merge commits $L$ and $R$ using merge base $M$ ($M < L, M < R$):
 \gathnext
  \mergeof{C}{L}{M}{R}
 \end{gather}
+We will occasionally use $X,Y$ s.t. $\{X,Y\} = \{L,R\}$.
 
 \subsection{Conditions}
 
@@ -486,6 +488,13 @@ Merge commits $L$ and $R$ using merge base $M$ ($M < L, M < R$):
       \text{otherwise} : & \false
    \end{cases}
 }\]
+\[ \eqn{ Merge Ends }{
+    X \not\haspatch \p \land
+    Y \haspatch \p \land
+    E \in \pendsof{X}{\py}
+  \implies
+    E \le Y
+}\]
 
 \subsection{No Replay}
 
@@ -527,8 +536,59 @@ $\qed$
 
 \subsection{Coherence and patch inclusion}
 
-xxx tbd
+Need to determine $C \haspatch \p$ based on $L,M,R \haspatch \p$.
+This involves considering $D \in \py$.  
+
+\subsubsection{For $L \nothaspatch \p, R \nothaspatch \p$:}
+$D \not\isin L \land D \not\isin R$.  $C \not\in \py$ (otherwise $L
+\in \py$ ie $L \haspatch \p$ by Tip Self Inpatch).  So $D \neq C$.
+Applying $\merge$ gives $D \not\isin C$ i.e. $C \nothaspatch \p$.
+
+\subsubsection{For $L \haspatch \p, R \haspatch \p$:}
+$D \isin L \equiv D \le L$ and $D \isin R \equiv D \le R$.
+(Likewise $D \isin X \equiv D \le X$ and $D \isin Y \equiv D \le Y$.)
+
+Consider $D = C$: $D \isin C$, $D \le C$, OK for $C \haspatch \p$.
+
+For $D \neq C$: $D \le C \equiv D \le L \lor D \le R
+ \equiv D \isin L \lor D \isin R$.  
+(Likewise $D \le C \equiv D \le X \lor D \le Y$.)
+
+Consider $D \neq C, D \isin X \land D \isin Y$:
+By $\merge$, $D \isin C$.  Also $D \le X$ 
+so $D \le C$.  OK for $C \haspatch \p$.
+
+Consider $D \neq C, D \not\isin X \land D \not\isin Y$:
+By $\merge$, $D \not\isin C$.  
+And $D \not\le X \land D \not\le Y$ so $D \not\le C$.  
+OK for $C \haspatch \p$.
+
+Remaining case, wlog, is $D \not\isin X \land D \isin Y$.
+$D \not\le X$ so $D \not\le M$ so $D \not\isin M$.  
+Thus by $\merge$, $D \isin C$.  And $D \le Y$ so $D \le C$.
+OK for $C \haspatch \p$.
+
+So indeed $L \haspatch \p \land R \haspatch \p \implies C \haspatch \p$.
+
+\subsubsection{For (wlog) $X \not\haspatch \p, Y \haspatch \p$:}
+
+$C \haspatch \p \equiv M \nothaspatch \p$.
+
+\proofstarts
+
+Merge Ends applies.
+
+$D \isin Y \equiv D \le Y$.  $D \not\isin X$.  Recall that we
+are considering $D \in \py$.
+
+Consider $D = C$.  Thus $C \in \py, L \in \py$.  
+But $X \not\haspatch \p$ means xxx wip
+But $X \not\haspatch \p$ means $D \not\in X$, 
 
-xxx need to finish merge
+so we have $L = Y, R =
+X$.  Thus $R \not\haspatch \p$ and by Tip Self Inpatch $R \not\in
+\py$.  Thus by Tip Merge $R \in \pn$ and $M = \baseof{L}$.
+So by Base Acyclic, $M \nothaspatch \py$.  Thus we are expecting 
+$C \haspatch \py$.  And indeed $D \isin C$ and $D \le C$.  OK.
 
 \end{document}