(**************************************************************************) (* ___ *) (* ||M|| *) (* ||A|| A project by Andrea Asperti *) (* ||T|| *) (* ||I|| Developers: *) (* ||T|| The HELM team. *) (* ||A|| http://helm.cs.unibo.it *) (* \ / *) (* \ / This file is distributed under the terms of the *) (* v GNU General Public License Version 2 *) (* *) (**************************************************************************) (* This file was automatically generated: do not edit *********************) include "CoRN.ma". (* $Id: FTAreg.v,v 1.4 2004/04/23 10:00:57 lcf Exp $ *) include "fta/KneserLemma.ma". include "fta/CPoly_Shift.ma". include "fta/CPoly_Contin1.ma". (*#* * FTA for regular polynomials ** The Kneser sequence %\begin{convention}% Let [n] be a positive natural number. %\end{convention}% *) (* UNEXPORTED Section Seq_Exists *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/n.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/lt0n.var *) (*#* %\begin{convention}% Let [qK] be a real between 0 and 1, with [[ forall (p : CCX), (monic n p) -> forall (c : IR), ((AbsCC (p!Zero)) [<] c) -> {z:CC | ((AbsCC z) [^]n [<] c) | ((AbsCC (p!z)) [<] qK[*]c)}. ]] Let [p] be a monic polynomial over the complex numbers with degree [n], and let [c0] be such that [(AbsCC (p!Zero)) [<] c0]. %\end{convention}% *) (* UNEXPORTED Section Kneser_Sequence *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/qK.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/zltq.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/qlt1.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/q_prop.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/p.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/mp.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/c0.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_Exists/Kneser_Sequence/p0ltc0.var *) inline procedural "cic:/CoRN/fta/FTAreg/Knes_tup.ind". (* COERCION cic:/matita/CoRN-Procedural/fta/FTAreg/z_el.con *) inline procedural "cic:/CoRN/fta/FTAreg/Knes_tupp.ind". (* COERCION cic:/matita/CoRN-Procedural/fta/FTAreg/Kntup.con *) inline procedural "cic:/CoRN/fta/FTAreg/Knes_fun.con" as definition. inline procedural "cic:/CoRN/fta/FTAreg/Knes_fun_it.con" as definition. inline procedural "cic:/CoRN/fta/FTAreg/sK.con" as definition. inline procedural "cic:/CoRN/fta/FTAreg/sK_c.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/sK_c0.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/sK_prop1.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/sK_it.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/sK_prop2.con" as lemma. (* UNEXPORTED End Kneser_Sequence *) (* UNEXPORTED Section Seq_Exists_Main *) (*#* **Main results *) inline procedural "cic:/CoRN/fta/FTAreg/seq_exists.con" as lemma. (* UNEXPORTED End Seq_Exists_Main *) (* UNEXPORTED End Seq_Exists *) (* UNEXPORTED Section N_Exists *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/n.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/lt0n.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/q.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/zleq.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/qlt1.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/c.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/zltc.var *) (* begin hide *) inline procedural "cic:/CoRN/fta/FTAreg/N_Exists/q_.con" "N_Exists__" as definition. (* end hide *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/e.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/N_Exists/zlte.var *) inline procedural "cic:/CoRN/fta/FTAreg/N_exists.con" as lemma. (* UNEXPORTED End N_Exists *) (* UNEXPORTED Section Seq_is_CC_CAuchy *) (*#* ** The Kneser sequence is Cauchy in [CC] *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/n.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/lt0n.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/q.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/zleq.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/qlt1.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/c.var *) (* UNEXPORTED cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/zltc.var *) (*#* %\begin{convention}% Let: - [q_] prove [q[-]One [#] Zero] - [nrtq := NRoot q n] - [nrtc := Nroot c n] - [nrtqlt1] prove [nrtq [<] One] - [nrtq_] prove [nrtq[-]One [#] Zero] %\end{convention}% *) (* begin hide *) inline procedural "cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/q_.con" "Seq_is_CC_CAuchy__" as definition. inline procedural "cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/nrtq.con" "Seq_is_CC_CAuchy__" as definition. inline procedural "cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/nrtc.con" "Seq_is_CC_CAuchy__" as definition. inline procedural "cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/nrtqlt1.con" "Seq_is_CC_CAuchy__" as definition. inline procedural "cic:/CoRN/fta/FTAreg/Seq_is_CC_CAuchy/nrtq_.con" "Seq_is_CC_CAuchy__" as definition. (* end hide *) inline procedural "cic:/CoRN/fta/FTAreg/zlt_nrtq.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/zlt_nrtc.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/nrt_pow.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/abs_pow_ltRe.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/abs_pow_ltIm.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/SublemmaRe.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/SublemmaIm.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/seq_is_CC_Cauchy.con" as lemma. (* UNEXPORTED End Seq_is_CC_CAuchy *) inline procedural "cic:/CoRN/fta/FTAreg/FTA_monic.con" as lemma. inline procedural "cic:/CoRN/fta/FTAreg/FTA_reg.con" as lemma.