Metraipolis › archive › dc_aaf5e791fc02

Cardinality of the K-cones below a non infinitely often $K$-trivial — arXiv:2610.39172

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39172
License (as archived)
CC0-1.0
Archived
2026-11-01T02:39:50.439Z
SHA-256 of the archived text
39e4b40f138ac961c470eaef4b55ae733aca20d91fcc81b0d24b3f4857ccf887
Stable URL of this page
https://metraipolis.com/documento/dc_aaf5e791fc02

How to cite

Cardinality of the K-cones below a non infinitely often $K$-trivial — arXiv:2610.39172 — arXiv (en), https://arxiv.org/abs/2610.39172 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aaf5e791fc02 (Metraipolis archive dc_aaf5e791fc02, sha256 39e4b40f138ac961c470eaef4b55ae733aca20d91fcc81b0d24b3f4857ccf887)
BibTeX
@misc{dcaaf5e791fc02,
  title = {Cardinality of the K-cones below a non infinitely often $K$-trivial — arXiv:2610.39172},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39172},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aaf5e791fc02; sha256 39e4b40f138ac961c470eaef4b55ae733aca20d91fcc81b0d24b3f4857ccf887},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39172. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Given a real $x\in 2^\omega$, how many reals are there that are simpler (or equally simple) to describe than $x$. With ``simpler to describe" characterized by $K$-complexity of initial segments (hence we call such $y$ with $y\leq_K x$ a solution to $x$), if $x$ is infinitely often $K$-trivial (hence i.o. $K$-trivial), then a simple counting argument shows that the number of solutions to $x$ is countable. If $x$ is non i.o. $K$-trivial, then must it admit uncountably many solutions? Motivated by this question, we show that: (1) There is a non i.o. $K$-trivial $x$ such that most of its solution is i.o. $K$-trivial. i.e., Only countably many solution to $x$ are non i.o. $K$-trivial. In particular, the cardinality of $K$-degree of $x$ is countable. (2) There is a minimal pair of K-degree (meaning their common solutions are all $K$-trivial) so that each of the pair is non i.o. $K$-trivial, generalizing a result of Csima and Montalbán (where the pair is not required to be non i.o. $K$-trivial but non $K$-trivial). (3) There is a non i.o. $K$-trivial $x$ whose $\Delta_K$ complexity grows arbitrarily slow (in a weak sense: $\inf_{m\geq n}\Delta_K(x\upharpoonright m)\leq h(n)$ with $h$ a given unbounded and nondecreasing function) such that $x$ admits uncountably many solutions. (4) An ample excess lemma holds for non i.o. $K$-trivial. Namely: $$ \sum_n 2^{-(K(x\upharpoonright n)- \log_2 n)}<\infty. $$ for all non i.o. $K$-trivial $x$. Actually, this even holds for non i.o. $b$-$K$-trivial with $b$ only depends on the universal prefix free machine. The same argument also gives a constant complexity return phenomenon for $K$-trivial where this constant only depends on the universal prefix free machine.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.39172 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:58.499Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).