Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0306169

Theorie De Galois Des Equations Differentielles

L. Saidane
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let k be a differential field and C its subfield of constants. In general a differential extension K of k add some new constants to C, and it is difficult to prove that C stay unchangeable under the extension K; This situation is provided by the Picard-Vessiot extension. Kolchin prove the theorem of existence and unicity for these extensions. The aim of this paper is to prove Kolchin theorem and other results, in a simple manner, by means of the theory of models and logic. ----- Soit k un corps différentiel et C son sous corps des constantes. En général une extension différentiel K de k modifie le corps des constantes C de k. Prouver que K ne modifie pas C est un problème assez difficile en algèbre différentiel. Les extensions de Picard-Vessiot constitue un exemple de cette situation. Kolchin a montré le théorème d'existence et d'unicité, à isomorphisme prés, des extensions de Picard-Vessiot sous la condition que le corps C est algébriquement clos. Dans ce travail on utilise la théorie des corps différentiellements clos (Théorie des modèles), pour montrer l'existence et l'unicité, à isomorphisme prés, des extensions de Picard-Vessiot. On calcul ensuite le groupe de Galois différentiel de certaines extensions particulière. Enfin, on montre quelque théorèmes généraux de la théorie de Galois différentielle par les mêmes techniques.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

L. Saidane. 2003-06-10. Theorie De Galois Des Equations Differentielles. https://arxiv.org/abs/math/0306169

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↗