´ A SIMPLE PROOF OF DIEUDONNE-MANIN CLASSIFICATION THEOREM Yiwen DING and Yi OUYANG Wu Wen-Tsun Key Laboratory of Mathematics, USTC Chinese Academy of Sciences & School of Mathematics University of Science and Technology of China Hefei, Anhui 230026, China Email: [email protected], [email protected]

Abstract. The Dieudonn´ e-Manin classification theorem on ϕ-modules (ϕisocrystals) over a perfect field plays a very important role in p-adic Hodge theory. In this note, in a more general setting we give a new proof of this result, and in the course of the proof, we also give an explicit construction of the Harder-Narasimhan filtration of a ϕ-module.

Let k be a perfect field of characteristic p > 0. The classical Dieudonn´e-Manin classification theorem (cf.[2]) provides a slope decomposition of a ϕ-module over the field W (k)[ p1 ], which is loosely analogous to the eigenspace decomposition of a vector space equipped with a linear transformation. In this note, in a more general setting we give a new proof of this result, and in the course of the proof, we also give an explicit construction of the Harder-Narasimhan filtration of a ϕ-module. This is without the huge machinery of commutative formal groups in the original proof. The authors sincerely thank Professor Jean-Marc Fontaine for many helpful discussions involving this theorem, without which this proof would be in non-existence. ´-Manin classification theorem 1. Statement of Dieudonne Let p be a prime number. For q = pf , let Fq be the unique finite field of q elements and Zq = W (Fq ). Suppose k is a perfect field of characteristic p containing Fq . Suppose E is a complete discrete valuation field of mixed characteristic, OE the ring of integers of E, mE the maximal ideal of OE , π a uniformizing parameter of mK , and kE = OE /mE = Fq the residue field of OE . Recall that WOE (k) = OE ⊗Zq W (k) is the strict OE -ring over k, i.e., WOE (k) is a commutative ring together with an injective homomorphism of rings ι : OE → WOE (k), such that it is complete and 2000 Mathematics Subject Classification. Primary 11G99, 11E95; Secondary 14G20. Key words and phrases. ϕ-module, strict ring, Dieudonn´ e-Manin theorem, Harder-Narasimhan filtration. Research partially supported by Project 10871183 from NSFC and by Specialized Research Fund for the Doctoral Program of Higher Education. 1

2

YIWEN DING AND YI OUYANG

separated by the π-adic topology and that WOE (k)/πWOE (k) ∼ = k. Set 1 K0 = WOE (k)[ ] ⊃ WOE = WOE (k). π Note that if q = p, OE = Zp and π = p, then WOE is the usual ring of Witt vectors of k. The Frobenius substitution σ : k → k, λ 7→ λq extends by functoriality to WOE (k) and K0 , which we still denote by σ. Definition 1.1. A ϕ-module D over K0 is a finite dimensional K0 -vector space equipped with a bijective σ-semi-linear map ϕ. Assume D is a ϕ-module over K P0r of dimension r. Suppose {e1 , · · · , er } is a basis of D over K0 , then ϕ(ei ) = j=1 aij ej . The matrix of ϕ under this basis is A = (aij )1≤i,j≤r ∈ GLr (K0 ). Suppose {e01 , · · · , e0r } is another basis and A0 the matrix of ϕ under this basis, suppose the transformation matrix of these two bases is P , then A = σ(P )A0 P −1 . Thus tN (D) = vπ (det A) is a well defined integer independent of the choice of basis. Definition 1.2. The slope of a ϕ-module D 6= 0 of K0 is defined to be µ(D) = tN (D) dimK0 D . A ϕ-module D is called pure of slope µ (or isoclinic) if there exists a WOE -lattice M of D such that π −d ϕh (M ) = M where µ = hd , d, h ∈ Z and h ≥ 1. Remark. (i) A ϕ-module pure of slope 0 is nothing but an ´etale ϕ-module over K0 (see [1]). (ii) Suppose D = K0 e1 ⊕ · · · ⊕ K0 en , ϕ(ei ) = ei+1 for 1 ≤ i ≤ n − 1 and ϕ(en ) = pe1 , then D is pure of slope n1 . The aim of this note is to give a simple proof of the following theorem of Dieudonn´e-Manin which classifies all ϕ-modules. Theorem 1.3 (Dieudonn´e-Manin). For a ϕ-module D over K0 , then M D= Dµ , µ∈Q

