This repository has been archived by the owner on Jan 30, 2023. It is now read-only.
/
CR_template.pxi
2453 lines (2077 loc) · 79.5 KB
/
CR_template.pxi
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
"""
Capped relative template for complete discrete valuation rings and their fraction fields.
In order to use this template you need to write a linkage file and gluing file.
For an example see mpz_linkage.pxi (linkage file) and padic_capped_relative_element.pyx (gluing file).
The linkage file implements a common API that is then used in the class CRElement defined here.
See the documentation of mpz_linkage.pxi for the functions needed.
The gluing file does the following:
- ctypedef's celement to be the appropriate type (e.g. mpz_t)
- includes the linkage file
- includes this template
- defines a concrete class inheriting from ``CRElement``, and implements
any desired extra methods
AUTHORS:
- David Roe (2012-3-1) -- initial version
"""
#*****************************************************************************
# Copyright (C) 2007-2012 David Roe <roed.math@gmail.com>
# William Stein <wstein@gmail.com>
#
# Distributed under the terms of the GNU General Public License (GPL)
# as published by the Free Software Foundation; either version 2 of
# the License, or (at your option) any later version.
#
# http://www.gnu.org/licenses/
#*****************************************************************************
# This file implements common functionality among template elements
include "padic_template_element.pxi"
from sage.structure.element cimport Element
from sage.rings.padics.common_conversion cimport comb_prec, _process_args_and_kwds
from sage.rings.integer_ring import ZZ
from sage.rings.rational_field import QQ
from sage.categories.sets_cat import Sets
from sage.categories.sets_with_partial_maps import SetsWithPartialMaps
from sage.categories.homset import Hom
cdef inline bint exactzero(long ordp):
"""
Whether a given valuation represents an exact zero.
"""
return ordp >= maxordp
cdef inline int check_ordp_mpz(mpz_t ordp) except -1:
"""
Checks for overflow after addition or subtraction of valuations.
There is another variant, :meth:`check_ordp`, for long input.
If overflow is detected, raises an ``OverflowError``.
"""
if mpz_fits_slong_p(ordp) == 0 or mpz_cmp_si(ordp, maxordp) > 0 or mpz_cmp_si(ordp, minusmaxordp) < 0:
raise OverflowError("valuation overflow")
cdef inline int assert_nonzero(CRElement x) except -1:
"""
Checks that ``x`` is distinguishable from zero.
Used in division and floor division.
"""
if exactzero(x.ordp):
raise ZeroDivisionError("cannot divide by zero")
if x.relprec == 0:
raise PrecisionError("cannot divide by something indistinguishable from zero.")
cdef class CRElement(pAdicTemplateElement):
cdef int _set(self, x, long val, long xprec, absprec, relprec) except -1:
"""
Sets the value of this element from given defining data.
This function is intended for use in conversion, and should
not be called on an element created with :meth:`_new_c`.
INPUT:
- ``x`` -- data defining a `p`-adic element: int, long,
Integer, Rational, other `p`-adic element...
- ``val`` -- the valuation of the resulting element
- ``xprec -- an inherent precision of ``x``
- ``absprec`` -- an absolute precision cap for this element
- ``relprec`` -- a relative precision cap for this element
TESTS::
sage: R = Zp(5)
sage: R(15) #indirect doctest
3*5 + O(5^21)
sage: R(15, absprec=5)
3*5 + O(5^5)
sage: R(15, relprec=5)
3*5 + O(5^6)
sage: R(75, absprec = 10, relprec = 9) #indirect doctest
3*5^2 + O(5^10)
sage: R(25/9, relprec = 5) #indirect doctest
4*5^2 + 2*5^3 + 5^5 + 2*5^6 + O(5^7)
sage: R(25/9, relprec = 4, absprec = 5) #indirect doctest
4*5^2 + 2*5^3 + O(5^5)
sage: R = Zp(5,5)
sage: R(25/9) #indirect doctest
4*5^2 + 2*5^3 + 5^5 + 2*5^6 + O(5^7)
sage: R(25/9, absprec = 5)
4*5^2 + 2*5^3 + O(5^5)
sage: R(25/9, relprec = 4)
4*5^2 + 2*5^3 + 5^5 + O(5^6)
sage: R = Zp(5); S = Zp(5, 6)
sage: S(R(17)) # indirect doctest
2 + 3*5 + O(5^6)
sage: S(R(17),4) # indirect doctest
2 + 3*5 + O(5^4)
sage: T = Qp(5); a = T(1/5) - T(1/5)
sage: R(a)
O(5^19)
sage: S(a)
O(5^19)
sage: S(a, 17)
O(5^17)
sage: R = Zp(5); S = ZpCA(5)
sage: R(S(17, 5)) #indirect doctest
2 + 3*5 + O(5^5)
"""
IF CELEMENT_IS_PY_OBJECT:
polyt = type(self.prime_pow.modulus)
self.unit = <celement>polyt.__new__(polyt)
cconstruct(self.unit, self.prime_pow)
cdef long rprec = comb_prec(relprec, self.prime_pow.ram_prec_cap)
cdef long aprec = comb_prec(absprec, xprec)
if aprec <= val: # this may also hit an exact zero, if aprec == val == maxordp
self._set_inexact_zero(aprec)
elif exactzero(val):
self._set_exact_zero()
else:
self.relprec = min(rprec, aprec - val)
self.ordp = val
if isinstance(x,CRElement) and x.parent() is self.parent():
cshift(self.unit, (<CRElement>x).unit, 0, self.relprec, self.prime_pow, True)
else:
cconv(self.unit, x, self.relprec, val, self.prime_pow)
cdef int _set_exact_zero(self) except -1:
"""
Sets ``self`` as an exact zero.
TESTS::
sage: R = Zp(5); R(0) #indirect doctest
0
"""
csetzero(self.unit, self.prime_pow)
self.ordp = maxordp
self.relprec = 0
cdef int _set_inexact_zero(self, long absprec) except -1:
"""
Sets ``self`` as an inexact zero with precision ``absprec``.
TESTS::
sage: R = Zp(5); R(0, 5) #indirect doctest
O(5^5)
"""
csetzero(self.unit, self.prime_pow)
self.ordp = absprec
self.relprec = 0
cdef CRElement _new_c(self):
"""
Creates a new element with the same basic info.
TESTS::
sage: R = Zp(5)
sage: R(6,5) * R(7,8) #indirect doctest
2 + 3*5 + 5^2 + O(5^5)
sage: R.<a> = ZqCR(25)
sage: S.<x> = ZZ[]
sage: W.<w> = R.ext(x^2 - 5)
sage: w * (w+1) #indirect doctest
w + w^2 + O(w^41)
"""
cdef type t = type(self)
cdef type polyt
cdef CRElement ans = t.__new__(t)
ans._parent = self._parent
ans.prime_pow = self.prime_pow
IF CELEMENT_IS_PY_OBJECT:
polyt = type(self.prime_pow.modulus)
ans.unit = <celement>polyt.__new__(polyt)
cconstruct(ans.unit, ans.prime_pow)
return ans
cdef pAdicTemplateElement _new_with_value(self, celement value, long absprec):
"""
Creates a new element with a given value and absolute precision.
Used by code that doesn't know the precision type.
"""
cdef CRElement ans = self._new_c()
ans.relprec = absprec
ans.ordp = 0
ccopy(ans.unit, value, ans.prime_pow)
ans._normalize()
return ans
cdef int _get_unit(self, celement value) except -1:
"""
Sets ``value`` to the unit of this p-adic element.
"""
ccopy(value, self.unit, self.prime_pow)
cdef int check_preccap(self) except -1:
"""
Checks that this element doesn't have precision higher than
allowed by the precision cap.
TESTS::
sage: Zp(5)(1).lift_to_precision(30)
Traceback (most recent call last):
...
PrecisionError: Precision higher than allowed by the precision cap.
"""
if self.relprec > self.prime_pow.ram_prec_cap:
raise PrecisionError("Precision higher than allowed by the precision cap.")
def __copy__(self):
"""
Return a copy of this element.
EXAMPLES::
sage: a = Zp(5,6)(17); b = copy(a)
sage: a == b
True
sage: a is b
False
"""
cdef CRElement ans = self._new_c()
ans.relprec = self.relprec
ans.ordp = self.ordp
ccopy(ans.unit, self.unit, ans.prime_pow)
return ans
cdef int _normalize(self) except -1:
"""
Normalizes this element, so that ``self.ordp`` is correct.
TESTS::
sage: R = Zp(5)
sage: R(6) + R(4) #indirect doctest
2*5 + O(5^20)
"""
cdef long diff
cdef bint is_zero
if not exactzero(self.ordp):
is_zero = creduce(self.unit, self.unit, self.relprec, self.prime_pow)
if is_zero:
self._set_inexact_zero(self.ordp + self.relprec)
else:
diff = cremove(self.unit, self.unit, self.relprec, self.prime_pow)
# diff is less than self.relprec since the reduction didn't yield zero
self.ordp += diff
check_ordp(self.ordp)
self.relprec -= diff
def __dealloc__(self):
"""
Deallocate the underlying data structure.
TESTS::
sage: R = Zp(5)
sage: a = R(17)
sage: del(a)
"""
cdestruct(self.unit, self.prime_pow)
def __reduce__(self):
"""
Return a tuple of a function and data that can be used to unpickle this
element.
TESTS::
sage: a = ZpCR(5)(-3)
sage: type(a)
<type 'sage.rings.padics.padic_capped_relative_element.pAdicCappedRelativeElement'>
sage: loads(dumps(a)) == a # indirect doctest
True
"""
return unpickle_cre_v2, (self.__class__, self.parent(), cpickle(self.unit, self.prime_pow), self.ordp, self.relprec)
cpdef _neg_(self):
"""
Return the additive inverse of this element.
EXAMPLES::
sage: R = Zp(5, 20, 'capped-rel', 'val-unit')
sage: R(5) + (-R(5)) # indirect doctest
O(5^21)
sage: -R(1)
95367431640624 + O(5^20)
sage: -R(5)
5 * 95367431640624 + O(5^21)
sage: -R(0)
0
"""
cdef CRElement ans = self._new_c()
ans.relprec = self.relprec
ans.ordp = self.ordp
if ans.relprec != 0:
cneg(ans.unit, self.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
return ans
cpdef _add_(self, _right):
"""
Return the sum of this element and ``_right``.
EXAMPLES::
sage: R = Zp(19, 5, 'capped-rel','series')
sage: a = R(-1); a
18 + 18*19 + 18*19^2 + 18*19^3 + 18*19^4 + O(19^5)
sage: b=R(-5/2); b
7 + 9*19 + 9*19^2 + 9*19^3 + 9*19^4 + O(19^5)
sage: a+b #indirect doctest
6 + 9*19 + 9*19^2 + 9*19^3 + 9*19^4 + O(19^5)
"""
cdef CRElement ans
cdef CRElement right = _right
cdef long tmpL
if self.ordp == right.ordp:
ans = self._new_c()
# The relative precision of the sum is the minimum of the relative precisions in this case,
# possibly decreasing if we got cancellation
ans.ordp = self.ordp
ans.relprec = min(self.relprec, right.relprec)
if ans.relprec != 0:
cadd(ans.unit, self.unit, right.unit, ans.relprec, ans.prime_pow)
ans._normalize()
else:
if self.ordp > right.ordp:
# Addition is commutative, swap so self.ordp < right.ordp
ans = right; right = self; self = ans
tmpL = right.ordp - self.ordp
if tmpL > self.relprec:
return self
ans = self._new_c()
ans.ordp = self.ordp
ans.relprec = min(self.relprec, tmpL + right.relprec)
if ans.relprec != 0:
cshift(ans.unit, right.unit, tmpL, ans.relprec, ans.prime_pow, False)
cadd(ans.unit, ans.unit, self.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
return ans
cpdef _sub_(self, _right):
"""
Return the difference of this element and ``_right``.
EXAMPLES::
sage: R = Zp(13, 4)
sage: R(10) - R(10) #indirect doctest
O(13^4)
sage: R(10) - R(11)
12 + 12*13 + 12*13^2 + 12*13^3 + O(13^4)
"""
cdef CRElement ans
cdef CRElement right = _right
cdef long tmpL
if self.ordp == right.ordp:
ans = self._new_c()
# The relative precision of the difference is the minimum of the relative precisions in this case,
# possibly decreasing if we got cancellation
ans.ordp = self.ordp
ans.relprec = min(self.relprec, right.relprec)
if ans.relprec != 0:
csub(ans.unit, self.unit, right.unit, ans.relprec, ans.prime_pow)
ans._normalize()
elif self.ordp < right.ordp:
tmpL = right.ordp - self.ordp
if tmpL > self.relprec:
return self
ans = self._new_c()
ans.ordp = self.ordp
ans.relprec = min(self.relprec, tmpL + right.relprec)
if ans.relprec != 0:
cshift(ans.unit, right.unit, tmpL, ans.relprec, ans.prime_pow, False)
csub(ans.unit, self.unit, ans.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
else:
tmpL = self.ordp - right.ordp
if tmpL > right.relprec:
return right._neg_()
ans = self._new_c()
ans.ordp = right.ordp
ans.relprec = min(right.relprec, tmpL + self.relprec)
if ans.relprec != 0:
cshift(ans.unit, self.unit, tmpL, ans.relprec, ans.prime_pow, False)
csub(ans.unit, ans.unit, right.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
return ans
def __invert__(self):
r"""
Returns the multiplicative inverse of this element.
.. NOTE::
The result of inversion always lives in the fraction
field, even if the element to be inverted is a unit.
EXAMPLES::
sage: R = Qp(7,4,'capped-rel','series'); a = R(3); a
3 + O(7^4)
sage: ~a # indirect doctest
5 + 4*7 + 4*7^2 + 4*7^3 + O(7^4)
"""
assert_nonzero(self)
cdef CRElement ans = self._new_c()
if ans.prime_pow.in_field == 0:
ans._parent = self._parent.fraction_field()
ans.prime_pow = ans._parent.prime_pow
ans.ordp = -self.ordp
ans.relprec = self.relprec
cinvert(ans.unit, self.unit, ans.relprec, ans.prime_pow)
return ans
cpdef _mul_(self, _right):
r"""
Return the product of this element and ``_right``.
EXAMPLES::
sage: R = Zp(5)
sage: a = R(2385,11); a
2*5 + 4*5^3 + 3*5^4 + O(5^11)
sage: b = R(2387625, 16); b
5^3 + 4*5^5 + 2*5^6 + 5^8 + 5^9 + O(5^16)
sage: a * b # indirect doctest
2*5^4 + 2*5^6 + 4*5^7 + 2*5^8 + 3*5^10 + 5^11 + 3*5^12 + 4*5^13 + O(5^14)
"""
cdef CRElement ans
cdef CRElement right = _right
if exactzero(self.ordp):
return self
if exactzero(right.ordp):
return right
ans = self._new_c()
ans.relprec = min(self.relprec, right.relprec)
if ans.relprec == 0:
ans._set_inexact_zero(self.ordp + right.ordp)
else:
ans.ordp = self.ordp + right.ordp
cmul(ans.unit, self.unit, right.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
check_ordp(ans.ordp)
return ans
cpdef _div_(self, _right):
"""
Return the quotient of this element and ``right``.
.. NOTE::
The result of division always lives in the fraction field,
even if the element to be inverted is a unit.
EXAMPLES::
sage: R = Zp(5,6)
sage: R(17) / R(21) #indirect doctest
2 + 4*5^2 + 3*5^3 + 4*5^4 + O(5^6)
sage: a = R(50) / R(5); a
2*5 + O(5^7)
sage: R(5) / R(50)
3*5^-1 + 2 + 2*5 + 2*5^2 + 2*5^3 + 2*5^4 + O(5^5)
sage: ~a
3*5^-1 + 2 + 2*5 + 2*5^2 + 2*5^3 + 2*5^4 + O(5^5)
sage: 1 / a
3*5^-1 + 2 + 2*5 + 2*5^2 + 2*5^3 + 2*5^4 + O(5^5)
"""
cdef CRElement ans
cdef CRElement right = _right
assert_nonzero(right)
ans = self._new_c()
if ans.prime_pow.in_field == 0:
ans._parent = self._parent.fraction_field()
ans.prime_pow = ans._parent.prime_pow
if exactzero(self.ordp):
ans._set_exact_zero()
return ans
ans.relprec = min(self.relprec, right.relprec)
if ans.relprec == 0:
ans._set_inexact_zero(self.ordp - right.ordp)
else:
ans.ordp = self.ordp - right.ordp
cdivunit(ans.unit, self.unit, right.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
check_ordp(ans.ordp)
return ans
def __pow__(CRElement self, _right, dummy):
r"""
Exponentiation.
When ``right`` is divisible by `p` then one can get more
precision than expected.
Lemma 2.1 [SP]_:
Let `\alpha` be in `\mathcal{O}_K`. Let
.. MATH::
p = -\pi_K^{e_K} \epsilon
be the factorization of `p` where `\epsilon` is a unit. Then
the `p`-th power of `1 + \alpha \pi_K^{\lambda}` satisfies
.. MATH::
(1 + \alpha \pi^{\lambda})^p \equiv \left{ \begin{array}{lll}
1 + \alpha^p \pi_K^{p \lambda} &
\mod \mathfrak{p}_K^{p \lambda + 1} &
\mbox{if $1 \le \lambda < \frac{e_K}{p-1}$} \\
1 + (\alpha^p - \epsilon \alpha) \pi_K^{p \lambda} &
\mod \mathfrak{p}_K^{p \lambda + 1} &
\mbox{if $\lambda = \frac{e_K}{p-1}$} \\
1 - \epsilon \alpha \pi_K^{\lambda + e} &
\mod \mathfrak{p}_K^{\lambda + e + 1} &
\mbox{if $\lambda > \frac{e_K}{p-1}$}
\end{array} \right.
So if ``right`` is divisible by `p^k` we can multiply the
relative precision by `p` until we exceed `e/(p-1)`, then add
`e` until we have done a total of `k` things: the precision of
the result can therefore be greater than the precision of
``self``.
For `\alpha` in `\ZZ_p` we can simplify the result a bit. In
this case, the `p`-th power of `1 + \alpha p^{\lambda}`
satisfies
.. MATH::
(1 + \alpha p^{\lambda})^p \equiv 1 + \alpha p^{\lambda + 1} mod p^{\lambda + 2}
unless `\lambda = 1` and `p = 2`, in which case
.. MATH::
(1 + 2 \alpha)^2 \equiv 1 + 4(\alpha^2 + \alpha) mod 8
So for `p \ne 2`, if right is divisible by `p^k` then we add
`k` to the relative precision of the answer.
For `p = 2`, if we start with something of relative precision
1 (ie `2^m + O(2^{m+1})`), `\alpha^2 + \alpha \equiv 0 \mod
2`, so the precision of the result is `k + 2`:
.. MATH::
(2^m + O(2^{m+1}))^{2^k} = 2^{m 2^k} + O(2^{m 2^k + k + 2})
For `p`-adic exponents, we define `\alpha^\beta` as
`\exp(\beta \log(\alpha))`. The precision of the result is
determined using the power series expansions for the
exponential and logarithm maps, together with the notes above.
.. NOTE::
For `p`-adic exponents we always need that `a` is a unit.
For unramified extensions `a^b` will converge as long as
`b` is integral (though it may converge for non-integral
`b` as well depending on the value of `a`). However, in
highly ramified extensions some bases may be sufficiently
close to `1` that `exp(b log(a))` does not converge even
though `b` is integral.
.. WARNING::
If `\alpha` is a unit, but not congruent to `1` modulo
`\pi_K`, the result will not be the limit over integers
`b` converging to `\beta` since this limit does not exist.
Rather, the logarithm kills torsion in `\ZZ_p^\times`, and
`\alpha^\beta` will equal `(\alpha')^\beta`, where
`\alpha'` is the quotient of `\alpha` by the Teichmuller
representative congruent to `\alpha` modulo `\pi_K`. Thus
the result will always be congruent to `1` modulo `\pi_K`.
REFERENCES:
.. [SP] *Constructing Class Fields over Local Fields*. Sebastian Pauli.
INPUT:
- ``_right`` -- currently integers and `p`-adic exponents are
supported.
- ``dummy`` -- not used (Python's ``__pow__`` signature
includes it)
EXAMPLES::
sage: R = Zp(19, 5, 'capped-rel','series')
sage: a = R(-1); a
18 + 18*19 + 18*19^2 + 18*19^3 + 18*19^4 + O(19^5)
sage: a^2 # indirect doctest
1 + O(19^5)
sage: a^3
18 + 18*19 + 18*19^2 + 18*19^3 + 18*19^4 + O(19^5)
sage: R(5)^30
11 + 14*19 + 19^2 + 7*19^3 + O(19^5)
sage: K = Qp(19, 5, 'capped-rel','series')
sage: a = K(-1); a
18 + 18*19 + 18*19^2 + 18*19^3 + 18*19^4 + O(19^5)
sage: a^2
1 + O(19^5)
sage: a^3
18 + 18*19 + 18*19^2 + 18*19^3 + 18*19^4 + O(19^5)
sage: K(5)^30
11 + 14*19 + 19^2 + 7*19^3 + O(19^5)
sage: K(5, 3)^19 #indirect doctest
5 + 3*19 + 11*19^3 + O(19^4)
`p`-adic exponents are also supported::
sage: a = K(8/5,4); a
13 + 7*19 + 11*19^2 + 7*19^3 + O(19^4)
sage: a^(K(19/7))
1 + 14*19^2 + 11*19^3 + 13*19^4 + O(19^5)
sage: (a // K.teichmuller(13))^(K(19/7))
1 + 14*19^2 + 11*19^3 + 13*19^4 + O(19^5)
sage: (a.log() * 19/7).exp()
1 + 14*19^2 + 11*19^3 + 13*19^4 + O(19^5)
"""
cdef long base_level, exp_prec
cdef mpz_t tmp
cdef Integer right
cdef CRElement base, pright, ans
cdef bint exact_exp
if (isinstance(_right, Integer) or isinstance(_right, (int, long)) or isinstance(_right, Rational)):
if _right < 0:
base = ~self
return base.__pow__(-_right, dummy)
exact_exp = True
elif self.parent() is _right.parent():
## For extension elements, we need to switch to the
## fraction field sometimes in highly ramified extensions.
exact_exp = False
pright = _right
else:
self, _right = canonical_coercion(self, _right)
return self.__pow__(_right, dummy)
if exact_exp and _right == 0:
# return 1 to maximum precision
ans = self._new_c()
ans.ordp = 0
ans.relprec = self.prime_pow.ram_prec_cap
csetone(ans.unit, ans.prime_pow)
return ans
if exactzero(self.ordp):
if exact_exp:
# We may assume from above that right > 0
return self
else:
# log(0) is not defined
raise ValueError("0^x is not defined for p-adic x: log(0) does not converge")
ans = self._new_c()
if self.relprec == 0:
# If a positive integer exponent, return an inexact zero of valuation right * self.ordp. Otherwise raise an error.
if isinstance(_right, (int, long)):
_right = Integer(_right)
if isinstance(_right, Integer):
right = <Integer>_right
mpz_init(tmp)
mpz_mul_si(tmp, (<Integer>_right).value, self.ordp)
check_ordp_mpz(tmp)
ans._set_inexact_zero(mpz_get_si(tmp))
mpz_clear(tmp)
else:
raise PrecisionError
elif exact_exp:
# exact_pow_helper is defined in padic_template_element.pxi
right = exact_pow_helper(&ans.relprec, self.relprec, _right, self.prime_pow)
if ans.relprec > self.prime_pow.ram_prec_cap:
ans.relprec = self.prime_pow.ram_prec_cap
mpz_init(tmp)
mpz_mul_si(tmp, right.value, self.ordp)
check_ordp_mpz(tmp)
ans.ordp = mpz_get_si(tmp)
mpz_clear(tmp)
cpow(ans.unit, self.unit, right.value, ans.relprec, ans.prime_pow)
else:
# padic_pow_helper is defined in padic_template_element.pxi
ans.relprec = padic_pow_helper(ans.unit, self.unit, self.ordp, self.relprec,
pright.unit, pright.ordp, pright.relprec, self.prime_pow)
ans.ordp = 0
return ans
cdef pAdicTemplateElement _lshift_c(self, long shift):
"""
Multiplies by `\pi^{\mbox{shift}}`.
Negative shifts may truncate the result if the parent is not a
field.
TESTS::
sage: a = Zp(5)(17); a
2 + 3*5 + O(5^20)
sage: a << 2 #indirect doctest
2*5^2 + 3*5^3 + O(5^22)
sage: a << -2
O(5^18)
sage: a << 0 == a
True
sage: Zp(5)(0) << -4000
0
"""
if exactzero(self.ordp):
return self
if self.prime_pow.in_field == 0 and shift < 0 and -shift > self.ordp:
return self._rshift_c(-shift)
cdef CRElement ans = self._new_c()
ans.relprec = self.relprec
ans.ordp = self.ordp + shift
check_ordp(ans.ordp)
ccopy(ans.unit, self.unit, ans.prime_pow)
return ans
cdef pAdicTemplateElement _rshift_c(self, long shift):
"""
Divides by ``\pi^{\mbox{shift}}``.
Positive shifts may truncate the result if the parent is not a
field.
TESTS::
sage: R = Zp(5); K = Qp(5)
sage: R(17) >> 1
3 + O(5^19)
sage: K(17) >> 1
2*5^-1 + 3 + O(5^19)
sage: R(17) >> 40
O(5^0)
sage: K(17) >> -5
2*5^5 + 3*5^6 + O(5^25)
"""
if exactzero(self.ordp):
return self
cdef CRElement ans = self._new_c()
cdef long diff
if self.prime_pow.in_field == 1 or shift <= self.ordp:
ans.relprec = self.relprec
ans.ordp = self.ordp - shift
check_ordp(ans.ordp)
ccopy(ans.unit, self.unit, ans.prime_pow)
else:
diff = shift - self.ordp
if diff >= self.relprec:
ans._set_inexact_zero(0)
else:
ans.relprec = self.relprec - diff
cshift(ans.unit, self.unit, -diff, ans.relprec, ans.prime_pow, False)
ans.ordp = 0
ans._normalize()
return ans
cpdef _floordiv_(self, _right):
"""
Floor division.
TESTS::
sage: r = Zp(19)
sage: a = r(1+19+17*19^3+5*19^4); b = r(19^3); a/b
19^-3 + 19^-2 + 17 + 5*19 + O(19^17)
sage: a//b # indirect doctest
17 + 5*19 + O(19^17)
sage: R = Zp(19, 5, 'capped-rel','series')
sage: a = R(-1); a
18 + 18*19 + 18*19^2 + 18*19^3 + 18*19^4 + O(19^5)
sage: b=R(-2*19^3); b
17*19^3 + 18*19^4 + 18*19^5 + 18*19^6 + 18*19^7 + O(19^8)
sage: a//b # indirect doctest
9 + 9*19 + O(19^2)
sage: R = Zp(5,5)
sage: R(28937) // R(75) # indirect doctest
4 + 3*5 + 3*5^2 + O(5^3)
sage: R(0,12) // R(175,3)
O(5^10)
"""
if exactzero(self.ordp):
return self
cdef CRElement right = _right
assert_nonzero(right)
cdef CRElement ans = self._new_c()
cdef long diff = self.ordp - right.ordp
if self.relprec == 0:
ans.ordp = diff
ans.relprec = 0
csetzero(ans.unit, ans.prime_pow)
elif diff >= 0 or self.prime_pow.in_field:
ans.ordp = diff
ans.relprec = min(self.relprec, right.relprec)
cdivunit(ans.unit, self.unit, right.unit, ans.relprec, ans.prime_pow)
creduce(ans.unit, ans.unit, ans.relprec, ans.prime_pow)
else:
ans.ordp = 0
ans.relprec = min(self.relprec, right.relprec) + diff
if ans.relprec < 0:
ans.relprec = 0
csetzero(ans.unit, ans.prime_pow)
else:
cdivunit(ans.unit, self.unit, right.unit, ans.relprec - diff, ans.prime_pow)
cshift(ans.unit, ans.unit, diff, ans.relprec, ans.prime_pow, False)
ans._normalize()
return ans
def add_bigoh(self, absprec):
"""
Returns a new element with absolute precision decreased to
``absprec``.
INPUT:
- ``absprec`` -- an integer or infinity
OUTPUT:
an equal element with precision set to the minimum of ``self's``
precision and ``absprec``
EXAMPLES::
sage: R = Zp(7,4,'capped-rel','series'); a = R(8); a.add_bigoh(1)
1 + O(7)
sage: b = R(0); b.add_bigoh(3)
O(7^3)
sage: R = Qp(7,4); a = R(8); a.add_bigoh(1)
1 + O(7)
sage: b = R(0); b.add_bigoh(3)
O(7^3)
The precision never increases::
sage: R(4).add_bigoh(2).add_bigoh(4)
4 + O(7^2)
Another example that illustrates that the precision does
not increase::
sage: k = Qp(3,5)
sage: a = k(1234123412/3^70); a
2*3^-70 + 3^-69 + 3^-68 + 3^-67 + O(3^-65)
sage: a.add_bigoh(2)
2*3^-70 + 3^-69 + 3^-68 + 3^-67 + O(3^-65)
sage: k = Qp(5,10)
sage: a = k(1/5^3 + 5^2); a
5^-3 + 5^2 + O(5^7)
sage: a.add_bigoh(2)
5^-3 + O(5^2)
sage: a.add_bigoh(-1)
5^-3 + O(5^-1)
"""
cdef CRElement ans
cdef long aprec, newprec
if absprec is infinity:
return self
elif isinstance(absprec, int):
aprec = absprec
else:
if not isinstance(absprec, Integer):
absprec = Integer(absprec)
if mpz_fits_slong_p((<Integer>absprec).value) == 0:
if mpz_sgn((<Integer>absprec).value) == -1:
raise ValueError("absprec must fit into a signed long")
else:
aprec = self.prime_pow.ram_prec_cap
else:
aprec = mpz_get_si((<Integer>absprec).value)
if aprec < 0 and not self.parent().is_field():
return self.parent().fraction_field()(self).add_bigoh(absprec)
if aprec < self.ordp:
ans = self._new_c()
ans._set_inexact_zero(aprec)
elif aprec >= self.ordp + self.relprec:
ans = self
else:
ans = self._new_c()
ans.ordp = self.ordp
ans.relprec = aprec - self.ordp
creduce(ans.unit, self.unit, ans.relprec, ans.prime_pow)
return ans
cpdef bint _is_exact_zero(self) except -1:
"""
Returns true if this element is exactly zero.
EXAMPLES::
sage: R = Zp(5)
sage: R(0)._is_exact_zero()
True
sage: R(0,5)._is_exact_zero()
False
sage: R(17)._is_exact_zero()
False
"""
return exactzero(self.ordp)
cpdef bint _is_inexact_zero(self) except -1:
"""
Returns True if this element is indistinguishable from zero
but has finite precision.
EXAMPLES::
sage: R = Zp(5)
sage: R(0)._is_inexact_zero()
False
sage: R(0,5)._is_inexact_zero()
True
sage: R(17)._is_inexact_zero()
False
"""
return self.relprec == 0 and not exactzero(self.ordp)
def is_zero(self, absprec = None):
r"""
Determines whether this element is zero modulo
`\pi^{\mbox{absprec}}`.
If ``absprec is None``, returns ``True`` if this element is
indistinguishable from zero.
INPUT:
- ``absprec`` -- an integer, infinity, or ``None``
EXAMPLES::
sage: R = Zp(5); a = R(0); b = R(0,5); c = R(75)
sage: a.is_zero(), a.is_zero(6)
(True, True)
sage: b.is_zero(), b.is_zero(5)
(True, True)
sage: c.is_zero(), c.is_zero(2), c.is_zero(3)
(False, True, False)
sage: b.is_zero(6)
Traceback (most recent call last):
...
PrecisionError: Not enough precision to determine if element is zero
"""
if absprec is None:
return self.relprec == 0
if exactzero(self.ordp):
return True
if absprec is infinity:
return False
if isinstance(absprec, int):
if self.relprec == 0 and absprec > self.ordp:
raise PrecisionError("Not enough precision to determine if element is zero")
return self.ordp >= absprec
if not isinstance(absprec, Integer):
absprec = Integer(absprec)
if self.relprec == 0:
if mpz_cmp_si((<Integer>absprec).value, self.ordp) > 0:
raise PrecisionError("Not enough precision to determine if element is zero")
else:
return True
return mpz_cmp_si((<Integer>absprec).value, self.ordp) <= 0