Locales as spectral spaces

A frame is a complete distributive lattice that satisfies the infinite distributive law ${b \wedge \bigvee_{i \in I} a_i = \bigvee_{i \in I} b \wedge a_i}$ b ∧ ? i ∈ I a i = ? i ∈ I b ∧ a i . The lattice of open sets of a topological space is a frame. The frames form a category Fr. The category of locales is the opposite category Fr ^op . The category BDLat of bounded distributive lattices contains Fr as a subcategory. The category BDLat is anti-equivalent to the category of spectral spaces, Spec (via Stone duality). There is a subcategory of Spec that corresponds to the subcategory Fr under the anti-equivalence. The objects of this subcategory are called locales, the morphisms are the localic maps; the category is denoted by Loc. Thus locales are spectral spaces. The category Loc is equivalent to the category Fr ^op . A topological approach to locales is initiated via the systematic study of locales as spectral spaces. The first task is to characterize the objects and the morphisms of the category Spec that belong to the subcategory Loc. The relationship between the categories Top (topological spaces), Spec and Loc is studied. The notions of localic subspaces and localic points of a locale are introduced and studied. The localic subspaces of a locale X form an inverse frame, which is anti-isomorphic to the assembly associated with the frame of open and quasi-compact subsets of X.     

Group homomorphic encryption: characterizations, impossibility results, and applications

We give a complete characterization both in terms of security and design of all currently existing group homomorphic encryption schemes, i.e., existing encryption schemes with a group homomorphic decryption function such as ElGamal and Paillier. To this end, we formalize and identify the basic underlying structure of all existing schemes and say that such schemes are of shift-type. Then, we construct an abstract scheme that represents all shift-type schemes (i.e., every scheme occurs as an instantiation of the abstract scheme) and prove its IND-CCA1 (resp. IND-CPA) security equivalent to the hardness of an abstract problem called Splitting Oracle-Assisted Subgroup Membership Problem (SOAP) (resp. Subgroup Membership Problem, SMP). Roughly, SOAP asks for solving an SMP instance, i.e., for deciding whether a given ciphertext is an encryption of the neutral element of the ciphertext group, while allowing access to a certain oracle beforehand. Our results allow for contributing to a variety of open problems such as the IND-CCA1 security of Paillier’s scheme, or the use of linear codes in group homomorphic encryption. Furthermore, we design a new cryptosystem which provides features that are unique up to now: Its IND-CPA security is based on the k-linear problem introduced by Shacham, and Hofheinz and Kiltz, while its IND-CCA1 security is based on a new k-problem that we prove to have the same progressive property, namely that if the k-instance is easy in the generic group model, the (k+1)-instance is still hard.     

Proximity Frames and Regularization

It is well known that the category KHaus of compact Hausdorff spaces is dually equivalent to the category KRFrm of compact regular frames. By de Vries duality, KHaus is also dually equivalent to the category DeV of de Vries algebras, and so DeV is equivalent to KRFrm, where the latter equivalence can be described constructively through Booleanization. Our purpose here is to lift this circle of equivalences and dual equivalences to the setting of stably compact spaces. The dual equivalence of KHaus and KRFrm has a well-known generalization to a dual equivalence of the categories StKSp of stably compact spaces and StKFrm of stably compact frames. Here we give a common generalization of de Vries algebras and stably compact frames we call proximity frames. For the category PrFrm of proximity frames we introduce the notion of regularization that extends that of Booleanization. This yields the category RPrFrm of regular proximity frames. We show there are equivalences and dual equivalences among PrFrm, its subcategories StKFrm and RPrFrm, and StKSp. Restricting to the compact Hausdorff setting, the equivalences and dual equivalences among StKFrm, RPrFrm, and StKSp yield the known ones among KRFrm, DeV, and KHaus. The restriction of PrFrm to this setting provides a new category StrInc whose objects are frames with strong inclusions and whose morphisms and composition are generalizations of those in DeV. Both KRFrm and DeV are subcategories of StrInc that are equivalent to StrInc. For a compact Hausdorff space X, the category StrInc not only contains both the frame of open sets of X and the de Vries algebra of regular open sets of X, these two objects are isomorphic in StrInc, with the second being the regularization of the first. The restrictions of these categories are considered also in the setting of spectral spaces, Stone spaces, and extremally disconnected spaces.     

Unitary SK1 of semiramified graded and valued division algebras

