Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
PCF theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Unsolved problems == The most notorious conjecture in pcf theory states that |pcf(''A'')|=|''A''| holds for every set ''A'' of regular cardinals with |''A''|<min(''A''). This would imply that if β΅<sub>Ο</sub> is strong limit, then the sharp bound <div style="text-align: center;"><math>2^{\aleph_\omega}<\aleph_{\omega_1}</math></div> holds. The analogous bound <div style="text-align: center;"><math>2^{\aleph_{\omega_1}}<\aleph_{\omega_2}</math></div> follows from [[Chang's conjecture]] ([[Menachem Magidor|Magidor]]) or even from the nonexistence of a [[Kurepa tree]] ([[Saharon Shelah|Shelah]]). A weaker, still unsolved conjecture states that if |''A''|<min(''A''), then pcf(''A'') has no inaccessible limit point. This is equivalent to the statement that pcf(pcf(''A''))=pcf(''A'').
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)