scholarly journals Classification of first order sesquilinear forms

2020 ◽  
Vol 32 (09) ◽  
pp. 2050027
Author(s):  
Matteo Capoferri ◽  
Nikolai Saveliev ◽  
Dmitri Vassiliev

A natural way to obtain a system of partial differential equations on a manifold is to vary a suitably defined sesquilinear form. The sesquilinear forms we study are Hermitian forms acting on sections of the trivial [Formula: see text]-bundle over a smooth [Formula: see text]-dimensional manifold without boundary. More specifically, we are concerned with first order sesquilinear forms, namely, those generating first order systems. Our goal is to classify such forms up to [Formula: see text] gauge equivalence. We achieve this classification in the special case of [Formula: see text] and [Formula: see text] by means of geometric and topological invariants (e.g., Lorentzian metric, spin/spinc structure, electromagnetic covector potential) naturally contained within the sesquilinear form — a purely analytic object. Essential to our approach is the interplay of techniques from analysis, geometry, and topology.

2019 ◽  
Vol 13 (2) ◽  
pp. 388-415
Author(s):  
PAUL ANH MCELDOWNEY

AbstractIn a recent article, Barrett & Halvorson (2016) define a notion of equivalence for first-order theories, which they call “Morita equivalence.” To argue that Morita equivalence is a reasonable measure of “theoretical equivalence,” they make use of the claim that Morita extensions “say no more” than the theories they are extending. The goal of this article is to challenge this central claim by raising objections to their argument for it and by showing why there is good reason to think that the claim itself is false. In light of these criticisms, this article develops a natural way for the advocate of Morita equivalence to respond. I prove that this response makes her criterion a special case of bi-interpretability, an already well-established barometer of theoretical equivalence. I conclude by providing reasons why the advocate of Morita equivalence should opt for a notion of theoretical equivalence that is defined in terms of interpretability rather than Morita extensions.


2002 ◽  
Vol 7 (1) ◽  
pp. 31-42
Author(s):  
J. Šaltytė ◽  
K. Dučinskas

The Bayesian classification rule used for the classification of the observations of the (second-order) stationary Gaussian random fields with different means and common factorised covariance matrices is investigated. The influence of the observed data augmentation to the Bayesian risk is examined for three different nonlinear widely applicable spatial correlation models. The explicit expression of the Bayesian risk for the classification of augmented data is derived. Numerical comparison of these models by the variability of Bayesian risk in case of the first-order neighbourhood scheme is performed.


1978 ◽  
Vol 43 (1) ◽  
pp. 23-44 ◽  
Author(s):  
Nicolas D. Goodman

In this paper we introduce a new notion of realizability for intuitionistic arithmetic in all finite types. The notion seems to us to capture some of the intuition underlying both the recursive realizability of Kjeene [5] and the semantics of Kripke [7]. After some preliminaries of a syntactic and recursion-theoretic character in §1, we motivate and define our notion of realizability in §2. In §3 we prove a soundness theorem, and in §4 we apply that theorem to obtain new information about provability in some extensions of intuitionistic arithmetic in all finite types. In §5 we consider a special case of our general notion and prove a kind of reflection theorem for it. Finally, in §6, we consider a formalized version of our realizability notion and use it to give a new proof of the conservative extension theorem discussed in Goodman and Myhill [4] and proved in our [3]. (Apparently, a form of this result is also proved in Mine [13]. We have not seen this paper, but are relying on [12].) As a corollary, we obtain the following somewhat strengthened result: Let Σ be any extension of first-order intuitionistic arithmetic (HA) formalized in the language of HA. Let Σω be the theory obtained from Σ by adding functionals of finite type with intuitionistic logic, intensional identity, and axioms of choice and dependent choice at all types. Then Σω is a conservative extension of Σ. An interesting example of this theorem is obtained by taking Σ to be classical first-order arithmetic.


2021 ◽  
Vol 2021 (3) ◽  
Author(s):  
Nishant Gupta ◽  
Nemani V. Suryanarayana

