The weakly compact reflection principle\\) states that \ is a weakly compact cardinal and every weakly compact subset of \ has a weakly compact proper initial segment. The weakly compact reflection principle at \ implies that \ is an \-weakly compact cardinal. In this article we show that the weakly compact reflection principle does not imply that \ is \\)-weakly compact. Moreover, we show that if the weakly compact reflection principle holds at \ then there is a forcing extension preserving (...) this in which \ is the least \-weakly compact cardinal. Along the way we generalize the well-known result which states that if \ is a regular cardinal then in any forcing extension by \-c.c. forcing the nonstationary ideal equals the ideal generated by the ground model nonstationary ideal; our generalization states that if \ is a weakly compact cardinal then after forcing with a ‘typical’ Easton-support iteration of length \ the weakly compact ideal equals the ideal generated by the ground model weakly compact ideal. (shrink)

It is shown in ZF that if $\delta < \delta^+ < \Omega$ are such that $\delta$ and $\delta^+$ are either both weakly compact or singular cardinals and $\Omega$ is large enough for putting the core model apparatus into action then there is an inner model with a Woodin cardinal.

We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally supercompact. We then apply this theorem to show that the hypothesis of supercompactness is necessary for certain proof schemata.

We show that if κ is weakly compact, then κ → 3holds for treelike partitions. As an application we study model constructions.

For n<ω, we say that theΠn1-reflection principle holds at κ and write Refln if and only if κ is a Πn1-indescribable cardinal and every Πn1-indescribable subset of κ has a Πn1-indescribable proper initial segment. The Πn1-reflection principle Refln generalizes a certain stationary reflection principle and implies that κ is Πn1-indescribable of order ω. We define a forcing which shows that the converse of this implication can be false in the case n=1; that is, we show that κ being Π11-indescribable of (...) order ω need not imply Refl1. Moreover, we prove that if κ is -weakly compact where α<κ+, then there is a forcing extension in which there is a weakly compact set W⊆κ having no weakly compact proper initial segment, the class of weakly compact cardinals is preserved and κ remains -weakly compact. We also formulate several open problems and highlight places in which standard arguments seem to break down. (shrink)

It is shown in ZF that if $\delta are such that δ and δ + are either both weakly compact or singular cardinals and Ω is large enough for putting the core model apparatus into action then there is an inner model with a Woodin cardinal.

We present a characterization of weakly compact cardinals in terms of generalized stationarity. We apply this characterization to construct a model with no partial square sequences.

We show that the existence of a weakly compact cardinal over the Zermelo–Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.

The Necessary Maximality Principle for c. c. c. forcing with real parameters is equiconsistent with the existence of a weakly compact cardinal. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta}$$\end{document}-supercompact, for any desired θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta}$$\end{document}. In addition, we prove several global results showing how the entire class of weakly compactcardinals, a proper class, can be made to coincide with the class of unfoldable cardinals, with the class of weakly measurable cardinals or (...) with the class of nearly θκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\theta_\kappa}$$\end{document}-supercompact cardinals κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document}, for nearly any desired function κ↦θκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa\mapsto\theta_\kappa}$$\end{document}. These results answer several questions that had been open in the literature and extend to these large cardinals the identity-crises phenomenon, first identified by Magidor with the strongly compact cardinals. (shrink)

The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal κ > א1, the principle □ is equivalent to the existence of a certain strong coloring c : [κ]2 → κ for which the family of fibers T is a nonspecial κ-Aronszajn tree. The theorem follows from an analysis of (...) a new characteristic function for walks on ordinals, and implies in particular that if the κ-chain condition is productive for a given regular cardinal κ > א1, then κ is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if κ is a weakly compact cardinal, then the κ-chain condition is productive. (shrink)

In his seminal paper introducing the fine structure of L, Jensen proved that under \ any regular cardinal that reflects stationary sets is weakly compact. In this paper we give a new proof of Jensen’s result that is straight-forward and accessible to those without a knowledge of Jensen’s fine structure theory. The proof here instead uses hyperfine structure, a very natural and simpler alternative to fine structure theory introduced by Friedman and Koepke.

We work in set theory without the Axiom of Choice ZF. We prove that the Principle of Dependent Choices (DC) implies that the closed unit ball of a uniformly convex Banach space is weakly compact and, in particular, that the closed unit ball of a Hilbert space is weakly compact. These statements are not provable in ZF and the latter statement does not imply DC. Furthermore, DC does not imply that the closed unit ball of a reflexive space is weakly (...) compact. (shrink)

