Halpern–Läuchli theorem (original) (raw)
In mathematics, the Halpern–Läuchli theorem is a partition result about finite products of infinite trees. Its original purpose was to give a model for set theory in which the Boolean prime ideal theorem is true but the axiom of choice is false. It is often called the Halpern–Läuchli theorem, but the proper attribution for the theorem as it is formulated below is to Halpern–Läuchli–Laver–Pincus or HLLP (named after James D. Halpern, Hans Läuchli, Richard Laver, and David Pincus), following . Let d,r < ω, be a sequence of finitely splitting trees of height ω. Let Alternatively, let and .
| Property | Value |
|---|---|
| dbo:abstract | In mathematics, the Halpern–Läuchli theorem is a partition result about finite products of infinite trees. Its original purpose was to give a model for set theory in which the Boolean prime ideal theorem is true but the axiom of choice is false. It is often called the Halpern–Läuchli theorem, but the proper attribution for the theorem as it is formulated below is to Halpern–Läuchli–Laver–Pincus or HLLP (named after James D. Halpern, Hans Läuchli, Richard Laver, and David Pincus), following . Let d,r < ω, be a sequence of finitely splitting trees of height ω. Let then there exists a sequence of subtrees strongly embedded in such that Alternatively, let and . The HLLP theorem says that not only is the collection partition regular for each d < ω, but that the homogeneous subtree guaranteed by the theorem is strongly embedded in (en) |
| dbo:wikiPageID | 4358338 (xsd:integer) |
| dbo:wikiPageLength | 3018 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 950477894 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Mathematics dbr:Milliken's_tree_theorem dbc:Trees_(set_theory) dbr:Tree_(set_theory) dbc:Theorems_in_the_foundations_of_mathematics dbr:Journal_of_Combinatorial_Theory dbc:Ramsey_theory dbr:Richard_Laver dbr:Axiom_of_choice dbr:Boolean_prime_ideal_theorem dbr:Transactions_of_the_American_Mathematical_Society dbr:Partition_regular |
| dbp:wikiPageUsesTemplate | dbt:Citation dbt:Harvtxt |
| dcterms:subject | dbc:Trees_(set_theory) dbc:Theorems_in_the_foundations_of_mathematics dbc:Ramsey_theory |
| rdf:type | yago:WikicatTheoremsInTheFoundationsOfMathematics yago:Abstraction100002137 yago:Communication100033020 yago:Message106598915 yago:Proposition106750804 yago:Statement106722453 yago:Theorem106752293 |
| rdfs:comment | In mathematics, the Halpern–Läuchli theorem is a partition result about finite products of infinite trees. Its original purpose was to give a model for set theory in which the Boolean prime ideal theorem is true but the axiom of choice is false. It is often called the Halpern–Läuchli theorem, but the proper attribution for the theorem as it is formulated below is to Halpern–Läuchli–Laver–Pincus or HLLP (named after James D. Halpern, Hans Läuchli, Richard Laver, and David Pincus), following . Let d,r < ω, be a sequence of finitely splitting trees of height ω. Let Alternatively, let and . (en) |
| rdfs:label | Halpern–Läuchli theorem (en) |
| owl:sameAs | freebase:Halpern–Läuchli theorem wikidata:Halpern–Läuchli theorem https://global.dbpedia.org/id/4kCBe |
| prov:wasDerivedFrom | wikipedia-en:Halpern–Läuchli_theorem?oldid=950477894&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Halpern–Läuchli_theorem |
| is dbo:wikiPageRedirects of | dbr:Halpern-Laeuchli_theorem dbr:Halpern-Läuchli_theorem dbr:Halpern–Laeuchli_theorem dbr:Halpern–Lauchli_theorem dbr:Halpern-Lauchli_theorem |
| is dbo:wikiPageWikiLink of | dbr:Partition_regularity dbr:Halpern-Laeuchli_theorem dbr:Halpern-Läuchli_theorem dbr:Halpern–Laeuchli_theorem dbr:Halpern–Lauchli_theorem dbr:Richard_Laver dbr:List_of_theorems dbr:Halpern-Lauchli_theorem |
| is foaf:primaryTopic of | wikipedia-en:Halpern–Läuchli_theorem |