Skip to content
DraconiticResearch
Search Sources API
186,086 studies31 sourcesUpdated 24 min ago
PreprintCC BY-NC-ND 4.0arXiv

Finite Dependence and Invariance Hierarchies for Finitely Supported Structures

Abstract

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.

Related

  1. Singularity of harmonic measure for finitely supported random walks
    Petr Kosenko, Giulio Tiozzo
    arXivPreprintarXiv licenceFull textDynamical systemsProbabilityarXiv
  2. Convergence of the Sinkhorn Riemannian metric for finitely supported measures
    Gilles Mordant, Liane Xu
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Generalized Frobenius Structures on Hurwitz Spaces, Their Open Extensions and Associated Principal Hierarchies
    Shilin Ma
    arXivPreprintarXiv licenceFull textMathematical physicsarXiv
  4. Reducing stable forking dependence to finitely many pregeometries
    Scott Mutchnik
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  5. Clustering extremal dependence structures via Wasserstein distances between angular measures
    Kamal Gasser, Francesco Ragone, Johan Segers
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{ciobanu2026finite,
  title = {{Finite Dependence and Invariance Hierarchies for Finitely Supported Structures}},
  author = {Gabriel Ciobanu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.15879},
  eprint = {2609.15879},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.15879},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Finite Dependence and Invariance Hierarchies for Finitely Supported Structures
AU  - Gabriel Ciobanu
PY  - 2026
DA  - 2026/09/14
PB  - arXiv
DO  - 10.48550/arxiv.2609.15879
UR  - https://arxiv.org/abs/2609.15879
AB  - 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.
ER  -