where Dµ is the part of D pure of slope µ and Dµ = 0 for all but finitely many µ. Hence µ dimK0 Dµ ∈ Z and X tN (D) = µ dimK0 Dµ . µ∈Q

Remark. By Fontaine’s theory of mod-p representations (cf. [1], Chapter 2), if k is algebraically closed and if D is pure of slope µ = hd with d, h ∈ Z, h ≥ 1, then D∼ = K0 ⊗Qph Dϕh =pd . 2. Proof of the classification Theorem Suppose D is a ϕ-module. For h, d ∈ Z and h ≥ 1, we write ϕh,d = π −d ϕh . Then ϕh,d is bijective in D. Let M be a WOE -lattice of D, we set Mh,d = ∩n≥0 ϕ−n h,d (M ) and Dµ = Mh,d [ π1 ] where µ = d/h ∈ Q. Clearly by definition Mh,d is a sub-WOE module of M stable under ϕh,d .

´ A PROOF OF DIEUDONNE-MANIN THEOREM

3

Proposition 2.1. Suppose D is a ϕ-module over K0 , µ = hd ∈ Q. Then (1) Dµ is independent of the choices of the lattice M and the pair (h, d). (2) x ∈ Dµ if and only if the WOE -module WOE [x, ϕh,d (x) · · · , ϕnh,d (x), · · · ] is a finite WOE -module, in particular Dµ is a ϕ-submodule of D. (3) {Dµ }µ∈Q forms a decreasing filtration of D which is separate and exhaustive, in other words, 0

(i) If µ ≤ µ0 , then Dµ ⊃ Dµ ; (ii) Dµ = D for µ  0 and Dµ = 0 for µ  0. Proof. (1) Suppose M 0 = T M is another lattice of D where T ∈ GL(D). We choose k ∈ N such that T M ⊃ π k M . For x ∈ Mh,d [ π1 ], suppose π a x ∈ Mh,d , then ϕnh,d (π a x) ∈ M for all n ∈ N and ϕnh,d (π a+k x) ∈ π k M ⊂ M 0 for all n ∈ N, thus 0 0 and x ∈ Mh,d [ π1 ]. This proves the independence of M . π a+k x ∈ Mh,d Now for (h0 , d0 ) = (kh, kd), we let M 0 = ∩0≤j≤k−1 ϕjh,d (M ). Then M 0 is a lattice 0 0 [ π1 ] = Mh,d [ π1 ]. This proves the in D and Mkh,kd = Mh,d . Thus Mkh,kd [ π1 ] = Mkh,kd independence of the pair (h, d). (2) Let µ = hd . Suppose M is a lattice in D. Then x ∈ Dµ means that there exists k ∈ N, π k x ∈ Mh,d , or equivalently ϕnh,d (π k x) ∈ M for n ∈ N, so WOE [x, ϕh,d (x) · · · , ϕnh,d (x), · · · ] ⊃ π −k M is a finite WOE -module. Conversely, if the WOE -module WOE [x, ϕh,d (x) · · · , ϕnh,d (x), · · · ] is a finite WOE -module, we extend it to a WOE -lattice M of D, then x ∈ Mh,d ⊂ Dµ . (3) If d < d0 , then by definition Mh,d ⊃ Mh,d0 , this proves (i). Suppose π d2 M ⊂ ϕ(M ) ⊂ π d1 M , then for d > d2 , M1,d = 0 and for d < d1 , M1,d = M , this proves (ii).  Remark. Suppose D = Da,b = K0 e1 ⊕ K0 e2 , ϕ(e1 ) = e2 and ϕ(e2 ) = ae1 + be2 , µ a natural question is to compute Da,b for µ ∈ Q. At present we don’t know the answer. Lemma 2.2. Suppose 0 → D1 → D → D2 → 0 is a short exact sequence of ϕ-modules, then (1) the sequence 0 → D1µ → Dµ → D2µ is exact; (2) if moreover D1 =Dµ0 for some µ0 , then 0 → D1µ → Dµ → D2µ → 0 is exact. Proof. (1) follows easily from Proposition 2.1(2). (2) The case µ > µ0 follows from the case µ = µ0 . So we need only to prove the exactness in the case µ ≤ µ0 . We first show the case µ = µ0 , which is equivalent to the claim (D/Dµ0 )µ0 =0. We assume D = Dλ , µ0 = dh0 and λ = hd . We claim there exists a WOE -lattice M in D such that M is stable under ϕh,d and M ∩ Dµ0 is stable under ϕh,d0 . To see this, we first find a WOE -lattice L in D which is stable under ϕh,d , then the image of L in D/Dµ0 is a WOE -lattice. Suppose it is generated by e¯1 , e¯2 , · · · e¯r . For each i, take a preimages of e¯i in L, denoted by ei . Choose a WOE -lattice L0 in Dµ0 which is stable under ϕh,d0 . Then there exists N ∈ N, such that L ∩ Dµ0 ⊆ π −N L0 . Take er+1 , er+2 , · · · en as a basis of π −N L0 . (Note that π −N L0 is still stable under ϕh,d0 ). Then the lattice M generated by e1 , e2 , · · · en is what we need. That’s because ϕh,d (ei ) ∈ L ⊆ M when i ≤ r, and ϕh,d (ei ) = π d0 −d ϕh,d0 (ei ) ∈ π −N L0 ⊆ M when i ≥ r + 1. If (D/Dµ0 )µ0 6= 0, then there exists x ∈ D, x ∈ / Dµ0 , ϕnh,d0 (x) ∈ M + Dµ0 for any n. For n ≥ 1, let kn be the smallest integer such that ϕnh,d0 (x) = xn + π −kn yn