We prove formulas for SK₁(E, τ), which is the unitary SK₁ for a graded division algebra E finite-dimensional and semiramified over its center T with respect to a unitary involution τ on E. Every such formula yields a corresponding formula for SK₁(D, ρ) where D is a division algebra tame and semiramified over a Henselian valued field and ρ is a unitary involution on D. For example, it is shown that if ${\sf{E} \sim \sf{I}_0 \otimes_{\sf{T}_0}\sf{N}}$ where I ₀ is a central simple T ₀-algebra split by N ₀ and N is decomposably semiramified with ${\sf{N}_0 \cong L_1\otimes_{\sf{T}_0} L_2}$ with L ₁, L ₂ fields each cyclic Galois over T ₀, then $${\rm SK}_1(\sf{E}, \tau) \,\cong\ {\rm Br}(({L_1}\otimes_{\sf{T}_0} {L_2})/\sf{T}_0;\sf{T}_0^\tau)\big/ \left[{\rm Br}({L_1}/\sf{T}_0;\sf{T}_0^\tau)\cdot {\rm Br}({L_2}/\sf{T}_0;\sf{T}_0^\tau) \cdot \langle[\sf{I}_0]\rangle\right].$$      

Extracting BB′IW Inhabitants of Simple Types From Proofs in the Sequent Calculus {LT_\to^{t}} for Implicational Ticket Entailment

The decidability of the logic of pure ticket entailment means that the problem of inhabitation of simple types by combinators over the base { B, B′, I, W } is decidable too. Type-assignment systems are often formulated as natural deduction systems. However, our decision procedure for this logic, which we presented in earlier papers, relies on two sequent calculi and it does not yield directly a combinator for a theorem of ${T_\to}$ . Here we describe an algorithm to extract an inhabitant from a sequent calculus proof—without translating the proof into another proof system.     

Reeb Graphs: Approximation and Persistence

Given a continuous function f:X→? on a topological space X, its level set f ^?1(a) changes continuously as the real value a changes. Consequently, the connected components in the level sets appear, disappear, split and merge. The Reeb graph of f summarizes this information into a graph structure. Previous work on Reeb graph mainly focused on its efficient computation. In this paper, we initiate the study of two important aspects of the Reeb graph, which can facilitate its broader applications in shape and data analysis. The first one is the approximation of the Reeb graph of a function on a smooth compact manifold M without boundary. The approximation is computed from a set of points P sampled from M. By leveraging a relation between the Reeb graph and the so-called vertical homology group, as well as between cycles in M and in a Rips complex constructed from P, we compute the H ₁-homology of the Reeb graph from P. It takes O(nlogn) expected time, where n is the size of the 2-skeleton of the Rips complex. As a by-product, when M is an orientable 2-manifold, we also obtain an efficient near-linear time (expected) algorithm for computing the rank of H ₁(M) from point data. The best-known previous algorithm for this problem takes O(n ³) time for point data. The second aspect concerns the definition and computation of the persistent Reeb graph homology for a sequence of Reeb graphs defined on a filtered space. For a piecewise-linear function defined on a filtration of a simplicial complex K, our algorithm computes all persistent H ₁-homology for the Reeb graphs in $O(n n_{e}^{3})$ time, where n is the size of the 2-skeleton and n _e is the number of edges in K.     

A note on propositional proof complexity of some Ramsey-type statements

A Ramsey statement denoted ${n \longrightarrow (k)^2_2}$ says that every undirected graph on n vertices contains either a clique or an independent set of size k. Any such valid statement can be encoded into a valid DNF formula RAM(n, k) of size O(n ^k ) and with terms of size ${\left(\begin{smallmatrix}k\\2\end{smallmatrix}\right)}$ . Let r _k be the minimal n for which the statement holds. We prove that RAM(r _k , k) requires exponential size constant depth Frege systems, answering a problem of Krishnamurthy and Moll [15]. As a consequence of Pudlák??s work in bounded arithmetic [19] it is known that there are quasi-polynomial size constant depth Frege proofs of RAM(4 ^k , k), but the proof complexity of these formulas in resolution R or in its extension R(log) is unknown. We define two relativizations of the Ramsey statement that still have quasi-polynomial size constant depth Frege proofs but for which we establish exponential lower bound for R.     

The Monotone Catenary Degree of Krull Monoids

Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. The monotone catenary degree c _mon (H) of H is the smallest integer m with the following property: for each ${a \in H}$ and each two factorizations z, z′ of a with length |z| ≤  |z′|, there exist factorizations z = z ₀, ... ,z _k  = z′ of a with increasing lengths—that is, |z ₀| ≤  ... ≤  |z _k |—such that, for each ${i \in [1,k]}$ , z _i arises from z _i-1 by replacing at most m atoms from z _i-1 by at most m new atoms. Up to now there was only an abstract finiteness result for c _mon (H), but the present paper offers the first explicit upper and lower bounds for c _mon (H) in terms of the group invariants of G.     

