Square principle

Last updated January 15, 2025

In mathematical set theory, a square principle is a combinatorial principle asserting the existence of a cohering sequence of short closed unbounded (club) sets so that no one (long) club set coheres with them all. As such they may be viewed as a kind of incompactness phenomenon.^[1] They were introduced by Ronald Jensen in his analysis of the fine structure of the constructible universe L.

Definition

Define Sing to be the class of all limit ordinals which are not regular. Global square states that there is a system $(C_{\beta })_{\beta \in \mathrm {Sing} }$ satisfying:

$C_{\beta }$ is a club set of $\beta$ .
ot $(C_{\beta })<\beta$
If $\gamma$ is a limit point of $C_{\beta }$ then $\gamma \in \mathrm {Sing}$ and $C_{\gamma }=C_{\beta }\cap \gamma$

Variant relative to a cardinal

Jensen introduced also a local version of the principle.^[2] If $\kappa$ is an uncountable cardinal, then $\Box _{\kappa }$ asserts that there is a sequence $(C_{\beta }\mid \beta {\text{ a limit point of }}\kappa ^{+})$ satisfying:

$C_{\beta }$ is a club set of $\beta$ .
If $cf\beta <\kappa$ , then $|C_{\beta }|<\kappa$
If $\gamma$ is a limit point of $C_{\beta }$ then $C_{\gamma }=C_{\beta }\cap \gamma$

Jensen proved that this principle holds in the constructible universe for any uncountable cardinal $\kappa$ .

Notes

↑ Cummings, James (2005), "Notes on Singular Cardinal Combinatorics", Notre Dame Journal of Formal Logic, 46 (3): 251–282, doi: 10.1305/ndjfl/1125409326 Section 4.
↑ Jech, Thomas (2003), Set Theory: Third Millennium Edition, Springer Monographs in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-3-540-44085-7 , p. 443.

Jensen, R. Björn (1972), "The fine structure of the constructible hierarchy", Annals of Mathematical Logic, 4 (3): 229–308, doi: 10.1016/0003-4843(72)90001-0 , MR 0309729

This set theory-related article is a stub. You can help Wikipedia by expanding it.

Related Research Articles

In mathematics, specifically set theory, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states:

There is no set whose cardinality is strictly between that of the integers and the real numbers.

In trigonometry, the law of sines, sine law, sine formula, or sine rule is an equation relating the lengths of the sides of any triangle to the sines of its angles. According to the law, $where a, b, and c are the lengths of the sides of a triangle, and α, β, and γ are the opposite angles, while R is the radius of the triangle's circumcircle. When the last part of the equation is not used, the law is sometimes stated using the reciprocals; The law of sines can be used to compute the remaining sides of a triangle when two angles and a side are known—a technique known as triangulation. It can also be used when two sides and one of the non-enclosed angles are known. In some such cases, the triangle is not uniquely determined by this data and the technique gives two possible values for the enclosed angle.$

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal $κ$ is strongly inaccessible if it satisfies the following three conditions: it is uncountable, it is not a sum of fewer than $κ$ cardinals smaller than $κ$ , and $implies .$

In mathematics, a Mahlo cardinal is a certain kind of large cardinal number. Mahlo cardinals were first described by Paul Mahlo. As with all large cardinals, none of these varieties of Mahlo cardinals can be proven to exist by ZFC.

In the mathematical discipline of set theory, 0^# is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the natural numbers, or as a subset of the hereditarily finite sets, or as a real number. Its existence is unprovable in ZFC, the standard form of axiomatic set theory, but follows from a suitable large cardinal axiom. It was first introduced as a set of formulae in Silver's 1966 thesis, later published as Silver (1971), where it was denoted by Σ, and rediscovered by Solovay, who considered it as a subset of the natural numbers and introduced the notation O^#.

In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Hanf & Scott (1961).

In mathematics, subtle cardinals and ethereal cardinals are closely related kinds of large cardinal number.

In mathematics, in set theory, the constructible universe, denoted by $is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy . It was introduced by Kurt Gödel in his 1938 paper "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis". In this paper, he proved that the constructible universe is an inner model of ZF set theory, and also that the axiom of choice and the generalized continuum hypothesis are true in the constructible universe. This shows that both propositions are consistent with the basic axioms of set theory, if ZF itself is consistent. Since many other theorems only hold in systems in which one or both of the propositions is true, their consistency is an important result.$

An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. The concept was introduced by Zermelo in the 1930s.

In mathematics, particularly in mathematical logic and set theory, a club set is a subset of a limit ordinal that is closed under the order topology, and is unbounded relative to the limit ordinal. The name club is a contraction of "closed and unbounded".

In mathematics, particularly in set theory, Fodor's lemma states the following:

In mathematics, particularly in set theory, if $is a regular uncountable cardinal then the filter of all sets containing a club subset of is a -complete filter closed under diagonal intersection called the club filter .$

In set theory, a branch of mathematics, a reflection principle says that it is possible to find sets that, with respect to any given property, resemble the class of all sets. There are several different forms of the reflection principle depending on exactly what is meant by "resemble". Weak forms of the reflection principle are theorems of ZF set theory due to Montague (1961), while stronger forms can be new and very powerful axioms for set theory.

In mathematics, compact quantum groups are generalisations of compact groups, where the commutative $-algebra$ of continuous complex-valued functions on a compact group is generalised to an abstract structure on a not-necessarily commutative unital $-algebra, which plays the role of the "algebra of continuous complex-valued functions on the compact quantum group".$

In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations. However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not ; various more-concrete ways of defining ordinals that definitely have notations are available.

In mathematical logic and set theory, an ordinal collapsing function is a technique for defining certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals, and then "collapse" them down to a system of notations for the sought-after ordinal. For this reason, ordinal collapsing functions are described as an impredicative manner of naming ordinals.

In set theory, a branch of mathematics, the Milner – Rado paradox, found by Eric Charles Milner and Richard Rado, states that every ordinal number $less than the successor of some cardinal number can be written as the union of sets where is of order type at most κ n for n a positive integer.$

This is a glossary of terms and definitions related to the topic of set theory.

In mathematics, Rathjen's $psi function$ is an ordinal collapsing function developed by Michael Rathjen. It collapses weakly Mahlo cardinals $to generate large countable ordinals. A weakly Mahlo cardinal is a cardinal such that the set of regular cardinals below is closed under . Rathjen uses this to diagonalise over the weakly inaccessible hierarchy.$

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Cummings, James (2005), "Notes on Singular Cardinal Combinatorics", Notre Dame Journal of Formal Logic, 46 (3): 251–282, doi: 10.1305/ndjfl/1125409326 Section 4.

[2] Jech, Thomas (2003), Set Theory: Third Millennium Edition, Springer Monographs in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-3-540-44085-7 , p. 443.

[1]

[2]

Square principle

Contents

Definition

Variant relative to a cardinal

Notes

Related Research Articles