Let L be a subset of {a,b}*
Define a relation R (R sub L) on S* as follows:
L

for All of x, y is a member of S*,
(x,y) are members of R if for all of z, xz are members of L iff yz are members of L

A) Show that R is an equivalence relation

B) Suppose L={a^i b^i where i >= 0}
What can you say about the index of R (number of classes)? is it finite or infinite?
Show some classes and elements in these classes to justify your answer?

c) Suppose L={a^i b^j where i,j >= 0}
What can you say about the index of R (number of classes)? is it finite or infinite?
Show some classes and elements in these classes to justify your answer?

D) Suppose L={a^i b^3i where i >= 0}
What can you say about the index of R (number of classes)? is it finite or infinite?
Show some classes and elements in these classes to justify your answer?

Note: ^ means to the power, so a^i means a to the power of i.

Equivalence Relation vs. Equivalence Class. Concerning ... Question 2: For the equivalence relation (1), what are the equivalence classes? Solution ...

... that the given relation R on the set S of all ordered pairs of positive integers is an equivalence relation is provided. The equivalence class containing the ...

... are called equivalence classes (or fibers) and they define a partition of the set upon the given relation. Usually, an equivalence class is named ...

... 3,3). - As {4,5} is an equivalence class, there are four ordered pairs (4,4), (4,5), (5,4), (5,5). So, the ordered pairs in the equivalence relation are {(0, ...

... If a, b ε S, define aRb if a + b is even. Prove that R is an equivalence relation and determine the equivalence classes of S. Thank you. Hari Putcha. Hello. ...

... This provides examples of proofs regarding commutative rings and equivalence relations and classes, subrings and monomorphisms, units, and isomorphism. ...