|
|
|
|
|
Let be a lattice. A finite join
of elements in is said to be irredundant if one can not delete an element from from the join without resulting in a smaller join. In other words,
for all
. This definition can be extended to the case where the join is taken over an infinite number of elements, provided that the join exists. If the join is not irredundant, it is redundant
Irredundant meets are dually defined.
Example. In the lattice of all subsets (ordered by inclusion) of
, the set of all integers, the join
 is prime 
is irredudant. Another irredundant join representation of
is just the join of all atoms, the singletons consisting of the individual elements of
. However,
 is any positive integer 
is redundant, since
can be removed whenever is a composite number. The join of all doubletons is also redundant, for
, for any
.
|
"irredundant" is owned by CWoo.
|
|
(view preamble | get metadata)
Cross-references: composite number, singletons, atoms, representation, integers, inclusion, subsets, meets, number, infinite, join, finite, lattice
There are 13 references to this entry.
This is version 2 of irredundant, born on 2008-06-30, modified 2008-06-30.
Object id is 10730, canonical name is Irredundant.
Accessed 430 times total.
Classification:
| AMS MSC: | 06B05 (Order, lattices, ordered algebraic structures :: Lattices :: Structure theory) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|