<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=129.10.63.90</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=129.10.63.90"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/129.10.63.90"/>
	<updated>2026-08-06T03:33:28Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Block_matrix_pseudoinverse&amp;diff=13462</id>
		<title>Block matrix pseudoinverse</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Block_matrix_pseudoinverse&amp;diff=13462"/>
		<updated>2014-01-04T23:29:36Z</updated>

		<summary type="html">&lt;p&gt;129.10.63.90: /* External links */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[set theory]], &#039;&#039;&#039;Easton&#039;s theorem&#039;&#039;&#039; is a result on the possible [[cardinal number]]s of [[powerset]]s.  {{harvtxt|Easton|1970}} (extending a result of [[Robert M. Solovay]]) showed via [[forcing (mathematics)|forcing]] that&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; \kappa &amp;lt; \operatorname{cf}(2^\kappa)\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and, for &amp;lt;math&amp;gt; \kappa &amp;lt; \lambda\,&amp;lt;/math&amp;gt;, that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; 2^\kappa\le 2^\lambda\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
are the only constraints on permissible values for 2&amp;lt;sup&amp;gt;κ&amp;lt;/sup&amp;gt; when κ is a [[regular cardinal]].&lt;br /&gt;
&lt;br /&gt;
== Statement of the theorem ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Easton&#039;s theorem&#039;&#039;&#039; states that if &#039;&#039;G&#039;&#039; is a class function whose domain consists of [[ordinal number|ordinals]] and whose range consists of ordinals such that&lt;br /&gt;
# &#039;&#039;G&#039;&#039; is non-decreasing,&lt;br /&gt;
# the [[cofinality]] of &amp;lt;math&amp;gt;\aleph_{G(\alpha)}&amp;lt;/math&amp;gt; is greater than &amp;lt;math&amp;gt;\aleph_{\alpha}&amp;lt;/math&amp;gt; for each α in the domain of G, and&lt;br /&gt;
# &amp;lt;math&amp;gt;\aleph_{\alpha}&amp;lt;/math&amp;gt; is regular for each α in the domain of G,&lt;br /&gt;
&lt;br /&gt;
then there is a model of ZFC such that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;2^{\aleph_{\alpha}} = \aleph_{G(\alpha)}\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
for each &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; in the domain of &#039;&#039;G&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
The proof of Easton&#039;s theorem uses [[forcing (mathematics)|forcing]] with a [[proper class]] of forcing conditions.&lt;br /&gt;
&lt;br /&gt;
All conditions in the theorem are necessary.  Condition 1 is a well known property of cardinality, while condition 2 follows from [[König&#039;s theorem (set theory)|König&#039;s theorem]].&lt;br /&gt;
&lt;br /&gt;
== No extension to singular cardinals ==&lt;br /&gt;
&lt;br /&gt;
{{harvtxt|Silver|1975}} proved that a singular cardinal of uncountable cofinality cannot be the smallest cardinal for which the [[generalized continuum hypothesis]] fails. This shows that Easton&#039;s theorem cannot be extended to the class of all cardinals.&lt;br /&gt;
The program of [[PCF theory]] gives results on the possible values of&lt;br /&gt;
&amp;lt;math&amp;gt;2^\lambda&amp;lt;/math&amp;gt; for [[singular cardinal]]s &amp;lt;math&amp;gt;\lambda&amp;lt;/math&amp;gt;. PCF theory shows that the values of the [[continuum function]] on singular cardinals are strongly influenced by the values on smaller cardinals, whereas Easton&#039;s theorem shows that the values of the continuum function on [[regular cardinal]]s are only weakly influenced by the values on smaller cardinals.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Singular cardinal hypothesis]]&lt;br /&gt;
* [[Aleph number]]&lt;br /&gt;
* [[Beth number]]&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
*{{citation|authorlink=William Bigelow Easton|first= W.|last= Easton|title= Powers of regular cardinals|journal=Ann. Math. Logic|volume=1|year=1970|issue=2|pages= 139–178&lt;br /&gt;
|doi=10.1016/0003-4843(70)90012-4 }}&lt;br /&gt;
*{{citation|mr=0429564|authorlink=Jack Silver|last= Silver|first= Jack|chapter=On the singular cardinals problem|title=  Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974)|volume= 1|pages= 265–268|publisher= Canad. Math. Congress|publication-place= Montreal, Que.|year= 1975}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Set theory]]&lt;br /&gt;
[[Category:Theorems in the foundations of mathematics]]&lt;br /&gt;
[[Category:Cardinal numbers]]&lt;br /&gt;
[[Category:Forcing (mathematics)]]&lt;br /&gt;
[[Category:Independence results]]&lt;/div&gt;</summary>
		<author><name>129.10.63.90</name></author>
	</entry>
</feed>