Abstract We construct classical theories for scalar fields in arbitrary Carroll spacetimes that are invariant under Carrollian diffeomorphisms and Weyl transformations. When the local symmetries are gauge fixed these theories become Carrollian conformal field theories. We show that generically there are at least two types of such theories: one in which only time derivatives of the fields appear and the other in which both space and time derivatives appear. A classification of such scalar field theories in three (and higher) dimensions up to two derivative order is provided. We show that only a special case of our theories arises in the ultra-relativistic limit of a covariant parent theory.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Giosuè Emanuele Muratore

Abstract The 2-Fano varieties, defined by De Jong and Starr, satisfy some higher-dimensional analogous properties of Fano varieties. We consider (weak) k-Fano varieties and conjecture the polyhedrality of the cone of pseudoeffective k-cycles for those varieties, in analogy with the case k = 1. Then we calculate some Betti numbers of a large class of k-Fano varieties to prove some special case of the conjecture. In particular, the conjecture is true for all 2-Fano varieties of index at least n − 2, and we complete the classification of weak 2-Fano varieties answering Questions 39 and 41 in [2].


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1077
Author(s):  
Yarema A. Prykarpatskyy

Dubrovin’s work on the classification of perturbed KdV-type equations is reanalyzed in detail via the gradient-holonomic integrability scheme, which was devised and developed jointly with Maxim Pavlov and collaborators some time ago. As a consequence of the reanalysis, one can show that Dubrovin’s criterion inherits important parts of the gradient-holonomic scheme properties, especially the necessary condition of suitably ordered reduction expansions with certain types of polynomial coefficients. In addition, we also analyze a special case of a new infinite hierarchy of Riemann-type hydrodynamical systems using a gradient-holonomic approach that was suggested jointly with M. Pavlov and collaborators. An infinite hierarchy of conservation laws, bi-Hamiltonian structure and the corresponding Lax-type representation are constructed for these systems.


10.37236/5980 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Samuel Braunfeld

In Homogeneous permutations, Peter Cameron [Electronic Journal of Combinatorics 2002] classified the homogeneous permutations (homogeneous structures with 2 linear orders), and posed the problem of classifying the homogeneous $n$-dimensional permutation structures (homogeneous structures with $n$ linear orders) for all finite $n$. We prove here that the lattice of $\emptyset$-definable equivalence relations in such a structure can be any finite distributive lattice, providing many new imprimitive examples of homogeneous finite dimensional permutation structures. We conjecture that the distributivity of the lattice of $\emptyset$-definable equivalence relations is necessary, and prove this under the assumption that the reduct of the structure to the language of $\emptyset$-definable equivalence relations is homogeneous. Finally, we conjecture a classification of the primitive examples, and confirm this in the special case where all minimal forbidden structures have order 2. 


1988 ◽  
Vol 53 (2) ◽  
pp. 554-570 ◽  
Author(s):  
Kosta Došen ◽  
Peter Schroeder-Heister

This paper is meant to be a comment on Beth's definability theorem. In it we shall make the following points.Implicit definability as mentioned in Beth's theorem for first-order logic is a special case of a more general notion of uniqueness. If α is a nonlogical constant, Tα a set of sentences, α* an additional constant of the same syntactical category as α and Tα, a copy of Tα with α* instead of α, then for implicit definability of α in Tα one has, in the case of predicate constants, to derive α(x1,…,xn) ↔ α*(x1,…,xn) from Tα ∪ Tα*, and similarly for constants of other syntactical categories. For uniqueness one considers sets of schemata Sα and derivability from instances of Sα ∪ Sα* in the language with both α and α*, thus allowing mixing of α and α* not only in logical axioms and rules, but also in nonlogical assumptions. In the first case, but not necessarily in the second one, explicit definability follows. It is crucial for Beth's theorem that mixing of α and α* is allowed only inside logic, not outside. This topic will be treated in §1.Let the structural part of logic be understood roughly in the sense of Gentzen-style proof theory, i.e. as comprising only those rules which do not specifically involve logical constants. If we restrict mixing of α and α* to the structural part of logic which we shall specify precisely, we obtain a different notion of implicit definability for which we can demonstrate a general definability theorem, where a is not confined to the syntactical categories of nonlogical expressions of first-order logic. This definability theorem is a consequence of an equally general interpolation theorem. This topic will be treated in §§2, 3, and 4.


Sign in / Sign up

Export Citation Format

Share Document