4

YIWEN DING AND YI OUYANG

where xn ∈ M , yn ∈ M ∩ Dµ0 (if ϕnh,d0 (x) ∈ M , let kn = 0). In fact, kn is also the smallest integer such that ϕnh,d0 (x) ∈ π −kn M . We have ϕh,d0 (xn + π −kn yn ) = xn+1 + π −kn+1 yn+1 = ϕh,d0 (xn ) + π −kn zn , where zn ∈ M ∩ Dµ0 . Since ϕh,d0 (M ) ⊆ π −(d0 −d) M , it’s easy to see kn+1 ≤ max(kn , d0 − d). Take N = max(k1 , d0 − d), then kn ≤ N is bounded. This implies that N µ0 π N x ∈ ∩n≥0 ϕ−n h,d0 (M ). Hence π x and x ∈ D , a contradiction. Thus we have µ0 µ0 shown (D/D ) =0. Now for the case µ < µ0 , if Dµ = D, then by (1), D/Dµ0 ⊇ (D/Dµ0 )µ ⊇ µ D /(Dµ0 )µ = D/Dµ0 , so all must be equal. In the general case, the exact sequence 0 → Dµ /Dµ0 → D/Dµ0 → D/Dµ → 0. and the fact (D/Dµ )µ = 0 implies that (Dµ /Dµ0 )µ = (D/Dµ0 )µ . Together with (Dµ /Dµ0 )µ = Dµ /Dµ0 , we get (D/Dµ0 )µ = Dµ /Dµ0 .  0

For any µ ∈ Q, we let D>µ be the union of all Dµ for µ0 > µ and D<µ be the 0 intersection of all Dµ for µ0 < µ. 0

Lemma 2.3. (1) For any µ, there exists µ0 < µ, Dµ = Dµ . In particular, the filtration {Dµ } is left continuous, i.e., D<µ = Dµ . 0 (2) For µ = hd and dimK0 Dµ =l, if Dµ = D>µ , then Dµ = Dµ where µ0 = ld+1 lh . Proof. (1) By Lemma 2.2(2), we can replace by D/Dµ and assume Dµ = 0. Let T∞ D −i d µ = h . Take a lattice M in D, then i=0 ϕh,d (M ) = 0, and there exists k such Tk TN k −i 2 2N that i=0 ϕ−i M for i=0 ϕh,d (M ) ⊆ π h,d (M ) ⊆ π M . One can show easily that N ≥ 1 by induction. Tk Tk(j+1) −i −j Let L be the lattice i=0 ϕ−i h,d (M ), Then ϕkh,kd (L) = i=kj ϕh,d (M ) and j \

k(j+1)

ϕ−i kh,kd (L) =