Silver Block Intersection Graphs of Steiner 2-Designs

For a block design ${\mathcal{D}}$ , a series of block intersection graphs G _i , or i-BIG( ${\mathcal{D}}$ ), i = 0, . . . ,k is defined in which the vertices are the blocks of ${\mathcal{D}}$ , with two vertices adjacent if and only if the corresponding blocks intersect in exactly i elements. A silver graph G is defined with respect to a maximum independent set of G, called an α-set. Let G be an r-regular graph and c be a proper (r + 1)-coloring of G. A vertex x in G is said to be rainbow with respect to c if every color appears in the closed neighborhood ${N[x] = N(x) \cup \{x\}}$ . Given an α-set I of G, a coloring c is said to be silver with respect to I if every ${x\in I}$ is rainbow with respect to c. We say G is silver if it admits a silver coloring with respect to some I. Finding silver graphs is of interest, for a motivation and progress in silver graphs see Ghebleh et al. (Graphs Combin 24(5):429–442, 2008) and Mahdian and Mahmoodian (Bull Inst Combin Appl 28:48–54, 2000). We investigate conditions for 0-BIG( ${\mathcal{D}}$ ) and 1-BIG( ${\mathcal{D}}$ ) of Steiner 2-designs ${{\mathcal{D}}=S(2,k,v)}$ to be silver.     

The polytopologies of transfinite provability logic

Provability logics are modal or polymodal systems designed for modeling the behavior of Gödel’s provability predicate and its natural extensions. If Λ is any ordinal, the Gödel-Löb calculus GLP _Λ contains one modality [λ] for each λ < Λ, representing provability predicates of increasing strength. GLP _ω has no non-trivial Kripke frames, but it is sound and complete for its topological semantics, as was shown by Icard for the variable-free fragment and more recently by Beklemishev and Gabelaia for the full logic. In this paper we generalize Beklemishev and Gabelaia’s result to GLP _Λ for countable Λ. We also introduce provability ambiances, which are topological models where valuations of formulas are restricted. With this we show completeness of GLP _Λ for the class of provability ambiances based on Icard polytopologies.     

On the conservativity of the axiom of choice over set theory

We show that for various set theories T including ZF, T + AC is conservative over T for sentences of the form ${\forall x \exists ! y}$ A(x, y) where A(x, y) is a ??₀ formula.     

A characterization of the Grassmann embedding of H(q), with q even

In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane. In particular, we show that no such embedding exists for H(q), with q odd. As a corollary, we can classify all full polarized embeddings of H(q) in PG(12, q) with the property that the lines through any point are contained in a solid; they necessarily are Grassmann embeddings of H(q), with q even.     

Semiconic idempotent residuated structures

An idempotent residuated po-monoid is semiconic if it is a subdirect product of algebras in which the monoid identity is comparable with all other elements. It is proved that the quasivariety SCIP of all semiconic idempotent commutative residuated po-monoids is locally finite. The lattice-ordered members of this class form avariety SCIL, which is not locally finite, but it is proved that SCIL has the finite embeddability property (FEP). More generally, for every relative subvariety K of SCIP, the lattice-ordered members of K have the FEP. This gives a unified explanation of the strong finite model property for a range of logical systems. It is also proved that SCIL has continuously many semisimple subvarieties, and that the involutive algebras in SCIL are subdirect products of chains.     

Classifying resolving subcategories over a Cohen–Macaulay local ring

Let R be a Cohen–Macaulay local ring. Denote by mod R the category of finitely generated R-modules. In this paper, we consider the classification problem of resolving subcategories of mod R in terms of specialization-closed subsets of Spec R. We give a classification of the resolving subcategories closed under tensor products and transposes. Under restrictive hypotheses, we also give better classification results.     

The maximal linear extension theorem in second order arithmetic

We show that the maximal linear extension theorem for well partial orders is equivalent over RCA ₀ to ATR ₀. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR ₀ over RCA ₀.     

E-local pseudovarieties

Generalizing a property of the pseudovariety of all aperiodic semigroups observed by Tilson, we call E -local a pseudovariety V which satisfies the following property: for a finite semigroup, the subsemigroup generated by its idempotents belongs to V if and only if so do the subsemigroups generated by the idempotents in each of its regular $\mathcal{D}$ -classes. In this paper, we present several sufficient or necessary conditions for a pseudovariety to be E-local or for a pseudoidentity to define an E-local pseudovariety. We also determine several examples of the smallest E-local pseudovariety containing a given pseudovariety.     

