Calculus of constructions

The Knuth–Bendix completion algorithm (named after Donald Knuth and Peter Bendix) is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it effectively solves the word problem for the specified algebra.

An important case in computational group theory are string rewriting systems which can be used to give canonical labels to elements or cosets of a finitely presented group as products of the generators. This special case is the current focus of this article.

Buchberger's algorithm for computing Gröbner bases is a very similar algorithm. Although developed independently, it may also be seen as the instantiation of Knuth-Bendix algorithm in the theory of polynomial rings.

Motivation in group theory

The critical pair lemma states that a term rewriting system is locally confluent (or weakly confluent) if and only if all its critical pairs are convergent. Furthermore, we have Newman's lemma which states that if an (abstract) rewriting system is strongly normalizing and weakly confluent, then the rewriting system is confluent. So, if we can add rules to the term rewriting system in order to force all critical pairs to be convergent while maintaining the strong normalizing property, then this will force the resultant rewriting system to be confluent.

Consider a finitely presented monoid $M=\langle X\mid R\rangle$ where X is a finite set of generators and R is a set of defining relations on X. Let X^* be the set of all words in X (i.e. the free monoid generated by X). Since the relations R generate an equivalence relation on X*, one can consider elements of M to be the equivalence classes of X^* under R. For each class {w₁, w₂, ... } it is desirable to choose a standard representative w_k. This representative is called the canonical or normal form for each word w_k in the class. If there is a computable method to determine for each w_k its normal form w_i then the word problem is easily solved. A confluent rewriting system allows one to do precisely this.

Although the choice of a canonical form can theoretically be made in an arbitrary fashion this approach is generally not computable. (Consider that an equivalence relation on a language can produce an infinite number of infinite classes.) If the language is well-ordered then the order < gives a consistent method for defining minimal representatives, however computing these representatives may still not be possible. In particular, if a rewriting system is used to calculate minimal representatives then the order < should also have the property:

A < B → XAY < XBY for all words A,B,X,Y

This property is called translation invariance. An order that is both translation-invariant and a well-order is called a reduction order.

From the presentation of the monoid it is possible to define a rewriting system given by the relations R. If A x B is in R then either A < B in which case B → A is a rule in the rewriting system, otherwise A > B and A → B. Since < is a reduction order a given word W can be reduced W > W_1 > ... > W_n where W_n is irreducible under the rewriting system. However, depending on the rules that are applied at each W_i → W_i+1 it is possible to end up with two different irreducible reductions W_n ≠ W'_m of W. However, if the rewriting system given by the relations is converted to a confluent rewriting system via the Knuth–Bendix algorithm, then all reductions are guaranteed to produce the same irreducible word, namely the normal form for that word.

Description of the algorithm for finitely presented monoids

Suppose we are given a presentation $\langle X\mid R\rangle$, where $X$ is a set of generators and $R$ is a set of relations giving the rewriting system. Suppose further that we have a reduction ordering $<$ among the words generated by $X$(e.g., shortlex order). For each relation $P_{i}=Q_{i}$ in $R$, suppose $Q_{i}<P_{i}$. Thus we begin with the set of reductions $P_{i}\rightarrow Q_{i}$.

First, if any relation $P_{i}=Q_{i}$ can be reduced, replace $P_{i}$ and $Q_{i}$ with the reductions.

Next, we add more reductions (that is, rewriting rules) to eliminate possible exceptions of confluence. Suppose that $P_{i}$ and $P_{j}$, where $i\neq j$, overlap.

1. Case 1: either the prefix of $P_{i}$ equals the suffix of $P_{j}$, or vice versa. In the former case, we can write $P_{i}=BC$ and $P_{j}=AB$; in the latter case, $P_{i}=AB$ and $P_{j}=BC$.
2. Case 2: either $P_{i}$ is completely contained (surrounded) in $P_{j}$, or vice versa. In the former case, we can write $P_{i}=B$ and $P_{j}=ABC$; in the latter case, $P_{i}=ABC$ and $P_{j}=B$.

Reduce the word $ABC$ using $P_{i}$ first, then using $P_{j}$ first. Call the results $r_{1},r_{2}$, respectively. If $r_{1}\neq r_{2}$, then we have an instance where confluence could fail. Hence, add the reduction $\max r_{1},r_{2}\rightarrow \min r_{1},r_{2}$ to $R$.

After adding a rule to $R$, remove any rules in $R$ that might have reducible left sides.