i=0

\

2(j+1) ϕ−i M. h,d (M ) ⊆ π

i=0

So we have j \

ϕ−i kh,kd−1 (L)

i=0

=

j \ i=0

T∞

π

−i

ϕ−i kh,kd (L)



j \

j π −j ϕ−i kh,kd (L) ⊆ π M.

i=0 0

µ As a consequence i=0 ϕ−i = 0 for µ0 = kd−1 kh,kd−1 (L) = 0, which implies that D kh . µ (2) By Lemma 2.2(1), we can replace D by D ∩ D and assume D = Dµ . The αd+1 fact D>µ = D implies that there exists α ∈ N, D αh = D. Therefore we have a lattice M which is stable under ϕαh,αd+1 , and consequently stable under ϕαh,αd . It’s easy to see ϕnαh,αd (M ) = ϕnαh,αd+1 (π n M ) → 0 as n → ∞. Therefore for any lattice L stable under ϕh,d , ϕnh,d (L) → 0 as n → ∞; in particular, ϕnh,d (L) ⊂ πL when n is sufficiently large. If L is stable under ϕh,d , then ϕih,d (L) ⊃ ϕi+1 h,d (L), and there exists a chain of sub-k-vector spaces of L/πL

ϕi−1 ϕi+1 ϕih,d (L) L h,d (L) h,d (L) ⊃ ... i ⊃ ··· . ⊃ i ⊃ i+1 πL ϕh,d (L) ∩ πL ϕh,d (L) ∩ πL ϕh,d (L) ∩ πL

´ A PROOF OF DIEUDONNE-MANIN THEOREM

It’s easy to check that if dimk dimk

ϕih,d (L) ϕih,d (L)∩πL

ϕih,d (L) ϕih,d (L)∩πL

for any j > i. Since dimk

large, the fact dimk

L πL

ϕi+1 h,d (L) i+1 ϕh,d (L)∩πL ϕjh,d (L) j ϕh,d (L)∩πL

= dimk

5

, then dimk

ϕjh,d (L) j ϕh,d (L)∩πL

=

= 0 when j is sufficiently

= l implies that ϕlh,d (L) ⊆ πL. This means that L is stable

under ϕlh,ld+1 and hence D

ld+1 lh

= D.



Corollary 2.4. Let a = sup{λ ∈ Q : Dλ = D}, then a is a rational number and Da = D. Proof. Suppose dimK0 D = l. If a is not rational, by Dirichlet’s Approximation Theorem, there exist infinitely many pairs of integers (p, q) such that pq < a < pq + q12 . d

1

d

Choose q > l and let (p, q) = (d, h). By the above Lemma, D h + lh = D h = D and 1 < a, a contradiction. hence hd + lh The second part of the corollary follows from Lemma 2.3(1).  Proposition 2.5. Set grµ D = Dµ /D>µ , then grµ D is pure of slope µ. Proof. By Lemma 2.2, we can replace D by Dµ /D>µ , and assume Dµ = D and D>µ = 0. Let µ = hd , then there exists a WOE -lattice M of Dµ = D which is stable under ϕh,d . The filtration of sub-k-vector spaces ··· ⊆

ϕnh,d (M ) ϕnh,d (M ) M ⊆ ⊆ ··· ⊆ n n ϕh,d (M ) ∩ πM ϕh,d (M ) ∩ πM πM

of M/πM is stable since dimk M/πM = dimK0 D is finite. If

ϕN h,d (M ) ϕN h,d (M )∩πM

= 0 when N is sufficiently large, then ϕnN h,N d (M ) ⊆ π n M for

all n ∈ N, which implies that M ⊆ ∩n≥0 ϕ−n N h,N d+1 (M ). This is not possible since D>µ = 0. As a consequence, when N is sufficiently large, we have a bijection of the nonzero k-vector space ϕnh,d :

ϕN h,d (M ) N ϕh,d (M )∩πM

to itself

ϕN h,d (M ) ϕN h,d (M ) ∩ πM



ϕN h,d (M ) ϕN h,d (M ) ∩ πM

