Math 2.0

Concept

Kurepa tree

Summary

In set theory, a Kurepa tree is a tree (T,<)(T, <) of height ω1\omega_1, each of whose levels is countable, which has at least ℵ2\aleph_2 many branches. This concept was introduced by (txt). The existence of a Kurepa tree (known as the Kurepa hypothesis, though Kurepa originally conjectured that such trees do not exist) is consistent with the axioms of ZFC: Solovay showed in unpublished work that there are Kurepa trees in Gödel's constructible universe (Jech 1971). More precisely, the existence of Kurepa trees follows from the diamond plus principle, which holds in the constructible universe. On the other hand, (txt) showed that if a strongly inaccessible cardinal is Lévy collapsed to ω2\omega_2 then, in the resulting model, there are no Kurepa trees. The existence of an inaccessible cardinal is in fact equiconsistent with the failure of the Kurepa hypothesis, because if the Kurepa hypothesis is false then the cardinal ω2 is inaccessible in the constructible universe.

Further reading

  1. Wikipedia, page 8267820, revision 1345895149, Kurepa tree. adopted
About this page
TagEW1NAD47PM
URIm2://EW1NAD47PM
Aliaseskurepa-conjecture, kurepa-family, kurepa-hypothesis, kurepas-hypothesis
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.