Metraipolis › archive › dc_bc2173448f65

Foundations of Stochastic Lexical Calculus: Semantic Descent and Random Dynamics on Probability Simplices — arXiv:2609.20207

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20207
License (as archived)
CC0-1.0
Archived
2026-10-10T03:48:15.678Z
SHA-256 of the archived text
be1f012c093ad451a3245908229c880c82e3458b4c7b8eea5ed2031242227c45
Stable URL of this page
https://metraipolis.com/documento/dc_bc2173448f65

How to cite

Foundations of Stochastic Lexical Calculus: Semantic Descent and Random Dynamics on Probability Simplices — arXiv:2609.20207 — arXiv (en), https://arxiv.org/abs/2609.20207 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bc2173448f65 (Metraipolis archive dc_bc2173448f65, sha256 be1f012c093ad451a3245908229c880c82e3458b4c7b8eea5ed2031242227c45)
BibTeX
@misc{dcbc2173448f65,
  title = {Foundations of Stochastic Lexical Calculus: Semantic Descent and Random Dynamics on Probability Simplices — arXiv:2609.20207},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20207},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bc2173448f65; sha256 be1f012c093ad451a3245908229c880c82e3458b4c7b8eea5ed2031242227c45},
  year = {2026}
}

Archived text

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

Large language models produce prompt-dependent probabilities over words, whereas scientific systems require uncertainty over meaningful states that can be updated as evidence arrives. We develop an observable framework for determining when language-derived probabilities support such a sequential state representation. Theoretically, we define typed measurable transformations of contextual language, construct a minimal closed representation, and give necessary and sufficient conditions for semantic updates to exist uniquely. We bound irreducible nonclosure and accumulated error, and under average contraction prove existence, uniqueness and stability of an external random recursion on a probability simplex. These results define a stochastic lexical calculus without attributing an internal calculus to the language model. Empirically, frozen experiments test the observable implications. Raw prompt-conditioned probabilities fail the prespecified invariance gate; after prompt-specific calibration, a common three-state representation passes the stability gates and covers 28 of 30 untouched eight-step paths, or 0.933 at nominal level 0.90. Accordingly, language probabilities support a stochastic state only conditionally on verified closure, stability and coverage within a declared operating domain.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-18 in cs.CL).
Categorie arXiv: Computation and Language (cs.CL) ; Category Theory (math.CT); Probability (math.PR); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.20207 — 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-10-10T03:24:08.153Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).