Metraipolis › archive › dc_ef616861d0ee

Finite Dependence and Invariance Hierarchies for Finitely Supported Structures — arXiv:2609.15879

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15879
License (as archived)
CC0-1.0
Archived
2026-10-16T01:38:27.550Z
SHA-256 of the archived text
c9f2740e26c9a6e81fce6e01393c804720e962ecaed8f0918de302b0b7d01dda
Stable URL of this page
https://metraipolis.com/documento/dc_ef616861d0ee

How to cite

Finite Dependence and Invariance Hierarchies for Finitely Supported Structures — arXiv:2609.15879 — arXiv (en), https://arxiv.org/abs/2609.15879 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef616861d0ee (Metraipolis archive dc_ef616861d0ee, sha256 c9f2740e26c9a6e81fce6e01393c804720e962ecaed8f0918de302b0b7d01dda)
BibTeX
@misc{dcef616861d0ee,
  title = {Finite Dependence and Invariance Hierarchies for Finitely Supported Structures — arXiv:2609.15879},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15879},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef616861d0ee; sha256 c9f2740e26c9a6e81fce6e01393c804720e962ecaed8f0918de302b0b7d01dda},
  year = {2026}
}

Archived text

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

Finite support indicates that the dependence is limited, but not how each finite context controls what can be observed. For a data symmetry G \leq Sym(A) and a finitely supported G-set X, we study the finite-dependence profile X^S = {x : Fix_G(S) fixes x}, indexed by finite contexts S \subseteq A. For relations on A^n this yields Boolean algebras B^{(n)}_{G,S} = Inv_n(Fix_G(S)), forming the invariance hierarchy. The hierarchy separates several nominal principles. Its meet law is the relation-algebra form of the Bojanczyk-Klin-Lasota least-support criterion, while level injectivity is fungibility. The independent join law governs composition across unions of contexts; it holds for locally oligomorphic automorphism groups of ultrahomogeneous structures in purely relational languages of arity at most two, but can fail for unary observations over ternary data. Freshness remains valid sort by sort, and its unrestricted some/any form characterizes full equality symmetry among closed groups. With least supports, orbit-finiteness implies finite context levels and a uniform support bound; under local oligomorphicity the converse also holds. Pointwise closure does not change the profile, and standard atomic-site presentations show that suitable ultrahomogeneous structures with the same age have equivalent action topoi, even though their material FSS universes may retain different external cardinal data. Contextual orientability gives a complementary pointed invariant whose threshold is the least support size of choice from unordered pairs. For countable omega-categorical structures with degenerate algebraic closure, the meet law is equivalent to weak elimination of imaginaries.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.LO).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Category Theory (math.CT); Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.15879 — 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-16T01:22:41.496Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).