Jump to content

Talk:Completely distributive lattice

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by GTrang (talk | contribs) at 14:43, 8 June 2015 (Axiom of choice: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Start‑class Mid‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-priority on the project's priority scale.

Axiom of choice

A version of complete distributivity is that the join map from lower sets in L to L preserves meets. For power sets, even this version still requires the axiom of choice: for an element x of the intersection of the unions, one has to choose for each element of the lower set an element of it containing x. GeoffreyT2000 (talk) 14:43, 8 June 2015 (UTC)[reply]