O-minimal de Rham cohomology

Ricardo Bianconi; Rodrigo Figueiredo

Home/Archive/arXiv

arXiv · 1904.05485

O-minimal de Rham cohomology

Ricardo Bianconi·Rodrigo Figueiredo

View original source ↗Read source document ↗Export metadata ↓

Abstract

O-minimal geometry generalizes both semialgebraic and subanalytic geometries, and has been very successful in solving special cases of some problems in arithmetic geometry, such as Andr\'e-Oort conjecture. Among the many tools developed in an o-minimal setting are cohomology theories for abstract-definable continuous manifolds such as singular cohomology, sheaf cohomology and \v Cech cohomology, which have been used for instance to prove Pillay's conjecture concerning definably compact groups. In the present paper we elaborate an o-minimal de Rham cohomology theory for abstract-definable $\mathcal{C}^\infty$ manifolds in an o-minimal expansion of the real field which admits smooth cell decomposition and defines the exponential function. We can specify the o-minimal cohomology groups and attain some properties such as the existence of Mayer-Vietoris sequence and the invariance under abstract-definable $\mathcal{C}^\infty$ diffeomorphisms. However, in order to obtain the invariance of our o-minimal cohomology under abstract-definable homotopy we must, working in a tame context that defines sufficiently many primitives, assume the validity of a statement related to Br\"ocker's question.

Explore related subjects

math.LO math.AG math.AT math.DG

Keep this discovery

BibTeX RIS

Ricardo Bianconi, Rodrigo Figueiredo. 2019-04-11. O-minimal de Rham cohomology. https://arxiv.org/abs/1904.05485

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