<?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=74.88.3.83</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=74.88.3.83"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/74.88.3.83"/>
	<updated>2026-09-29T15:16:46Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Estrada_index&amp;diff=25013</id>
		<title>Estrada index</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Estrada_index&amp;diff=25013"/>
		<updated>2013-05-05T18:46:15Z</updated>

		<summary type="html">&lt;p&gt;74.88.3.83: /* Derivation */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[set theory]], a branch of mathematics, the &#039;&#039;&#039;Milner &amp;amp;ndash; Rado paradox&#039;&#039;&#039;, found by {{harvs|txt|first1=Eric Charles|last1=Milner|author1-link=Eric Charles Milner|first2=Richard|last2=Rado|author2-link=Richard Rado|year=1965}}, states that every [[ordinal number]] α less than the [[Successor cardinal|successor]] &#039;&#039;&amp;amp;kappa;&#039;&#039;&amp;lt;sup&amp;gt;+&amp;lt;/sup&amp;gt; of some [[cardinal number]] κ can be written as the union of sets &#039;&#039;X&#039;&#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;,&#039;&#039;X&#039;&#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;,... where &#039;&#039;X&#039;&#039;&amp;lt;sub&amp;gt;&#039;&#039;n&#039;&#039;&amp;lt;/sub&amp;gt; is of [[order type]] at most &#039;&#039;&amp;amp;kappa;&#039;&#039;&amp;lt;sup&amp;gt;&#039;&#039;n&#039;&#039;&amp;lt;/sup&amp;gt; for &#039;&#039;n&#039;&#039; a positive integer.&lt;br /&gt;
&lt;br /&gt;
==Proof==&lt;br /&gt;
Let &#039;&#039;&amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt;&#039;&#039;  be a limit ordinal, and for each &#039;&#039;&amp;lt;math&amp;gt;\beta&amp;lt;\alpha&amp;lt;/math&amp;gt;&#039;&#039;, let &#039;&#039;&amp;lt;math&amp;gt;\{X_\beta^n\}_n&amp;lt;/math&amp;gt;&#039;&#039; be the obvious thing. &lt;br /&gt;
&lt;br /&gt;
Fix an increasing sequence &amp;lt;math&amp;gt;\{\beta_\gamma\}_{\gamma&amp;lt;\mathrm{cf}\,(\alpha)}&amp;lt;/math&amp;gt; [[Cofinality|cofinal]] in &amp;lt;math&amp;gt;\alpha&amp;lt;/math&amp;gt; with &amp;lt;math&amp;gt;\beta_0=1&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Note &amp;lt;math&amp;gt;\mathrm{cf}\,(\alpha)\le\kappa&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
Define:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;X^\alpha _0 = \{0\};\ \ X^\alpha_{n+1} = \bigcup_\gamma X^{\beta_{\gamma+1}}_n\setminus \beta_\gamma&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Observe that:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\bigcup_{n&amp;gt;0}X^\alpha_n = \bigcup _n \bigcup _\gamma X^{\beta_{\gamma+1}}_n\setminus \beta_\gamma = \bigcup_\gamma \bigcup_n X^{\beta_{\gamma+1}}_n\setminus \beta_\gamma = \bigcup_\gamma \beta_{\gamma+1}\setminus \beta_\gamma = \alpha \setminus \beta_0&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and so  &#039;&#039;&amp;lt;math&amp;gt;\bigcup_nX^\alpha_n = \alpha&amp;lt;/math&amp;gt;&#039;&#039;.&lt;br /&gt;
&lt;br /&gt;
Let &amp;lt;math&amp;gt;\mathrm{ot}\,(A)&amp;lt;/math&amp;gt; be the [[order type]] of &#039;&#039;&amp;lt;math&amp;gt;A&amp;lt;/math&amp;gt;&#039;&#039;. As for the order types, clearly &amp;lt;math&amp;gt;\mathrm{ot}(X^\alpha_0) = 1 = \kappa^0&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Noting that the sets &amp;lt;math&amp;gt;\beta_{\gamma+1}\setminus\beta_\gamma&amp;lt;/math&amp;gt; form a consecutive sequence of ordinal intervals, and that each &amp;lt;math&amp;gt;X^{\beta_{\gamma+1}}_n\setminus\beta_\gamma&amp;lt;/math&amp;gt; is a tail segment of &amp;lt;math&amp;gt;X^{\beta_{\gamma+1}}_n&amp;lt;/math&amp;gt; we get that:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\mathrm{ot}(X^\alpha_{n+1}) = \sum_\gamma \mathrm{ot}(X^{\beta_{\gamma+1}}_n\setminus\beta_\gamma) \leq \sum_\gamma \kappa^n = \kappa^n \cdot \mathrm{cf}(\alpha) \leq \kappa^n\cdot\kappa = \kappa^{n+1}&amp;lt;/math&amp;gt;&lt;br /&gt;
==References==&lt;br /&gt;
*{{Citation | last1=Milner | first1=E. C. | last2=Rado | first2=R. | title=The pigeon-hole principle for ordinal numbers | doi=10.1112/plms/s3-15.1.750 | mr=0190003 | year=1965 | journal= Proc. London Math. Soc. (3)  | volume=15 | pages=750–768}}&lt;br /&gt;
*[http://math.stackexchange.com/questions/440184/how-to-prove-milner-rado-paradox How to prove Milner-Rado Paradox? - Mathematics Stack Exchange]&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Milner-Rado paradox}}&lt;br /&gt;
[[Category:Set theory]]&lt;br /&gt;
[[Category:Paradoxes]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{mathlogic-stub}}&lt;/div&gt;</summary>
		<author><name>74.88.3.83</name></author>
	</entry>
</feed>