In recent years, proof theoretic transformations that are based on extensions of monotone forms of Gödel’s famous functional interpretation have been used systematically to extract new content from proofs in abstract nonlinear analysis. This content consists both in effective quantitative bounds as well as in qualitative uniformity results. One of the main ineffective tools in abstract functional analysis is the use of sequential forms of weak compactness. As we recently verified, the sequential form of weak compactness (...) for bounded closed and convex subsets of an abstract Hilbert space can be carried out in suitable formal systems that are covered by existing metatheorems developed in the course of the proof mining program. In particular, it follows that the monotone functional interpretation of this weak compactness principle can be realized by a functional Ω∗ definable from bar recursion of lowest type. While a case study on the analysis of strong convergence results that are based on weak compactness indicates that the use of the latter seems to be eliminable, things apparently are different for weak convergence theorems such as the famous Baillon nonlinear ergodic theorem. For this theorem we recently extracted an explicit bound on a metastable version of this theorem that is primitive recursive relative to Ω∗.In the current paper we for the first time give the construction of Ω∗ . As a corollary to the fine analysis of the use of bar recursion in this construction we obtain that Ω∗ elevates arguments in Tn at most to resulting functionals in Tn+2 . In particular, one can conclude from this that our bound on Baillon’s theorem is at least definable in T4. (shrink)

We extend the core model induction technique to a choiceless context, and we exploit it to show that each one of the following two hypotheses individually implies that , the Axiom of Determinacy, holds in the of a generic extension of : every uncountable cardinal is singular, and every infinite successor cardinal is weakly compact and every uncountable limit cardinal is singular.

I use generic embeddings induced by generic normal measures on that can be forced to exist if κ is an indestructibly weakly compact cardinal. These embeddings can be applied in order to obtain the forcing axioms in forcing extensions. This has consequences in : The Singular Cardinal Hypothesis holds above κ, and κ has a useful Jónsson-like property. This in turn implies that the countable tower works much like it does when κ is a Woodin limit of Woodin cardinals. One (...) consequence is that every set of reals in the Chang model is Lebesgue measurable and has the Baire Property, the Perfect Set Property and the Ramsey Property. So indestructible weak compactness has effects on cardinal arithmetic high up and also on the structure of sets of real numbers, down low, similar to supercompactness. (shrink)

We show that if κ is a weakly compact cardinal, then $\left( \matrix \kappa ^{+} \\ \kappa\endmatrix \right)\rightarrow \left(\left( \matrix \alpha \\ \kappa \endmatrix \right)_{m}\left( \matrix \kappa ^{n} \\ \kappa \endmatrix \right)_{\mu}\right)^{1,1}$ for any ordinals α < κ⁺ and µ < κ, and any finite ordinals m and n. This polarized partition relation represents the statement that for any partition $\kappa \times \kappa ^{+}=\underset i<m\to{\bigcup }K_{i}\cup \underset j<\mu \to{\bigcup }L_{j}$ of κ × κ⁺ into m + µ pieces either there (...) are A ∈ [κ]κ, B ∈ [κ⁺]α, and i < m with A × B ⊆ Ki or there are C ∈ [κ]κ, D ∈ [κ⁺]α, and j < μ with C × D ⊆ Lj. Related results for measurable and almost measurable κ are also investigated. Our proofs of these relations involve the use of elementary substructures of set models of large fragments of ZFC. (shrink)

It is shown that for compact metric spaces the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{Gn : n ∈ ω}, ∣Gn∣ < ω, with limn→∞ diam = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF0 , the Zermelo-Fraenkel set theory without the axiom of regularity, and (...) that the countable axiom of choice for families of finite sets CACfin does not imply the statement “Compact metric spaces are separable”. (shrink)

A weak constructive sequential compactness property of metric spaces is introduced. It is proved that for complete, totally bounded metric spaces this property is equivalent to Brouwer's fan theorem for detachable bars. Our results form a part of constructive reverse mathematics.

We work in set-theory without choice ZF. A set is Countable if it is finite or equipotent with ${\Bbb N}$ . Given a closed subset F of [0, 1] I which is a bounded subset of $\ell ^{1}(I)$ (resp. such that $F\subseteq c_{0}(I)$ ), we show that the countable axiom of choice for finite sets, (resp. the countable axiom of choice AC N ) implies that F is compact. This enhances previous results where AC N (resp. the axiom of Dependent (...) Choices) was required. If I is linearly orderable (for example $I={\Bbb R}$ ), then, in ZF, the closed unit ball of the Hilbert space $\ell ^{2}(I)$ is (Loeb-)compact in the weak topology. However, the weak compactness of the closed unit ball of $\ell ^{2}(\scr{P}({\Bbb R}))$ is not provable in ZF. (shrink)

