Closure Atlases and Local-to-Global Obstructions in Finite Closure Systems

Jaehwan Kim

A finite closure atlas has a global conservative realization exactly when no chart-visible obstruction occurs.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-06-26 13:17 UTC pith:NWWI62K7

load-bearing objection The paper gives a precise, finite obstruction test for when local closure systems on overlapping universes admit a conservative global extension, with the atlas-generated closure serving as that extension exactly when the test passes.

arxiv 2606.24909 v1 pith:NWWI62K7 submitted 2026-06-19 cs.LO math.RA

Closure Atlases and Local-to-Global Obstructions in Finite Closure Systems

Jaehwan Kim This is my paper

classification cs.LO math.RA

keywords closure operatorsfinite closure systemsclosure atlaseschart-visible obstructionconservative realizationlocal-to-globalatlas-generated closureindexed truth space

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper gives an exact criterion for when local closure systems on overlapping finite sets can be extended to a single global closure operator without adding new consequences inside any local chart. The atlas-generated closure is built by repeatedly applying each local closure operator to the parts of sets visible in its chart, yielding the least global closure that extends all the locals. The main theorem states that this construction is conservative precisely when no obstruction appears, meaning no globally forced consequence inside a chart fails to be a local consequence there. When the condition holds, the atlas-generated closure itself serves as the desired global realization, and the test is finite and computable.

Core claim

Given a finite family of local closure systems, its atlas-generated closure is obtained by repeatedly applying the local closure operators to the parts visible in each chart and is the least global closure operator extending all chart closures. A chart-visible obstruction is a consequence produced by this global propagation that lies inside a chart but is not validated by that chart's own closure operator. The main theorem proves that a finite closure atlas has a global conservative realization exactly when no such obstruction occurs; in that case the atlas-generated closure itself is the conservative realization.

What carries the argument

The atlas-generated closure, constructed by repeated application of local operators across overlaps, together with the chart-visible obstruction that detects when global propagation introduces a non-local consequence inside some chart.

Load-bearing premise

The universes are finite, the family of charts is finite, and the local closures are defined on overlapping subsets so that repeated application produces a well-defined global operator.

What would settle it

An explicit finite atlas in which a chart-visible obstruction is detected yet some other global closure operator still conservatively extends all the local ones would falsify the main theorem.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

When no obstruction occurs, the atlas-generated closure is the least global closure extending all chart closures.
The obstruction condition is finite and directly computable from the given atlas.
Overlap-compatible local closed theories glue by canonical union under the atlas-generated closure.
Reduced indexed spaces obtained by deleting closed theories can introduce spurious region consequences not present in the full space.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The obstruction test supplies a concrete decision procedure for conservative globalization that could be implemented directly on small finite instances.
The four-region membership decomposition for pairs of elements may offer a uniform way to track overlap behavior even when additional separation assumptions are dropped.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

The paper gives a precise, finite obstruction test for when local closure systems on overlapping universes admit a conservative global extension, with the atlas-generated closure serving as that extension exactly when the test passes.

read the letter

The core contribution is a new, exact criterion: a finite closure atlas has a conservative global realization if and only if the closure obtained by iterating the local operators produces no chart-visible obstruction. When the condition holds, that same generated closure is the realization. This is stated cleanly in the abstract and rests on the finiteness of the family and universes, which lets the iteration terminate and makes the obstruction directly checkable.

The paper does a few things solidly. It defines the atlas-generated closure as the least global extension and shows it arises from repeated local applications. The obstruction is defined as a consequence forced by the global propagation but rejected inside some chart, and the main theorem ties the absence of such obstructions to the existence of the conservative realization. The indexed representation layer is recorded as background: closed theories as contexts, region inclusion for consequence, and how deleting separators creates spurious inclusions. Overlap-compatible local theories glue by canonical union under the generated closure. All of this stays structural and finite.

