The splitting number can be smaller than the matrix chaos number
| dc.creator | Mildenberger, Heike | |
| dc.creator | Shelah, Saharon | |
| dc.date | 2000-11-22 | |
| dc.date.accessioned | 2026-07-07T04:38:47Z | |
| dc.date.available | 2026-07-07T04:38:47Z | |
| dc.description | Let chi be the minimum cardinal of a subset of 2^omega that cannot be made convergent by multiplication with a single Toeplitz matrix. By an application of creature forcing we show that s<chi is consistent. We thus answer a question by Vojtas. We give two kinds of models for the strict inequality. The first is the combination of an aleph_2-iteration of some proper forcing with adding aleph_1 random reals. The second kind of models is got by adding delta random reals to a model of MA_{< kappa} for some delta in [aleph_1,kappa). It was a conjecture of Blass that s=aleph_1<chi=kappa holds in such a model. For the analysis of the second model we again use the creature forcing from the first model. | |
| dc.identifier | https://arxiv.org/abs/math/0011188 | |
| dc.identifier | http://arxiv.org/abs/math/0011188 | |
| dc.identifier | Fund. Math. 171 No. 2 (2002) 167--176 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60417 | |
| dc.subject | Logic | |
| dc.title | The splitting number can be smaller than the matrix chaos number | |
| dc.type | text |