What is the $text{♢-Axiom}$? (now known to be the 'Diamond Principle / Axiom')












1












$begingroup$


While skimming over some research papers I found this abstract




Mathematics > Operator Algebras (link here)



Large irredundant sets in operator algebras

Clayton Suguio Hida, Piotr Koszmider

(Submitted on 4 Aug 2018 (v1), last revised 2 Sep 2018 (this version, v3))



A subset X of a C*-algebra A is called irredundant if no A∈X belongs to the C*-subalgebra of A generated by X∖{A}. Separable C*-algebras cannot have uncountable irredundant sets and all members of many classes of nonseparable C*-algebras, e.g., infinite dimensional von Neumann algebras have irredundant sets of cardinality continuum.
There exists a considerable literature showing that the question whether every AF commutative nonseparable C*-algebra has an uncountable irredundant set is sensitive to additional set-theoretic axioms and we investigate here the noncommutative case.
Assuming ♢ (an additional axiom stronger than the continuum hypothesis) we prove that there is an AF C*-subalgebra of B(ℓ2) of density 2ω=ω1 with no nonseparable commutative C*-subalgebra and with no uncountable irredundant set. On the other hand we also prove that it is consistent that every discrete collection of operators in B(ℓ2) of cardinality continuum contains an irredundant subcollection of cardinality continuum.
Other partial results and more open problems are presented.




where you'll find the following sentence fragment,




Assuming ♢ (an additional axiom stronger than the continuum hypothesis) ...




I spent 5-7 minutes searching the web trying to find out what this $text{♢-Axiom}$ is all about, but came up empty-handed (got a couple of hits and a reference to the $text{♢-Principle}$, but no explicit statement of it).



What is the $text{♢-Axiom}$ (any elucidating comments/background info will be appreciated)?



Also, the abstract states that the status of the theory is sensitive to additional set-theoretic axioms, and that is certainly fascinating!













share|cite|improve this question











$endgroup$












  • $begingroup$
    I'm pretty sure that the Diamond Axiom is the thing that's usually called the Diamond Principle, which has a wikipedia article containing an explicit statement of it.
    $endgroup$
    – user3482749
    Jan 14 at 18:01










  • $begingroup$
    It's called the diamond principle. en.m.wikipedia.org/wiki/Diamond_principle
    $endgroup$
    – Shervin Sorouri
    Jan 14 at 18:02






  • 1




    $begingroup$
    @ShervinSorouri Yea, I thought it was a bit fishy searching for $text{♢-Axiom}$, with some kind of a 1-char string!
    $endgroup$
    – CopyPasteIt
    Jan 14 at 18:25
















1












$begingroup$


While skimming over some research papers I found this abstract




Mathematics > Operator Algebras (link here)



Large irredundant sets in operator algebras

Clayton Suguio Hida, Piotr Koszmider

(Submitted on 4 Aug 2018 (v1), last revised 2 Sep 2018 (this version, v3))



A subset X of a C*-algebra A is called irredundant if no A∈X belongs to the C*-subalgebra of A generated by X∖{A}. Separable C*-algebras cannot have uncountable irredundant sets and all members of many classes of nonseparable C*-algebras, e.g., infinite dimensional von Neumann algebras have irredundant sets of cardinality continuum.
There exists a considerable literature showing that the question whether every AF commutative nonseparable C*-algebra has an uncountable irredundant set is sensitive to additional set-theoretic axioms and we investigate here the noncommutative case.
Assuming ♢ (an additional axiom stronger than the continuum hypothesis) we prove that there is an AF C*-subalgebra of B(ℓ2) of density 2ω=ω1 with no nonseparable commutative C*-subalgebra and with no uncountable irredundant set. On the other hand we also prove that it is consistent that every discrete collection of operators in B(ℓ2) of cardinality continuum contains an irredundant subcollection of cardinality continuum.
Other partial results and more open problems are presented.




where you'll find the following sentence fragment,




