PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: High
Kurosh-Ore theorem (Theorem)
Theorem 1 (Kurosh-Ore)   Let $ L$ be a modular lattice and suppose that $ a\in L$ has two irredundant decompositions of joins of join-irreducible elements:
$\displaystyle a=x_1\vee \cdots \vee x_m = y_1 \vee \cdots \vee y_n.$
Then
  1. $ m=n$, and
  2. every $ x_i$ can be replaced by some $ y_j$, so that
    $\displaystyle a= x_1\vee \cdots \vee x_{i-1} \vee y_j \vee x_{i+1} \vee \cdots \vee x_m.$

There is also a dual statement of the above theorem in terms of meets.

Remark. Additionally, if $ L$ is a distributive lattice, then the second property above (known the replacement property) can be strengthened: each $ x_i$ is equal to some $ y_j$. In other words, except for the re-ordering of elements in the decomposition, the above join is unique.



"Kurosh-Ore theorem" is owned by CWoo.
(view preamble | get metadata)

View style:

Log in to rate this entry.
(view current ratings)

Cross-references: property, distributive lattice, meets, terms, join-irreducible, joins, decompositions, irredundant, modular lattice

This is version 3 of Kurosh-Ore theorem, born on 2008-06-30, modified 2008-06-30.
Object id is 10731, canonical name is KuroshOreTheorem.
Accessed 246 times total.

Classification:
AMS MSC06B05 (Order, lattices, ordered algebraic structures :: Lattices :: Structure theory)
 06C05 (Order, lattices, ordered algebraic structures :: Modular lattices, complemented lattices :: Modular lattices, Desarguesian lattices)
 06D05 (Order, lattices, ordered algebraic structures :: Distributive lattices :: Structure and representation theory)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)