The theorem of De Rham-Saito is a generalization of a lemma due to De Rham [3], which was announced and used in [7] by Kyoji Saito, as noproof of this theorem was available, Le Dung Trang encouraged to Saito to publish the proof that can be seen in [8], which indirectly encourages us to detail the proof in this article for the many applications it has,we highlight the Godbillon-Vey algorithm [4]; in the proof of Theorem classical Frobenius given in [2]; in [6] we see some interesting applications, in the proof of Frobenius theorem with singularities [5]. In [1] we givefull details of the proof given by Moussu and Rolin. / El teorema de De Rham-Saito es una generalización de un lema debido a De Rham [3], el cual fue enunciado y usado en [11] por Kyoji Saito, al no haber prueba de este teorema Le Dung Trang anima a Saito a publicar la prueba que puede ser vista en [12], lo cual indirectamente nos motiva a detallarla prueba en este articulo por las muchas aplicaciones que tiene, destacamos el algoritmo de Godbillon-Vey [5]; en la prueba del Teorema de Frobenius clásico dada en [2]; en [8] vemos unas aplicaciones interesantes; en la prueba del Teorema de Frobenius con singularidades [7]; en [1] se detalla la prueba realizada por Moussu y Rolin [10].

Submitted by Renata Lopes (renatasil82@gmail.com) on 2018-08-22T18:18:00Z No. of bitstreams: 1 giovannaarelisbaldeonpenao.pdf: 709529 bytes, checksum: 3a96b8a9a33c7117ccbff2e2ff41c7c0 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-09-03T16:34:23Z (GMT) No. of bitstreams: 1 giovannaarelisbaldeonpenao.pdf: 709529 bytes, checksum: 3a96b8a9a33c7117ccbff2e2ff41c7c0 (MD5) / Made available in DSpace on 2018-09-03T16:34:23Z (GMT). No. of bitstreams: 1 giovannaarelisbaldeonpenao.pdf: 709529 bytes, checksum: 3a96b8a9a33c7117ccbff2e2ff41c7c0 (MD5) Previous issue date: 2018-05-30 / O objetivo deste trabalho é estudar um método, apresentado em [6], que nos permite determinar se uma folheação no plano projetivo possui ou não soluções algébricas, usando apenas métodos de computação algébrica. Mais especificamente usando bases de Gröbner. Com este método é possível procurar por outros exemplos de folheações sem soluções algébricas. / The aim of this work is to present a method, given by S. C. Coutinho and Bruno F. M. Ribeiro in [6], to check whether certain holomorphic foliations on the complex projective plane have algebraic solutions, using only methods of algebraic computing or more precisely, using Gröbner bases. This algorithm is then used to produce examples of foliations without algebraic solutions.