Assuming ♢ (an additional axiom stronger than the continuum hypothesis) ...




I spent 5-7 minutes searching the web trying to find out what this $text{♢-Axiom}$ is all about, but came up empty-handed (got a couple of hits and a reference to the $text{♢-Principle}$, but no explicit statement of it).



What is the $text{♢-Axiom}$ (any elucidating comments/background info will be appreciated)?



Also, the abstract states that the status of the theory is sensitive to additional set-theoretic axioms, and that is certainly fascinating!













share|cite|improve this question











$endgroup$












  • $begingroup$
    I'm pretty sure that the Diamond Axiom is the thing that's usually called the Diamond Principle, which has a wikipedia article containing an explicit statement of it.
    $endgroup$
    – user3482749
    Jan 14 at 18:01










  • $begingroup$
    It's called the diamond principle. en.m.wikipedia.org/wiki/Diamond_principle
    $endgroup$
    – Shervin Sorouri
    Jan 14 at 18:02






  • 1




    $begingroup$
    @ShervinSorouri Yea, I thought it was a bit fishy searching for $text{♢-Axiom}$, with some kind of a 1-char string!
    $endgroup$
    – CopyPasteIt
    Jan 14 at 18:25














1












1








1





$begingroup$


While skimming over some research papers I found this abstract




Mathematics > Operator Algebras (link here)



Large irredundant sets in operator algebras

Clayton Suguio Hida, Piotr Koszmider

(Submitted on 4 Aug 2018 (v1), last revised 2 Sep 2018 (this version, v3))



A subset X of a C*-algebra A is called irredundant if no A∈X belongs to the C*-subalgebra of A generated by X∖{A}. Separable C*-algebras cannot have uncountable irredundant sets and all members of many classes of nonseparable C*-algebras, e.g., infinite dimensional von Neumann algebras have irredundant sets of cardinality continuum.
There exists a considerable literature showing that the question whether every AF commutative nonseparable C*-algebra has an uncountable irredundant set is sensitive to additional set-theoretic axioms and we investigate here the noncommutative case.
Assuming ♢ (an additional axiom stronger than the continuum hypothesis) we prove that there is an AF C*-subalgebra of B(ℓ2) of density 2ω=ω1 with no nonseparable commutative C*-subalgebra and with no uncountable irredundant set. On the other hand we also prove that it is consistent that every discrete collection of operators in B(ℓ2) of cardinality continuum contains an irredundant subcollection of cardinality continuum.
Other partial results and more open problems are presented.




where you'll find the following sentence fragment,




Assuming ♢ (an additional axiom stronger than the continuum hypothesis) ...




I spent 5-7 minutes searching the web trying to find out what this $text{♢-Axiom}$ is all about, but came up empty-handed (got a couple of hits and a reference to the $text{♢-Principle}$, but no explicit statement of it).



What is the $text{♢-Axiom}$ (any elucidating comments/background info will be appreciated)?



Also, the abstract states that the status of the theory is sensitive to additional set-theoretic axioms, and that is certainly fascinating!













share|cite|improve this question











$endgroup$




While skimming over some research papers I found this abstract




Mathematics > Operator Algebras (link here)



Large irredundant sets in operator algebras

Clayton Suguio Hida, Piotr Koszmider

(Submitted on 4 Aug 2018 (v1), last revised 2 Sep 2018 (this version, v3))



A subset X of a C*-algebra A is called irredundant if no A∈X belongs to the C*-subalgebra of A generated by X∖{A}. Separable C*-algebras cannot have uncountable irredundant sets and all members of many classes of nonseparable C*-algebras, e.g., infinite dimensional von Neumann algebras have irredundant sets of cardinality continuum.
There exists a considerable literature showing that the question whether every AF commutative nonseparable C*-algebra has an uncountable irredundant set is sensitive to additional set-theoretic axioms and we investigate here the noncommutative case.
Assuming ♢ (an additional axiom stronger than the continuum hypothesis) we prove that there is an AF C*-subalgebra of B(ℓ2) of density 2ω=ω1 with no nonseparable commutative C*-subalgebra and with no uncountable irredundant set. On the other hand we also prove that it is consistent that every discrete collection of operators in B(ℓ2) of cardinality continuum contains an irredundant subcollection of cardinality continuum.
Other partial results and more open problems are presented.




