Ulam matrix

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematical set theory, an Ulam matrix is an array of subsets of a cardinal number with certain properties. Ulam matrices were introduced by Stanislaw Ulam in his 1930 work on measurable cardinals: they may be used, for example, to show that a real-valued measurable cardinal is weakly inaccessible.

In mathematical set theory, an Ulam matrix is an array of subsets of a cardinal number with certain properties. Ulam matrices were introduced by Stanislaw Ulam in his 1930 work on measurable cardinals: they may be used, for example, to show that a real-valued measurable cardinal is weakly inaccessible.

Definition

Suppose that \kappa and \lambda are cardinal numbers, and let \mathcal F be a \lambda -complete filter on \lambda . An Ulam matrix is a collection of subsets A_{\alpha \beta} of \lambda indexed by \alpha \in \kappa, \beta \in \lambda such that If \beta \ne \gamma \in \lambda then A_{\alpha \beta} and A_{\alpha \gamma} are disjoint. For each \beta \in \lambda , the union over \alpha \in \kappa of the sets A_{\alpha \beta}, \, \bigcup\left\{A_{\alpha \beta}:\alpha \in \kappa\right\} , is in the filter \mathcal F .

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1365630029 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.