Soft spots are limited. The work is explicitly finite, so it does not address whether the criterion lifts or fails in the infinite case. The logical reading is presented as an interpretation of the closure data rather than the primary object, which is fine but means the payoff for pure logicians may be narrower than for algebraists working on closure systems. The abstract supplies the theorem statement and definitions, but the full proof details are not visible here; the stress-test finds no internal gap, yet a referee would still want to see the exhaustion argument for obstructions.

This is for readers already working with closure operators or local-to-global questions in algebra and logic. Someone needing a computable test for conservative gluing will find the criterion useful. It is coherent on its own terms and supplies a new, checkable result, so it deserves peer review.

Referee Report

0 major / 1 minor

Summary. The paper studies finite closure operators on overlapping finite universes and gives an exact local-to-global obstruction criterion for conservative globalization. Given a finite family of local closure systems, the atlas-generated closure is obtained by repeatedly applying the local closure operators to the parts visible in each chart; this is the least global closure operator extending all chart closures. A chart-visible obstruction is a consequence produced by this global propagation that lies inside a chart but is not validated by that chart's own closure operator. The main theorem proves that a finite closure atlas has a global conservative realization exactly when no such obstruction occurs; in that case the atlas-generated closure itself is the conservative realization. The obstruction condition is finite and directly computable. The paper also develops an indexed representation layer for finite closure systems (selecting closed theories as contexts and representing elements by regions of selected closed theories) and shows that overlap-compatible local closed theories glue by canonical union under the atlas-generated closure.

Significance. If the main theorem holds, the result supplies a precise, finite, and directly computable characterization of when a family of local closure systems admits a conservative global extension. This is a substantive contribution to closure theory and its applications in logic, as it turns the local-to-global question into an effective check rather than an existence question. The indexed representation provides a concrete semantic view of closure consequence via region inclusion and reduced spaces, which may be useful for studying minimal models or spurious consequences. The framework is entirely structural and finitary, with no free parameters or ad-hoc axioms.

minor comments (1)

The abstract is information-dense; a short additional sentence clarifying how the indexed representation connects to the obstruction criterion would improve accessibility for readers outside the immediate subfield.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading and positive assessment of the manuscript. The recommendation for minor revision is noted. No major comments appear in the report, so there are no specific points requiring point-by-point response. Any minor editorial adjustments will be incorporated in the revised version.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation defines the atlas-generated closure independently via repeated application of the given local closure operators on overlapping finite universes. It then defines chart-visible obstructions as elements forced by this generated closure but not closed under a local chart operator. The main theorem states that a conservative global realization exists exactly when no obstruction occurs, and in that case the generated closure is the realization. This is a standard obstruction-characterization result whose proof relies on finiteness to guarantee that the generated operator is the least extension and that obstructions are exhaustive; the argument does not reduce the theorem statement to a self-definition of the realization, a fitted parameter renamed as prediction, or any self-citation chain. The indexed representation layer is explicitly described as motivational terminology and is not invoked in the load-bearing steps of the obstruction theorem.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper builds on standard closure theory axioms and the finiteness assumption to derive the obstruction criterion. No free parameters or new entities are introduced.

axioms (2)

standard math Closure operators are extensive, monotone and idempotent.
This is the standard definition invoked for all closure systems in the paper.
domain assumption The family of local closure systems is finite.
Required for the obstruction condition to be finite and directly computable as stated in the abstract.

pith-pipeline@v0.9.1-grok · 5792 in / 1337 out tokens · 37010 ms · 2026-06-26T13:17:16.712115+00:00 · methodology

0 comments

read the original abstract

