Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am reading "Boolean Algebras with Operators part II" by Bjarni Jonsson and Alfred Tarski. On theorem 4.10 (p.132-133), they refer to a relation algebra $\mathfrak{A}$ being "simple" and proves that it is equivalent to $\mathfrak{A}$ having no ideal elements different from 0 and 1. What definition of "simple" is being used in this context? The article is in JSTOR, by the way.

share|improve this question

1 Answer 1

According to the definitions given in the extended abstract available here, a simple relation algebra is one that satisfies the condition $1;r;1=1$ for every non-zero $r$, where ‘;’ is the composition operator. Apparently an ideal element is an element $r$ that satisfies $1;r;1=r$.

share|improve this answer
    
That can't be it his definition, since in theorem 4.10 he proves that definition you gave is equivalent to $\mathfrak{A}$ being simple. –  Alison Oct 5 '11 at 5:47

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.