Kurepa tree
Kurepa tree is an in set theory, a tree of height ω₁, each of whose levels is countable, but with uncountably many branches.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2541102813
- Described as
- in set theory, a tree of height ω₁, each of whose levels is countable, but with uncountably many branches
- Other names
- Kurepa hypothesis
- What it is
- mathematical concept
- Named after
- Đuro Kurepa
- Wikipedias with a page
- 3
Wikidata item Q5935117 (wikidata.org/wiki/Q5935117), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1345895149
In set theory, a Kurepa tree is a tree (T,<) of height ω1, each of whose levels is countable, which has at least ℵ2 many branches. This concept was introduced by Kurepa (1935). 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, Silver (1971) showed that if a strongly inaccessible cardinal is Lévy collapsed to ω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.
A Kurepa tree with fewer than 2ℵ1 branches is known as a Jech–Kunen tree.
More generally if κ is an infinite cardinal, then a κ-Kurepa tree is a tree of height κ with more than κ branches but at most |α| elements of each infinite level α<κ, and the Kurepa hypothesis for κ is the statement that there is a κ-Kurepa tree. Sometimes the tree is also assumed to be binary. The existence of a binary κ-Kurepa tree is equivalent to the existence of a Kurepa family: a set of more than κ subsets of κ such that their intersections with any infinite ordinal α<κ form a set of cardinality at most α. The Kurepa hypothesis is false if κ is an ineffable cardinal, and conversely Jensen showed that in the constructible universe for any uncountable regular cardinal κ there is a κ-Kurepa tree unless κ is ineffable.
From the Wikipedia article “Kurepa tree” (en.wikipedia.org/wiki/Kurepa_tree), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