Repeat the procedure until all overlapping left sides have been checked.

Example

Consider the monoid: $\langle x,y\mid x^{3}=y^{3}=(xy)^{3}=1\rangle$. We use the shortlex order. This is an infinite monoid but nevertheless, the Knuth–Bendix algorithm is able to solve the word problem.

Our beginning three reductions are therefore (1) $x^{3}\rightarrow 1$, (2) $y^{3}\rightarrow 1$, and (3) $(xy)^{3}\rightarrow 1$.

Consider the word $x^{3}yxyxy$. Reducing using (1), we get $yxyxy$. Reducing using (3), we get $x^{2}$. Hence, we get $yxyxy=x^{2}$, giving the reduction rule (4) $yxyxy\rightarrow x^{2}$.

Similarly, using $xyxyxy^{3}$ and reducing using (2) and (3), we get $xyxyx=y^{2}$. Hence the reduction (5) $xyxyx\rightarrow y^{2}$.

Both of these rules obsolete (3), so we remove it.

Next, consider $x^{3}yxyx$ by overlapping (1) and (5). Reducing we get $yxyx=x^{2}y^{2}$, so we add the rule (6) $yxyx\rightarrow x^{2}y^{2}$. Considering $xyxyx^{3}$ by overlapping (1) and (5), we get $xyxy=y^{2}x^{2}$, so we add the rule (7) $y^{2}x^{2}\rightarrow xyxy$. These obsolete rules (4) and (5), so we remove them.

Now, we are left with the rewriting system

• (1) $x^{3}\rightarrow 1$
• (2) $y^{3}\rightarrow 1$
• (6) $yxyx\rightarrow x^{2}y^{2}$
• (7) $y^{2}x^{2}\rightarrow xyxy$

Checking the overlaps of these rules, we find no potential failures of confluence. Therefore, we have a confluent rewriting system, and the algorithm terminates successfully.

Generalizations

If Knuth–Bendix does not succeed, it will either run forever, or fail when it encounters an unorientable equation (i.e. an equation that it cannot turn into a rewrite rule). The enhanced completion without failure will not fail on unorientable equations and provides a semi-decision procedure for the word problem.

The notion of logged rewriting discussed in the paper by Heyworth and Wensley listed below allows some recording or logging of the rewriting process as it proceeds. This is useful for computing identities among relations for presentations of groups.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

• 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
  
  My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
• C. Sims. 'Computations with finitely presented groups.' Cambridge, 1994.
• Anne Heyworth and C.D. Wensley. "Logged rewriting and identities among relators." Groups St. Andrews 2001 in Oxford. Vol. I, 256–276, London Math. Soc. Lecture Note Ser., 304, Cambridge Univ. Press, Cambridge, 2003.

External links

• 
  
  I had like 17 domains hosted on single account, and never had any special troubles. If you are not happy with the service you will get your money back with in 45 days, that's guaranteed. But the Search Engine utility inside the Hostgator account furnished an instant score for my launched website. Fantastico is unable to install WordPress in a directory which already have any file i.e to install WordPress using Fantastico the destination directory must be empty and it should not have any previous installation files. When you share great information, others will take note. Once your hosting is purchased, you will need to setup your domain name to point to your hosting. Money Back: All accounts of Hostgator come with a 45 day money back guarantee. If you have any queries relating to where by and how to use Hostgator Discount Coupon, you can make contact with us at our site. If you are starting up a website or don't have too much website traffic coming your way, a shared plan is more than enough. Condition you want to take advantage of the worldwide web you prerequisite a HostGator web page, -1 of the most trusted and unfailing web suppliers on the world wide web today. Since, single server is shared by 700 to 800 websites, you cannot expect much speed.
  
  
  
  Hostgator tutorials on how to install Wordpress need not be complicated, especially when you will be dealing with a web hosting service that is friendly for novice webmasters and a blogging platform that is as intuitive as riding a bike. After that you can get Hostgator to host your domain and use the wordpress to do the blogging. Once you start site flipping, trust me you will not be able to stop. I cut my webmaster teeth on Control Panel many years ago, but since had left for other hosting companies with more commercial (cough, cough) interfaces. If you don't like it, you can chalk it up to experience and go on. First, find a good starter template design. When I signed up, I did a search for current "HostGator codes" on the web, which enabled me to receive a one-word entry for a discount. Your posts, comments, and pictures will all be imported into your new WordPress blog.