Defect Cocycles and the Structure of Finite Process Monoids
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917180682010624 |
|---|---|
| author | Vella, Paolo |
| author_facet | Vella, Paolo |
| contents | We study positive subunital maps on ordered effect spaces and introduce the defect $d(T) = u - T(u)$, which satisfies a cocycle identity under composition. Using only this identity and elementary order-theoretic arguments -- requiring no spectral decomposition or dimension-dependent techniques -- we prove that in any finite composition-closed family of positive subunital maps, defects are eventually annihilated under iteration (Theorem 4.1), with an explicit bound linear in the family size. Under a persistence hypothesis (nonzero positive elements map to nonzero positive elements), we establish that all maps in such families must be unital. For completely positive maps on finite-dimensional matrix algebras, we then prove a sharp dimension-dependent bound: the stabilization index satisfies $n_T \le d$ where $d$ is the Hilbert space dimension, independent of the family size. This bound is achieved by a shift channel construction. These results provide a structural explanation for why finite operational repertoires in process theories cannot sustain systematic information loss, with applications to quantum foundations and categorical probability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_00824 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Defect Cocycles and the Structure of Finite Process Monoids Vella, Paolo Functional Analysis Mathematical Physics Operator Algebras 81P16, 46L07, 18C50 We study positive subunital maps on ordered effect spaces and introduce the defect $d(T) = u - T(u)$, which satisfies a cocycle identity under composition. Using only this identity and elementary order-theoretic arguments -- requiring no spectral decomposition or dimension-dependent techniques -- we prove that in any finite composition-closed family of positive subunital maps, defects are eventually annihilated under iteration (Theorem 4.1), with an explicit bound linear in the family size. Under a persistence hypothesis (nonzero positive elements map to nonzero positive elements), we establish that all maps in such families must be unital. For completely positive maps on finite-dimensional matrix algebras, we then prove a sharp dimension-dependent bound: the stabilization index satisfies $n_T \le d$ where $d$ is the Hilbert space dimension, independent of the family size. This bound is achieved by a shift channel construction. These results provide a structural explanation for why finite operational repertoires in process theories cannot sustain systematic information loss, with applications to quantum foundations and categorical probability. |
| title | Defect Cocycles and the Structure of Finite Process Monoids |
| topic | Functional Analysis Mathematical Physics Operator Algebras 81P16, 46L07, 18C50 |
| url | https://arxiv.org/abs/2601.00824 |