Every countable lattice is a retract of a direct product of chains (Q797605): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1771856 |
||
| Property / reviewed by | |||
| Property / reviewed by: Ervin Fried / rank | |||
Revision as of 16:45, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every countable lattice is a retract of a direct product of chains |
scientific article |
Statements
Every countable lattice is a retract of a direct product of chains (English)
0 references
1984
0 references
The authors prove that every countably lattice is retract (i.e., idempotent endomorphic image) of a direct product of the following ordered sets: the two- and three-element sets, the positive and negative integers and their direct sum. This result can be regarded as a negative one, for it shows how complicated a retract can be. The proof goes via Boolean algebras. Two basic concepts are used: gaps and selection property which might be useful in other research.
0 references
countably lattice
0 references
retract
0 references
idempotent endomorphic image
0 references
gaps
0 references
selection property
0 references