where you'll find the following sentence fragment,




Assuming ♢ (an additional axiom stronger than the continuum hypothesis) ...




I spent 5-7 minutes searching the web trying to find out what this $text{♢-Axiom}$ is all about, but came up empty-handed (got a couple of hits and a reference to the $text{♢-Principle}$, but no explicit statement of it).



What is the $text{♢-Axiom}$ (any elucidating comments/background info will be appreciated)?



Also, the abstract states that the status of the theory is sensitive to additional set-theoretic axioms, and that is certainly fascinating!










set-theory operator-algebras






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 14 at 19:19







CopyPasteIt

















asked Jan 14 at 17:41









CopyPasteItCopyPasteIt

4,3771828




4,3771828












  • $begingroup$
    I'm pretty sure that the Diamond Axiom is the thing that's usually called the Diamond Principle, which has a wikipedia article containing an explicit statement of it.
    $endgroup$
    – user3482749
    Jan 14 at 18:01










  • $begingroup$
    It's called the diamond principle. en.m.wikipedia.org/wiki/Diamond_principle
    $endgroup$
    – Shervin Sorouri
    Jan 14 at 18:02






  • 1




    $begingroup$
    @ShervinSorouri Yea, I thought it was a bit fishy searching for $text{♢-Axiom}$, with some kind of a 1-char string!
    $endgroup$
    – CopyPasteIt
    Jan 14 at 18:25


















  • $begingroup$
    I'm pretty sure that the Diamond Axiom is the thing that's usually called the Diamond Principle, which has a wikipedia article containing an explicit statement of it.
    $endgroup$
    – user3482749
    Jan 14 at 18:01










  • $begingroup$
    It's called the diamond principle. en.m.wikipedia.org/wiki/Diamond_principle
    $endgroup$
    – Shervin Sorouri
    Jan 14 at 18:02






  • 1




    $begingroup$
    @ShervinSorouri Yea, I thought it was a bit fishy searching for $text{♢-Axiom}$, with some kind of a 1-char string!
    $endgroup$
    – CopyPasteIt
    Jan 14 at 18:25
















$begingroup$
I'm pretty sure that the Diamond Axiom is the thing that's usually called the Diamond Principle, which has a wikipedia article containing an explicit statement of it.
$endgroup$
– user3482749
Jan 14 at 18:01




$begingroup$
I'm pretty sure that the Diamond Axiom is the thing that's usually called the Diamond Principle, which has a wikipedia article containing an explicit statement of it.
$endgroup$
– user3482749
Jan 14 at 18:01












$begingroup$
It's called the diamond principle. en.m.wikipedia.org/wiki/Diamond_principle
$endgroup$
– Shervin Sorouri
Jan 14 at 18:02




$begingroup$
It's called the diamond principle. en.m.wikipedia.org/wiki/Diamond_principle
$endgroup$
– Shervin Sorouri
Jan 14 at 18:02




1




1




$begingroup$
@ShervinSorouri Yea, I thought it was a bit fishy searching for $text{♢-Axiom}$, with some kind of a 1-char string!
$endgroup$
– CopyPasteIt
Jan 14 at 18:25




$begingroup$
@ShervinSorouri Yea, I thought it was a bit fishy searching for $text{♢-Axiom}$, with some kind of a 1-char string!
$endgroup$
– CopyPasteIt
Jan 14 at 18:25










1 Answer
1






active

oldest

votes


















5












$begingroup$