We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on [Formula: see text], if [Formula: see text] is weakly compact, then [Formula: see text] holds. This provides contrast with a well-known theorem of Woodin, who showed that in a certain Radin extension over a suitably prepared ground model relative to the existence of large cardinals, the diamond principle (...) fails at a strongly inaccessible Mahlo cardinal. Refining the analysis of the Radin extensions, we consistently demonstrate a scenario where a compactness principle, stronger than the diagonal stationary reflection principle, holds yet the diamond principle fails at a strongly inaccessible cardinal, improving a result from [O. B. -Neria, Diamonds, compactness, and measure sequences, J. Math. Log. 19(1) (2019) 1950002]. (shrink)

We show that weakly compact cardinals are the smallest large cardinals k where k+ < k+ is impossible provided 0# does not exist. We also show that if k+Kc < k+ for some k being weakly compact , then there is a transitive set M with M ⊨ ZFC + “there is a strong cardinal”.

We establish the consistency of the failure of the diamond principle on a cardinal [Formula: see text] which satisfies a strong simultaneous reflection property. The result is based on an analysis of Radin forcing, and further leads to a characterization of weak compactness of [Formula: see text] in a Radin generic extension.

We prove that every weakly square compact cardinal is a strong limit cardinal, and therefore weakly compact. We also study Aronszajn trees with no uncountable finitely splitting subtrees, characterizing them in terms of being Lindelöf with respect to a particular topology. We prove that the class of such trees is consistently non-empty and lies between the classes of Suslin and Aronszajn trees.

In this paper, we deal with compact operators on a Hilbert space, within the framework of Bishop's constructive mathematics. We characterize the compactness of a bounded linear mapping of a Hilbert space into C n , and prove the theorems: Let A and B be compact operators on a Hilbert space H , let C be an operator on H and let α ϵ C . Then α A is compact, A + B is compact, A ∗ is compact, (...) CA is compact and if C ∗ exists, then AC is compact; An operator on a Hilbert space has an adjoint if and only if it is weakly compact. (shrink)

We show that weakly compact cardinals are the smallest large cardinals k where k+ < k+ is impossible provided 0# does not exist. We also show that if k+Kc < k+ for some k being weakly compact , then there is a transitive set M with M ⊨ ZFC + “there is a strong cardinal”.

Suppose that there is no transitive model of ZFC + there is a strong cardinal, and let K denote the core model. It is shown that if $\delta$ has the tree property then $\delta^{+K} = \delta^+$ and $\delta$ is weakly compact in K.

In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states and (...) measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism. (shrink)

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly (...) inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K. (shrink)

In this article, we introduce the notion of weakly measurable cardinal, a new large cardinal concept obtained by weakening the familiar concept of a measurable cardinal. Specifically, a cardinal κ is weakly measurable if for any collection equation image containing at most κ+ many subsets of κ, there exists a nonprincipal κ-complete filter on κ measuring all sets in equation image. Every measurable cardinal is weakly measurable, but a weakly measurable cardinal need not be measurable. Moreover, while the GCH cannot (...) fail first at a measurable cardinal, I will show that it can fail first at a weakly measurable cardinal. More generally, if κ is measurable, then we can make its weak measurability indestructible by the forcing Add for any η while forcing the GCH to hold below κ. Nevertheless, I shall prove that weakly measurable cardinals and measurable cardinals are equiconsistent. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

Let {: i ∈I } be a family of compact spaces and let X be their Tychonoff product. [MATHEMATICAL SCRIPT CAPITAL C] denotes the family of all basic non-trivial closed subsets of X and [MATHEMATICAL SCRIPT CAPITAL C]R denotes the family of all closed subsets H = V × Πmath imageXi of X, where V is a non-trivial closed subset of Πmath imageXi and QH is a finite non-empty subset of I. We show: Every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL (...) C]R extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ if and only if every family H ⊂ [MATHEMATICAL SCRIPT CAPITAL C] with the finite intersection property extends to a maximal [MATHEMATICAL SCRIPT CAPITAL C] family F with the fip. The proposition “if every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C]R extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ, then X is compact” is not provable in ZF. The statement “for every family {: i ∈ I } of compact spaces, every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C]R, Y = Πi ∈IYi, extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ” is equivalent to Tychonoff's compactness theorem. The statement “for every family {: i ∈ ω } of compact spaces, every countable filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C]R, X = Πi ∈ωXi, extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ” is equivalent to Tychonoff's compactness theorem restricted to countable families. The countable Axiom of Choice is equivalent to the proposition “for every family {: i ∈ ω } of compact topological spaces, every countable family ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C] with the fip extends to a maximal [MATHEMATICAL SCRIPT CAPITAL C] family ℱ with the fip”. (shrink)

We show that the property of sequential compactness for subspaces of.