A note on da Costa-Doria “exotic formalizations”

We analyze N. C. A. da Costa and F. A. Doria’s “exotic formalization” of the conjecture P = NP [3–7]. For any standard axiomatic PA extension T and any number-theoretic sentence ${\varphi }$ , we let ${\varphi ^{\star} := \varphi \vee \lnot \mathsf{Con}\left( \mathsf{T}\right)}$ and prove the following “exotic” inferences 1–3. 1. ${\mathsf{T}+\varphi ^{\star}}$ is consistent, if so is T, 2. ${\mathsf{T}+\varphi}$ is consistent, provided that ${\mathsf{T}+\varphi ^{\star}}$ is ω-consistent, 3. ${\mathsf{T}+\varphi}$ is consistent, provided that T is consistent and has the same provably total recursive functions as ${\mathsf{T}+\left( \varphi \leftrightarrow \varphi ^{\star }\right) }$ . Furthermore we show that 1–3 continue to hold for ${\varphi ^{\star} := \varphi _{S} :=\varphi \vee \lnot S}$ , where ${S=\forall x\exists yR\left( x,y\right)}$ is any ${\Pi _{2}^{0}}$ sentence satisfying: 4. ${\left( \forall n\in \omega \right) \left( \mathsf{T}\vdash S_{x}\left[ \underline{n}\right] \right) }$ , 5. ${\mathsf{Con}\left( \mathsf{T}\right) \Rightarrow \mathsf{T}\nvdash S}$ . We observe that if ${\varphi :=\left[ \mathsf{P}=\mathsf{NP}\right] }$ and ${S:= \left[\digamma total\right] }$ , where ${\digamma=\digamma _{\mathsf{T}}}$ is da Costa-Doria “exotic” function with respect to T, then 4, 5 are satisfied for most familiar (presumably) consistent T in question, while ${\varphi _{S}}$ becomes equivalent to da Costa-Doria “exotic formalization” ${\left[ \mathsf{P}=\mathsf{NP}\right]^{\digamma}}$ . Moreover, the corresponding “exotic” inferences 1–3 generalize analogous da Costa-Doria results. Hence these “exotic” inferences are universal for all number-theoretic sentences and not characteristic to the conjecture P = NP. Nor do they infer relative consistency of P = NP (see Conclusion 15 in the text).     

On Morita Equivalence of Partially Ordered Monoids

We show that there is one-to-one correspondence between certain algebraically and categorically defined subobjects, congruences and admissible preorders of S-posets. Using preservation properties of Pos-equivalence functors between Pos-categories we deduce that if S and T are Morita equivalent partially ordered monoids and F:Pos _S →Pos _T is a Pos-equivalence functor then an S-poset A _S and the T-poset F(A _S ) have isomorphic lattices of (regular, downwards closed) subobjects, congruences and admissible preorders. We also prove that if A _S has some flatness property then F(A _S ) has the same property.     

On predicate provability logics and binumerations of fragments of Peano arithmetic

Solovay proved (Israel J Math 25(3–4):287–304, 1976) that the propositional provability logic of any ∑₂-sound recursively enumerable extension of PA is characterized by the propositional modal logic GL. By contrast, Montagna proved in (Notre Dame J Form Log 25(2):179–189, 1984) that predicate provability logics of Peano arithmetic and Bernays–Gödel set theory are different. Moreover, Artemov proved in (Doklady Akademii Nauk SSSR 290(6):1289–1292, 1986) that the predicate provability logic of a theory essentially depends on the choice of a binumeration of the theory which is used to construct the provability predicate. In this paper, we compare predicate provability logics of I∑ _n ’s. For a binumeration α(x) of a recursive theory T, let PL _α(T) be the predicate provability logic of T defined by α(x). We prove that for any natural numbers i, j such that 0 < i < j, there exists a ∑₁ binumeration α(x) of some recursive axiomatization of I∑ _i such that ${{\sf PL}_\alpha({\rm I \Sigma}_i) \nsupseteq \bigcap_{\beta(x)}{\sf PL}_\beta({\rm I \Sigma}_j)}$ PL α ( I Σ i ) ? ? β ( x ) PL β ( I Σ j ) and ${{\sf PL}_\alpha({\rm I \Sigma}_i) \nsubseteq \bigcup_{\beta(x)}{\sf PL}_\beta({\rm I \Sigma}_j)}$ PL α ( I Σ i ) ? ? β ( x ) PL β ( I Σ j ) , where β(x) ranges over all ∑₁ binumerations of recursive axiomatizations of I∑ _j .