The principle $lozenge$ (diamond) is in a sense the right set-theoretic version of the continuum hypothesis, as it presents it instead as a reflection principle. Formally, it asserts that there is a diamond sequence, that is, a sequence $(A_alpha:alpha<omega_1)$ such that




  1. each $A_alpha$ is a subset of $alpha$,

  2. for each $Asubseteq omega_1$ there is an infinite $alpha$ such that $Acapalpha=A_alpha$.


Equivalently, we can require that the equality $Acap alpha = A_alpha$ holds for a stationary set of $alpha$, and we can also weaken the requirement that $A_alphasubseteqalpha$ to instead require that each $A_alpha$ is now a countable family of subsets of $alpha$, with 2 modified to assert that stationarily often $Acapalpha$ is a member of the $alpha$th family. Devlin and Kunen studied some of these variants.



The principle was introduced by Jensen in his paper on fine-structure theory, where he shows that it follows from the assumption that $V=L$. Note that, by taking $A$ a subset of $omega$, the principle implies that any such subset appears in the list, so $|mathcal P(omega)|=aleph_1$.



The principle is useful to carry out recursive constructions of objects of size $omega_1$, particularly when we want our object $O$ to satisfy certain property $P(O,A)$ for any $Asubseteqomega_1$. The intuitive idea is that it should be enough instead to ensure that approximations $O_alpha$, $alpha<omega_1$, of the object approximately satisfy the required property, not with respect to each $A$ but instead with respect to $A_alpha$. Jensen used the principle to build Suslin trees, and it has since found many applications in analysis, set-theoretic topology, algebra, and set theory proper.



Versions $lozenge_{kappa^+}$ of the axiom also exist for other cardinals, requiring the existence of an appropriate family $(A_alpha:alpha<kappa^+)$ with each $A_alphasubseteqalpha$ and the $A_alpha$ predicting each $Asubseteqkappa^+$ stationarily often. This principle implies $2^kappa=kappa^+$, and it is a celebrated theorem of Shelah that, other than for $kappa=aleph_0$, the converse holds.



For $lozenge$ itself, it is consistent that CH holds and the principle fails, and this is related to certain uniformization principles.