for n ∈ N. Replace (h, d) by (N h, N d) and still denote it by (h, d), then we get a bijection ϕh,d (M ) ϕh,d (M ) ϕnh,d : → ϕh,d (M ) ∩ πM ϕh,d (M ) ∩ πM for any n ∈ N. If ϕh,d : M → M is not bijective, then there exists x1 satisfying ϕh,d (x1 ) ∈ πM and x1 ∈ / πM . Indeed, if ϕh,d : M → M is not surjective, we can find an element x ∈ M and x ∈ / ϕh,d (M ). Since ϕh,d (M ) is still a WOE -lattice in D, we can find k ∈ N such that π k x ∈ ϕh,d (M ), and π k−1 x ∈ / ϕh,d (M ). Then take x1 ∈ M to be the preimage of π k x. We now construct by induction a sequence (xn ) such that xn − xn−1 ∈ π n−1 M and ϕih,d (xn ) ∈ π i M for any 1 ≤ i ≤ n. Suppose x1 , x2 · · · xn have been constructed and ϕnh,d (xn ) = π n zn . Let xn+1 = xn + π n y. It’s easy to see ϕih,d (xn+1 ) ∈ π i M n+1 n for 1 ≤ i ≤ n if y ∈ M . Since ϕn+1 h,d (xn+1 ) = π (ϕh,d (zn ) + ϕh,d (y)), to have

6

YIWEN DING AND YI OUYANG

n+1 ϕn+1 M , it’s sufficient to find y ∈ M such that ϕh,d (zn ) + ϕn+1 h,d (xn+1 ) ∈ π h,d (y) ∈ πM , but this is guaranteed by the bijection ϕh,d (M ) ϕh,d (M ) ϕnh,d : → . ϕh,d (M ) ∩ πM ϕh,d (M ) ∩ πM

