Mikołaj Bojańczyk

Let \alg be a \cchain-algebra, and let B be a subset of its universe. The subset of \alg generated by B is defined to be the least subset of the universe which contains B and is closed under the multiplication operation of the algebra. By associativity, this subset is the same thing as the image of the multiplication operation over the set \cchain B. The following theorem shows that the elements generated by B can be generated by using only the basic operations that were already used in the characterisation theorem from the parent page.

Theorem. Let \alg be a \cchain-algebra with finite universe. For every subset B of the universe, the subset generated by B is the least subset that contains B and is closed under binary product, shuffle, as well as the powers a^\omega and  a^{-\omega}.

The proof of this theorem is similar to the one in the parent page.

 

Leave a Reply

Your email address will not be published. Required fields are marked *