Some references:




  1. MR0309729 (46 #8834). Jensen, R. Björn. The fine structure of the constructible hierarchy. With a section by Jack Silver. Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443.


  2. MR0523488 (80c:03050). Devlin, Keith J. Variations on $lozenge$. J. Symbolic Logic 44 (1979), no. 1, 51–58.


  3. MR2596054 (2011m:03084). Shelah, Saharon. Diamonds. Proc. Amer. Math. Soc. 138 (2010), no. 6, 2151–2161.


  4. MR2777747 (2012k:03116). Rinot, Assaf. Jensen's diamond principle and its relatives. Set theory and its applications, 125–156, Contemp. Math., 533, Amer. Math. Soc., Providence, RI, 2011.







share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
    $endgroup$
    – DanielWainfleet
    Jan 14 at 22:44












Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073509%2fwhat-is-the-text-axiom-now-known-to-be-the-diamond-principle-axiom%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









5












$begingroup$

The principle $lozenge$ (diamond) is in a sense the right set-theoretic version of the continuum hypothesis, as it presents it instead as a reflection principle. Formally, it asserts that there is a diamond sequence, that is, a sequence $(A_alpha:alpha<omega_1)$ such that




  1. each $A_alpha$ is a subset of $alpha$,

  2. for each $Asubseteq omega_1$ there is an infinite $alpha$ such that $Acapalpha=A_alpha$.


Equivalently, we can require that the equality $Acap alpha = A_alpha$ holds for a stationary set of $alpha$, and we can also weaken the requirement that $A_alphasubseteqalpha$ to instead require that each $A_alpha$ is now a countable family of subsets of $alpha$, with 2 modified to assert that stationarily often $Acapalpha$ is a member of the $alpha$th family. Devlin and Kunen studied some of these variants.



The principle was introduced by Jensen in his paper on fine-structure theory, where he shows that it follows from the assumption that $V=L$. Note that, by taking $A$ a subset of $omega$, the principle implies that any such subset appears in the list, so $|mathcal P(omega)|=aleph_1$.



The principle is useful to carry out recursive constructions of objects of size $omega_1$, particularly when we want our object $O$ to satisfy certain property $P(O,A)$ for any $Asubseteqomega_1$. The intuitive idea is that it should be enough instead to ensure that approximations $O_alpha$, $alpha<omega_1$, of the object approximately satisfy the required property, not with respect to each $A$ but instead with respect to $A_alpha$. Jensen used the principle to build Suslin trees, and it has since found many applications in analysis, set-theoretic topology, algebra, and set theory proper.



Versions $lozenge_{kappa^+}$ of the axiom also exist for other cardinals, requiring the existence of an appropriate family $(A_alpha:alpha<kappa^+)$ with each $A_alphasubseteqalpha$ and the $A_alpha$ predicting each $Asubseteqkappa^+$ stationarily often. This principle implies $2^kappa=kappa^+$, and it is a celebrated theorem of Shelah that, other than for $kappa=aleph_0$, the converse holds.



For $lozenge$ itself, it is consistent that CH holds and the principle fails, and this is related to certain uniformization principles.





Some references:




  1. MR0309729 (46 #8834). Jensen, R. Björn. The fine structure of the constructible hierarchy. With a section by Jack Silver. Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443.


  2. MR0523488 (80c:03050). Devlin, Keith J. Variations on $lozenge$. J. Symbolic Logic 44 (1979), no. 1, 51–58.


  3. MR2596054 (2011m:03084). Shelah, Saharon. Diamonds. Proc. Amer. Math. Soc. 138 (2010), no. 6, 2151–2161.


  4. MR2777747 (2012k:03116). Rinot, Assaf. Jensen's diamond principle and its relatives. Set theory and its applications, 125–156, Contemp. Math., 533, Amer. Math. Soc., Providence, RI, 2011.







share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
    $endgroup$
    – DanielWainfleet
    Jan 14 at 22:44
















5












$begingroup$

The principle $lozenge$ (diamond) is in a sense the right set-theoretic version of the continuum hypothesis, as it presents it instead as a reflection principle. Formally, it asserts that there is a diamond sequence, that is, a sequence $(A_alpha:alpha<omega_1)$ such that




  1. each $A_alpha$ is a subset of $alpha$,

  2. for each $Asubseteq omega_1$ there is an infinite $alpha$ such that $Acapalpha=A_alpha$.


Equivalently, we can require that the equality $Acap alpha = A_alpha$ holds for a stationary set of $alpha$, and we can also weaken the requirement that $A_alphasubseteqalpha$ to instead require that each $A_alpha$ is now a countable family of subsets of $alpha$, with 2 modified to assert that stationarily often $Acapalpha$ is a member of the $alpha$th family. Devlin and Kunen studied some of these variants.



The principle was introduced by Jensen in his paper on fine-structure theory, where he shows that it follows from the assumption that $V=L$. Note that, by taking $A$ a subset of $omega$, the principle implies that any such subset appears in the list, so $|mathcal P(omega)|=aleph_1$.



The principle is useful to carry out recursive constructions of objects of size $omega_1$, particularly when we want our object $O$ to satisfy certain property $P(O,A)$ for any $Asubseteqomega_1$. The intuitive idea is that it should be enough instead to ensure that approximations $O_alpha$, $alpha<omega_1$, of the object approximately satisfy the required property, not with respect to each $A$ but instead with respect to $A_alpha$. Jensen used the principle to build Suslin trees, and it has since found many applications in analysis, set-theoretic topology, algebra, and set theory proper.



Versions $lozenge_{kappa^+}$ of the axiom also exist for other cardinals, requiring the existence of an appropriate family $(A_alpha:alpha<kappa^+)$ with each $A_alphasubseteqalpha$ and the $A_alpha$ predicting each $Asubseteqkappa^+$ stationarily often. This principle implies $2^kappa=kappa^+$, and it is a celebrated theorem of Shelah that, other than for $kappa=aleph_0$, the converse holds.



For $lozenge$ itself, it is consistent that CH holds and the principle fails, and this is related to certain uniformization principles.





Some references:




  1. MR0309729 (46 #8834). Jensen, R. Björn. The fine structure of the constructible hierarchy. With a section by Jack Silver. Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443.


  2. MR0523488 (80c:03050). Devlin, Keith J. Variations on $lozenge$. J. Symbolic Logic 44 (1979), no. 1, 51–58.


  3. MR2596054 (2011m:03084). Shelah, Saharon. Diamonds. Proc. Amer. Math. Soc. 138 (2010), no. 6, 2151–2161.


  4. MR2777747 (2012k:03116). Rinot, Assaf. Jensen's diamond principle and its relatives. Set theory and its applications, 125–156, Contemp. Math., 533, Amer. Math. Soc., Providence, RI, 2011.







share|cite|improve this answer









$endgroup$









  • 1




    $begingroup$
    To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
    $endgroup$
    – DanielWainfleet
    Jan 14 at 22:44














5












5








5





$begingroup$

The principle $lozenge$ (diamond) is in a sense the right set-theoretic version of the continuum hypothesis, as it presents it instead as a reflection principle. Formally, it asserts that there is a diamond sequence, that is, a sequence $(A_alpha:alpha<omega_1)$ such that




  1. each $A_alpha$ is a subset of $alpha$,

  2. for each $Asubseteq omega_1$ there is an infinite $alpha$ such that $Acapalpha=A_alpha$.


Equivalently, we can require that the equality $Acap alpha = A_alpha$ holds for a stationary set of $alpha$, and we can also weaken the requirement that $A_alphasubseteqalpha$ to instead require that each $A_alpha$ is now a countable family of subsets of $alpha$, with 2 modified to assert that stationarily often $Acapalpha$ is a member of the $alpha$th family. Devlin and Kunen studied some of these variants.



The principle was introduced by Jensen in his paper on fine-structure theory, where he shows that it follows from the assumption that $V=L$. Note that, by taking $A$ a subset of $omega$, the principle implies that any such subset appears in the list, so $|mathcal P(omega)|=aleph_1$.



The principle is useful to carry out recursive constructions of objects of size $omega_1$, particularly when we want our object $O$ to satisfy certain property $P(O,A)$ for any $Asubseteqomega_1$. The intuitive idea is that it should be enough instead to ensure that approximations $O_alpha$, $alpha<omega_1$, of the object approximately satisfy the required property, not with respect to each $A$ but instead with respect to $A_alpha$. Jensen used the principle to build Suslin trees, and it has since found many applications in analysis, set-theoretic topology, algebra, and set theory proper.



Versions $lozenge_{kappa^+}$ of the axiom also exist for other cardinals, requiring the existence of an appropriate family $(A_alpha:alpha<kappa^+)$ with each $A_alphasubseteqalpha$ and the $A_alpha$ predicting each $Asubseteqkappa^+$ stationarily often. This principle implies $2^kappa=kappa^+$, and it is a celebrated theorem of Shelah that, other than for $kappa=aleph_0$, the converse holds.



For $lozenge$ itself, it is consistent that CH holds and the principle fails, and this is related to certain uniformization principles.





Some references:




  1. MR0309729 (46 #8834). Jensen, R. Björn. The fine structure of the constructible hierarchy. With a section by Jack Silver. Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443.


  2. MR0523488 (80c:03050). Devlin, Keith J. Variations on $lozenge$. J. Symbolic Logic 44 (1979), no. 1, 51–58.


  3. MR2596054 (2011m:03084). Shelah, Saharon. Diamonds. Proc. Amer. Math. Soc. 138 (2010), no. 6, 2151–2161.


  4. MR2777747 (2012k:03116). Rinot, Assaf. Jensen's diamond principle and its relatives. Set theory and its applications, 125–156, Contemp. Math., 533, Amer. Math. Soc., Providence, RI, 2011.







share|cite|improve this answer









$endgroup$



The principle $lozenge$ (diamond) is in a sense the right set-theoretic version of the continuum hypothesis, as it presents it instead as a reflection principle. Formally, it asserts that there is a diamond sequence, that is, a sequence $(A_alpha:alpha<omega_1)$ such that




  1. each $A_alpha$ is a subset of $alpha$,

  2. for each $Asubseteq omega_1$ there is an infinite $alpha$ such that $Acapalpha=A_alpha$.


Equivalently, we can require that the equality $Acap alpha = A_alpha$ holds for a stationary set of $alpha$, and we can also weaken the requirement that $A_alphasubseteqalpha$ to instead require that each $A_alpha$ is now a countable family of subsets of $alpha$, with 2 modified to assert that stationarily often $Acapalpha$ is a member of the $alpha$th family. Devlin and Kunen studied some of these variants.



The principle was introduced by Jensen in his paper on fine-structure theory, where he shows that it follows from the assumption that $V=L$. Note that, by taking $A$ a subset of $omega$, the principle implies that any such subset appears in the list, so $|mathcal P(omega)|=aleph_1$.



The principle is useful to carry out recursive constructions of objects of size $omega_1$, particularly when we want our object $O$ to satisfy certain property $P(O,A)$ for any $Asubseteqomega_1$. The intuitive idea is that it should be enough instead to ensure that approximations $O_alpha$, $alpha<omega_1$, of the object approximately satisfy the required property, not with respect to each $A$ but instead with respect to $A_alpha$. Jensen used the principle to build Suslin trees, and it has since found many applications in analysis, set-theoretic topology, algebra, and set theory proper.



Versions $lozenge_{kappa^+}$ of the axiom also exist for other cardinals, requiring the existence of an appropriate family $(A_alpha:alpha<kappa^+)$ with each $A_alphasubseteqalpha$ and the $A_alpha$ predicting each $Asubseteqkappa^+$ stationarily often. This principle implies $2^kappa=kappa^+$, and it is a celebrated theorem of Shelah that, other than for $kappa=aleph_0$, the converse holds.



For $lozenge$ itself, it is consistent that CH holds and the principle fails, and this is related to certain uniformization principles.





Some references:




  1. MR0309729 (46 #8834). Jensen, R. Björn. The fine structure of the constructible hierarchy. With a section by Jack Silver. Ann. Math. Logic 4 (1972), 229–308; erratum, ibid. 4 (1972), 443.


  2. MR0523488 (80c:03050). Devlin, Keith J. Variations on $lozenge$. J. Symbolic Logic 44 (1979), no. 1, 51–58.


  3. MR2596054 (2011m:03084). Shelah, Saharon. Diamonds. Proc. Amer. Math. Soc. 138 (2010), no. 6, 2151–2161.


  4. MR2777747 (2012k:03116). Rinot, Assaf. Jensen's diamond principle and its relatives. Set theory and its applications, 125–156, Contemp. Math., 533, Amer. Math. Soc., Providence, RI, 2011.








share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jan 14 at 18:05









Andrés E. CaicedoAndrés E. Caicedo

66.1k8160252




66.1k8160252








  • 1




    $begingroup$
    To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
    $endgroup$
    – DanielWainfleet
    Jan 14 at 22:44














  • 1




    $begingroup$
    To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
    $endgroup$
    – DanielWainfleet
    Jan 14 at 22:44








1




1




$begingroup$
To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
$endgroup$
– DanielWainfleet
Jan 14 at 22:44




$begingroup$
To the proposer: You can also read about Diamond in "Set Theory: An Introduction To Independence Proofs" by K. Kunen.
$endgroup$
– DanielWainfleet
Jan 14 at 22:44


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073509%2fwhat-is-the-text-axiom-now-known-to-be-the-diamond-principle-axiom%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Bressuire

Cabo Verde

Gyllenstierna