Take x = limn→∞ xn , then x ∈ M , x 6= 0. It’s easy to see ϕnh,d (x) ∈ π n M for >µ any n ≥ 0, so x ∈ ∩n≥0 ϕ−n = 0.  h,d+1 (M ) which contradicts to D Since D is of finite dimension, grµ D = 0 for all but finitely many µ. Suppose µ1 > µ2 > · · · > µr are all the µ’s such that grµ D 6= 0. In fact we can take µ1 = sup{λ ∈ Q : Dλ 6= 0} and µi = sup{λ ∈ Q : Dλ ) Dµi−1 } when i > 1. By Lemma 2.3 (1), Dµi ) Dµi−1 , and if µi > µ > µi+1 , then Dµ =Dµi . We have Proposition 2.6. Suppose D is a ϕ-module. Then the filtration 0 ( Dµ1 = grµ1 D ( Dµ2 ( · · · ( Dµr = D is the Harder-Narasimhan filtration of D, i.e., the unique filtration · · · ( Di ( Di+1 ( · · · of ϕ-modules such that the Di /Di−1 ’s are pure of strictly decreasing slopes. Proof. The existence follows from Proposition 2.5. For the uniqueness, by Lemma 2.2, for a Harder-Narasimhan filtration 0 = D0 ( D1 ( · · · ( Ds = D of D, then Dµ = 0 for µ > µ(D1 ) and Dµ(D1 ) = D1 6= 0. We also have Dµ = 0 for µ > µ1 and Dµ1 6= 0. Thus µ(D1 ) = µ1 and D1 = Dµ1 . Now the rest follows from induction on the length of the filtration.  Proposition 2.7. Suppose 0 → D1 → D → D2 → 0 is a short exact sequence of ϕ-modules, then for every µ ∈ Q, 0 → D1µ → Dµ → D2µ → 0 is also exact. Proof. We prove by induction on the dimension of D. The case dim D = 1 is trivial. In general, suppose dim D ≥ 2 and D1 is a non-zero proper sub-object of D. We assume D0 is the second to last term of the Harder-Narasimhan filtration of D, and D00 = D/D0 , then for the exact sequence 0 → D0 → D → D00 → 0 and µ ∈ Q, the complex 0 → D0µ → Dµ → D00µ → 0 is always exact. We have the following commutative diagram with exact rows and columns: 0 0 0       y y y 0 −−−−→ D10 −−−−→   y

D0 −−−−→   y

D20 −−−−→ 0  i y1

0 −−−−→ D1 −−−−→   y

D −−−−→   y

D2 −−−−→ 0   y

D00 −−−−→   y

D200 −−−−→ 0   y

i

0 −−−−→ D100 −−−2−→   y

0 0 0 where D10 = D1 ∩ D0 and D20 = D0 /D10 and D100 = D1 /D10 , the injections i1 and i2 are defined by diagram chasing, and D200 = D00 /D100 ∼ = D2 /D20 is obtained by snake

´ A PROOF OF DIEUDONNE-MANIN THEOREM

7

lemma. Now take the µ-invariant of the above diagram, by induction, we have exact sequences in all rows and columns except the middle row, then the middle row must also be exact by diagram chasing.  Proof of Theorem 1.3. We are now ready to prove the theorem of Dieudonn´e-Manin. Suppose D is a ϕ-module over k, such that 0 = D0 ( D1 ( · · · ( Dr−1 ( Dr = D is the Harder-Narasimhan filtration of D, suppose µi = µ(Di /Di−1 ). Since ϕ is bijective on D, replace ϕ and σ by ϕ−1 and σ −1 , then D can be regarded as a ϕ−1 -module and we can develop the Harder-Narasimhan filtration for D as a ϕ−1 modules, i.e., D possesses a unique filtration 0 0 = D00 ( D10 ( · · · ( Ds−1 ( Ds0 = D 0 0 such that Di0 /Di−1 are pure of slope µ0i = µ0 (ϕ−1 , Di0 /Di−1 ) as ϕ−1 -modules and 0 −1 µi ’s are strictly decreasing. By definition we see that a ϕ -module pure of slope 0 µ is nothing but a ϕ-module pure of slope −µ, thus 0 = D00 ( D10 ( · · · ( Ds−1 ( 0 0 0 Ds = D is the unique filtration of D such that the sequences µ(Di /Di−1 ) = −µ0i are strictly increasing. It suffices to show that D = ⊕(Di /Di−1 ). We show it by induction on the length s of the (ϕ−1 )- Harder-Narasimhan filtration of D. The case s = 1 is trivial. In general, we have Dµ = 0 for µ > µ1 and Dµ1 = D1 6= 0. By Proposition 2.7 and 0 0 6= 0, induction hypothesis, we also have Dµ = 0 for µ > −µ0s and D−µs ∼ = D/Ds−1 0 0 ∼ thus µ1 = −µs and D1 = D/Ds−1 is a direct summand of D. By induction, this finishes the proof of the theorem. 

References [1] Fontaine, J.-M. and Ouyang, Y., Theory of p-adic Galois representations, to appear. [2] Manin, J. I., Theory of commutative formal groups over fields of finite characteristic, (Russian) Uspehi Mat. Nauk 18 1963 no. 6 (114), 3-90. MR0157972 (28 #1200)

A SIMPLE PROOF OF DIEUDONNÉ-MANIN ...

Abstract. The Dieudonné-Manin classification theorem on &-modules (&- isocrystals) over a perfect field plays a very important role in p-adic Hodge theory. In this note, in a more general setting we give a new proof of this result, and in the course of the proof, we also give an explicit construction of the Harder-Narasimhan ...

280KB Sizes 2 Downloads 37 Views

Recommend Documents

A simple proof of the nonconcavifiability of functions ...
journal homepage: www.elsevier.com/locate/jmateco. Short communication ... have shown that such a quasiconcave function is not concavifiable,. i.e., that no ...

Proof Without Words: A Trigonometric Proof of the Arithmetic Mean ...
We prove wordlessly the arithmetic mean-geometric mean inequality for two positive numbers by an equivalent trigonometric inequality. Reference. 1. L. Tan, Proof without words: Eisenstein's duplication formula, Math. Mag. 71 (1998) 207, http:// · dx.

A Synthetic Proof of Goormaghtigh's Generalization of ...
Jan 24, 2005 - C∗ respectively the reflections of A, B, C in the side BC, CA, AB. The following interesting theorem was due to J. R. Musselman. Theorem 1 (Musselman [2]). The circles AOA. ∗. , BOB. ∗. , COC. ∗ meet in a point which is the inv

Proof of pudding.pdf
Page. 1. /. 1. Loading… Page 1 of 1. Page 1 of 1. Proof of pudding.pdf. Proof of pudding.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Proof of pudding.pdf. Page 1 of 1.

Toward a machine-certified correctness proof of Wand's ...
verified the MGU axioms using the Coq's finite map library. 1. ... tions, the library is powerful and expressive. .... inference tool for ML: Damas–milner within Coq.

A Proof-of-Concept Project for Utilizing U3 ... - Semantic Scholar
Dec 3, 2007 - honeypots and discovery techniques. We are seeing emergent papers in the areas of mobile device forensics including PDAs, mobile phones ...

A DIRECT EMPIRICAL PROOF OF THE EXISTENCE ...
Aug 18, 2006 - or galaxy clusters (Gavazzi 2002; Pointecouteau & Silk. 2005) have used ... 3 Department of Astronomy, University of Florida, 211 Bryant.

pdf-0933\proof-of-heaven-a-neurosurgeons-near-death-experience ...
There was a problem loading more pages. Retrying... pdf-0933\proof-of-heaven-a-neurosurgeons-near-death-experience-and-journey-into-the-afterlife.pdf.

FREE [PDF] Proof of Heaven: A Neurosurgeon s ...
... the Afterlife book in english language, [download] Proof of Heaven: A Neurosurgeon s Journey into the Afterlife in format PDF, ... recovery is a medical miracle.

Towards a Formalized Completeness Proof of Wand's ...
Laramie, USA [email protected] ... to account for new variables introduced in the application rule. We have .... [1] Coq development team. The Coq proof ...

A proof theoretic view of spatial and temporal ...
Apr 25, 2016 - the meta theory and tools developed for linear logic to specify and verify bio- chemical systems ...... [Fn14]PM (fibroblast growth factor inducible immediate early response protein 14) but also to the receptor [TNFRSF25]PM (tumor necr

A new proof of Belyi's Theorem
A new proof of Belyi's Theorem is given. While Belyi's two proofs use different methods to first reduce the branch locus from Q to Q and then from Q to {0, 1, ∞} ...

Correctness proof of a new protocol for selfishness nodes ... - LSI
E − mail: [email protected] ... E − mail: [email protected] ... Definition 4 (Host state:) A host state Mh is a marking reachable from any marking M ...

[PDF] Download Proof of Heaven: A Neurosurgeon's ...
There he met, and spoke with, the Divine source of the universe itself. ... health can be achieved only when we realize that God and the soul are real and that death is not the end of ... No scientist or person of faith will be able to ignore it.

Download Proof of Heaven: A Neurosurgeon s Journey ...
Eben Alexander MD author of Living in a Mindful Universe Proof of Heaven A Neurosurgeon’s Journey into the Heart of Consciousness Proof of Heaven A ...

Ebook Downlaod Proof of Heaven: A Neurosurgeon s ...
Dr. Eben Alexander was one of those scientists. ... Alexander’s recovery is ... Today Alexander is a doctor who believes that true health can be achieved only.

A proof of Selberg's orthogonality for automorphic L ... - Springer Link
Sep 12, 2005 - a conjecture on convergence of a series on prime powers: ... following prime number theorem for automorphic representations. Corollary 1.2.

Embodied Language Acquisition: A Proof of Concept
... was implemented for extracting these components (see Section 4). Learning and Recognition System. An original approach to category learning using graph-based object and category representation is proposed. Section 4 is devoted to a thorough expla

A Synthetic Proof and Generalization of Bellavitis ...
Sep 18, 2006 - meets the Apollonius circle at C . Since arc CF = arc FC , the point C is the reflection of C in BD. ... E-mail address: [email protected].

A One-shot Proof of Arrow's Impossibility Theorem
Jan 20, 2012 - JEL Classification Numbers: D7, D70, D71. Keywords: Arrow's ... end with aj ⊳ ai. We call the first voter whose swap invalidates ai ⊳ aj the. 2 ...

[ePUB] Proof of Heaven: A Neurosurgeon's Journey ...
The Map of Heaven: A neurosurgeon explores the mysteries of the afterlife and the truth about what lies · beyond · Guided By Angels: There Are No Goodbyes, ...

Correctness proof of a new protocol for selfishness nodes ... - LSI
The resource limitation of nodes used in the ad hoc network, particulary the energy ... Definition 4 (Host state:) A host state Mh is a marking reachable from any ... have just to prove that when the monitoring node A sends n packets to B, then if ..