This paper studies finite closure operators on overlapping finite universes and gives an exact local-to-global obstruction criterion for conservative globalization. Given a finite family of local closure systems, its atlas-generated closure is obtained by repeatedly applying the local closure operators to the parts visible in each chart. This closure is the least global closure operator extending all chart closures. A chart-visible obstruction is a consequence produced by this global propagation that lies inside a chart but is not validated by that chart's own closure operator. The main theorem proves that a finite closure atlas has a global conservative realization exactly when no such obstruction occurs; in that case the atlas-generated closure itself is the conservative realization. The obstruction condition is finite and directly computable. The paper also records the indexed representation layer motivating the terminology. For a finite closure system, an indexed truth space selects closed theories as contexts and represents each element by the region of selected closed theories containing it. Closure consequence is always sound for region inclusion, and the full indexed space of all closed theories recovers the original closure consequence exactly; reduced indexed spaces can therefore create spurious region consequences by deleting separating closed theories. A formal opposite gives a four-region membership decomposition - only one, only the other, both, and neither - unless additional separation assumptions are imposed. Finally, overlap-compatible local closed theories glue by canonical union under the atlas-generated closure. The framework is finite, structural, and closure-theoretic; the logical terminology is used only as an interpretation of the underlying closure data.

Figures

Figures reproduced from arXiv: 2606.24909 by Jaehwan Kim.

**Figure 2.** Figure 2: Atlas propagation without obstruction. The example illustrates why the atlas-generated closure is the canonical object: it contains exactly the consequences forced by repeated local propagation. It also shows that a propagated global consequence need not be an obstruction. The remaining question is whether any forced consequence becomes visible inside a chart where it was not locally valid. That question i… view at source ↗

**Figure 3.** Figure 3: A chart-visible obstruction: propagation forces p ⊢ r, but the pr-chart does not validate it. Remark 7.8 (Pairwise compatibility is insufficient). In the preceding example, no pair of charts directly disagrees on its overlap. The failure is caused by the interaction p ⊢pq q, q ⊢qr r. Any global closure extending the first two charts must satisfy p ⊢ r. But the third chart, whose language contains p and r, … view at source ↗

discussion (0)

Reference graph

Works this paper leans on

14 extracted references

[1]

Karell Bertet, Christophe Demko, Jean-François Viaud, and Clément Guérin,Lattices, closure systems and implication bases, Theoretical Computer Science743(2018), 93–109

2018
[2]

25, American Mathematical Society, Providence, RI, 1967

Garrett Birkhoff,Lattice theory, 3 ed., American Mathematical Society Colloquium Publications, vol. 25, American Mathematical Society, Providence, RI, 1967

1967
[3]

Blok and Don Pigozzi,Algebraizable logics, vol

Willem J. Blok and Don Pigozzi,Algebraizable logics, vol. 77, Memoirs of the American Mathematical Society, no. 396, American Mathematical Society, Providence, RI, 1989

1989
[4]

2, 241–269

Nathalie Caspard and Bernard Monjardet,The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey, Discrete Applied Mathematics127(2003), no. 2, 241–269

2003
[5]

B. A. Davey and H. A. Priestley,Introduction to lattices and order, 2 ed., Cambridge University Press, Cambridge, 2002

2002
[6]

4, 952–985

Ronald Fagin,Horn clauses and database dependencies, Journal of the ACM29(1982), no. 4, 952–985

1982
[7]

7, Springer-Verlag, Berlin, 1996

Josep Maria Font and Ramon Jansana,A general algebraic semantics for sentential logics, Lecture Notes in Logic, vol. 7, Springer-Verlag, Berlin, 1996

1996
[8]

CLOSURE ATLASES AND LOCAL-TO-GLOBAL OBSTRUCTIONS 23

Bernhard Ganter and Rudolf Wille,Formal concept analysis: Mathematical foundations, Springer-Verlag, Berlin and Heidelberg, 1999. CLOSURE ATLASES AND LOCAL-TO-GLOBAL OBSTRUCTIONS 23

1999
[9]

Jean-Louis Guigues and Vincent Duquenne,Familles minimales d’implications informatives résultant d’un tableau de données binaires, Mathématiques et Sciences Humaines95(1986), 5–18

1986
[10]

Wilfrid Hodges,Model theory, Cambridge University Press, Cambridge, 1993

