Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Replies: 21   Last Post: Aug 20, 2013 11:45 PM

 Messages: [ Previous | Next ]
 William Elliot Posts: 2,637 Registered: 1/8/12
Posted: Aug 20, 2013 5:15 AM

On Mon, 19 Aug 2013, William Elliot wrote:
> On Mon, 19 Aug 2013, Victor Porton wrote:
> > >> >
> > >> >> A complete reloid is a join (on a complete lattice of reloids between
> > >> >> two fixed sets) of (reloidal) products of a trivial ultrafilter and a
> > >> >> (non necessarily trivial) ultrafilter.

>
> For Ft(XxY) = { F | F filter for XxY } to be a complete order by
> inclusion, doesn't Ft(XxY) have to include both P(XxY) and the empty set?

No, the empty filter isn't needed for the bottom of Ft(XxY) is {P(XxY)}
and the top is P(XxY).

However to define a complete reloid, P(X,Y) in Ft(XxY) isn't needed.
Indeed, Ft(S) with P(S) excluded and subset order is a complete, down or
lower, semi-lattice because the intersection of any number of filters
is again a filter, that is intersection is the meet.

BTW, /\{ F | F principal ultrafilter for S } = {P(S)}
that is, the meet of all principal ultrafilters is the trivial
filter containing but one subset.

Date Subject Author
8/13/13 Victor Porton
8/13/13 Rotwang
8/14/13 William Elliot
8/14/13 Victor Porton
8/14/13 William Elliot
8/15/13 Victor Porton
8/15/13 FredJeffries@gmail.com
8/15/13 Victor Porton
8/16/13 William Elliot
8/17/13 Victor Porton
8/17/13 William Elliot
8/18/13 William Elliot
8/18/13 Victor Porton
8/19/13 William Elliot
8/19/13 Victor Porton
8/19/13 William Elliot
8/19/13 Victor Porton
8/19/13 William Elliot
8/20/13 William Elliot
8/20/13 Victor Porton
8/20/13 William Elliot
8/16/13 fom