1993
[11]

Saunders Mac Lane and Ieke Moerdijk,Sheaves in geometry and logic: A first introduction to topos theory, Springer-Verlag, New York, 1992

1992
[12]

David Maier,The theory of relational databases, Computer Science Press, Rockville, MD, 1983

1983
[13]

Alfred Tarski,Logic, semantics, metamathematics: Papers from 1923 to 1938, Clarendon Press, Oxford, 1956

1923
[14]

199, Kluwer Academic Publishers, Dordrecht, 1988

Ryszard Wójcicki,Theory of logical calculi: Basic theory of consequence operations, Synthese Library, vol. 199, Kluwer Academic Publishers, Dordrecht, 1988. Hankuk Academy of Foreign Studies, Yongin-si, Gyeonggi-do 17035, Republic of Korea Email address:020080@hafs.hs.kr

1988

[1] [1]

Karell Bertet, Christophe Demko, Jean-François Viaud, and Clément Guérin,Lattices, closure systems and implication bases, Theoretical Computer Science743(2018), 93–109

2018

[2] [2]

25, American Mathematical Society, Providence, RI, 1967

Garrett Birkhoff,Lattice theory, 3 ed., American Mathematical Society Colloquium Publications, vol. 25, American Mathematical Society, Providence, RI, 1967

1967

[3] [3]

Blok and Don Pigozzi,Algebraizable logics, vol

Willem J. Blok and Don Pigozzi,Algebraizable logics, vol. 77, Memoirs of the American Mathematical Society, no. 396, American Mathematical Society, Providence, RI, 1989

1989

[4] [4]

2, 241–269

Nathalie Caspard and Bernard Monjardet,The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey, Discrete Applied Mathematics127(2003), no. 2, 241–269

2003

[5] [5]

B. A. Davey and H. A. Priestley,Introduction to lattices and order, 2 ed., Cambridge University Press, Cambridge, 2002

2002

[6] [6]

4, 952–985

Ronald Fagin,Horn clauses and database dependencies, Journal of the ACM29(1982), no. 4, 952–985

1982

[7] [7]

7, Springer-Verlag, Berlin, 1996

Josep Maria Font and Ramon Jansana,A general algebraic semantics for sentential logics, Lecture Notes in Logic, vol. 7, Springer-Verlag, Berlin, 1996

1996

[8] [8]

CLOSURE ATLASES AND LOCAL-TO-GLOBAL OBSTRUCTIONS 23

Bernhard Ganter and Rudolf Wille,Formal concept analysis: Mathematical foundations, Springer-Verlag, Berlin and Heidelberg, 1999. CLOSURE ATLASES AND LOCAL-TO-GLOBAL OBSTRUCTIONS 23

1999

[9] [9]

Jean-Louis Guigues and Vincent Duquenne,Familles minimales d’implications informatives résultant d’un tableau de données binaires, Mathématiques et Sciences Humaines95(1986), 5–18

1986

[10] [10]

Wilfrid Hodges,Model theory, Cambridge University Press, Cambridge, 1993

1993

[11] [11]

Saunders Mac Lane and Ieke Moerdijk,Sheaves in geometry and logic: A first introduction to topos theory, Springer-Verlag, New York, 1992

1992

[12] [12]

David Maier,The theory of relational databases, Computer Science Press, Rockville, MD, 1983

1983

[13] [13]

Alfred Tarski,Logic, semantics, metamathematics: Papers from 1923 to 1938, Clarendon Press, Oxford, 1956

1923

[14] [14]

199, Kluwer Academic Publishers, Dordrecht, 1988

Ryszard Wójcicki,Theory of logical calculi: Basic theory of consequence operations, Synthese Library, vol. 199, Kluwer Academic Publishers, Dordrecht, 1988. Hankuk Academy of Foreign Studies, Yongin-si, Gyeonggi-do 17035, Republic of Korea Email address:020080@hafs.hs.kr

1988