-
Notifications
You must be signed in to change notification settings - Fork 63
/
ResidueField.jl
510 lines (414 loc) · 14.2 KB
/
ResidueField.jl
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
###############################################################################
#
# residue_field.jl : residue fields (modulo a principal ideal)
#
###############################################################################
###############################################################################
#
# Data type and parent object methods
#
###############################################################################
base_ring_type(::Type{ResidueField{T}}) where T <: RingElement = parent_type(T)
base_ring(S::ResidueField{T}) where {T <: RingElement} = S.base_ring::parent_type(T)
parent(a::ResFieldElem) = a.parent
is_domain_type(a::Type{T}) where T <: ResFieldElem = true
function is_exact_type(a::Type{T}) where {S <: RingElement, T <: ResFieldElem{S}}
return is_exact_type(S)
end
function check_parent(a::ResFieldElem, b::ResFieldElem, throw::Bool = true)
Ra = parent(a)
Rb = parent(b)
if Ra != Rb
fl = typeof(Ra) == typeof(Rb) && modulus(Ra) == modulus(Rb)
!fl && throw && error("Incompatible moduli in residue operation")
#CF: maybe extend to divisibility?
return fl
end
return true
end
###############################################################################
#
# Basic manipulation
#
###############################################################################
function Base.hash(a::ResFieldElem, h::UInt)
b = 0x539c1c8715c1adc2%UInt
return xor(b, xor(hash(data(a), h), h))
end
@doc raw"""
modulus(S::ResidueField)
Return the modulus $a$ of the given residue ring $S = R/(a)$.
"""
function modulus(S::ResidueField)
return S.modulus
end
@doc raw"""
modulus(r::ResFieldElem)
Return the modulus $a$ of the residue ring $S = R/(a)$ that the supplied
residue $r$ belongs to.
"""
function modulus(r::ResFieldElem)
return modulus(parent(r))
end
@doc raw"""
characteristic(R::ResidueField)
Return the characteristic of the residue field.
"""
function characteristic(R::ResidueField)
return characteristic(base_ring(R))
end
@doc raw"""
characteristic(r::ResidueField{T}) where T <: Integer
Return the modulus $a$ of the residue ring $S = R/(a)$ that the supplied
residue $r$ belongs to.
"""
function characteristic(r::ResidueField{T}) where T <: Integer
return modulus(r)
end
data(a::ResFieldElem) = a.data
lift(a::ResFieldElem) = data(a)
lift(a::ResFieldElem{Int}) = BigInt(data(a))
zero(R::ResidueField) = R(0)
one(R::ResidueField) = R(1)
iszero(a::ResFieldElem) = iszero(data(a))
isone(a::ResFieldElem) = isone(data(a))
function is_unit(a::ResFieldElem)
g = gcd(data(a), modulus(a))
return isone(g)
end
deepcopy_internal(a::ResFieldElem, dict::IdDict) = parent(a)(deepcopy_internal(data(a), dict))
###############################################################################
#
# Canonicalisation
#
###############################################################################
function canonical_unit(x::ResFieldElem{<:Union{Integer, RingElem}})
if iszero(x)
return one(parent(x))
end
return x
end
###############################################################################
#
# AbstractString I/O
#
###############################################################################
function expressify(@nospecialize(a::ResFieldElem); context = nothing)
return expressify(data(a), context = context)
end
@enable_all_show_via_expressify ResFieldElem
function show(io::IO, a::ResidueField)
@show_name(io, a)
@show_special(io, a)
if is_terse(io)
print(io, "Residue field")
else
io = pretty(io)
print(io, "Residue field of ",)
print(terse(io), Lowercase(), base_ring(a))
print(io, " modulo ", modulus(a))
end
end
###############################################################################
#
# Unary operations
#
###############################################################################
function -(a::ResFieldElem)
parent(a)(-data(a))
end
###############################################################################
#
# Binary operators
#
###############################################################################
function +(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
check_parent(a, b)
return parent(a)(data(a) + data(b))
end
function -(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
check_parent(a, b)
return parent(a)(data(a) - data(b))
end
function *(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
check_parent(a, b)
return parent(a)(data(a) * data(b))
end
###############################################################################
#
# Ad hoc binary operations
#
###############################################################################
*(a::ResFieldElem, b::Union{Integer, Rational, AbstractFloat}) = parent(a)(data(a) * b)
*(a::ResFieldElem{T}, b::T) where {T <: RingElem} = parent(a)(data(a) * b)
*(a::Union{Integer, Rational, AbstractFloat}, b::ResFieldElem) = parent(b)(a * data(b))
*(a::T, b::ResFieldElem{T}) where {T <: RingElem} = parent(b)(a * data(b))
+(a::ResFieldElem, b::Union{Integer, Rational, AbstractFloat}) = parent(a)(data(a) + b)
+(a::ResFieldElem{T}, b::T) where {T <: RingElem} = parent(a)(data(a) + b)
+(a::Union{Integer, Rational, AbstractFloat}, b::ResFieldElem) = parent(b)(a + data(b))
+(a::T, b::ResFieldElem{T}) where {T <: RingElem} = parent(b)(a + data(b))
-(a::ResFieldElem, b::Union{Integer, Rational, AbstractFloat}) = parent(a)(data(a) - b)
-(a::ResFieldElem{T}, b::T) where {T <: RingElem} = parent(a)(data(a) - b)
-(a::Union{Integer, Rational, AbstractFloat}, b::ResFieldElem) = parent(b)(a - data(b))
-(a::T, b::ResFieldElem{T}) where {T <: RingElem} = parent(b)(a - data(b))
###############################################################################
#
# Powering
#
###############################################################################
function ^(a::ResFieldElem, b::Integer)
parent(a)(powermod(data(a), b, modulus(a)))
end
###############################################################################
#
# Comparison
#
###############################################################################
@doc raw"""
==(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
Return `true` if $a == b$ arithmetically, otherwise return `false`. Recall
that power series to different precisions may still be arithmetically
equal to the minimum of the two precisions.
"""
function ==(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
fl = check_parent(a, b, false)
!fl && return false
return data(a) == data(b)
end
@doc raw"""
isequal(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
Return `true` if $a == b$ exactly, otherwise return `false`. This function is
useful in cases where the data of the residues are inexact, e.g. power series
Only if the power series are precisely the same, to the same precision, are
they declared equal by this function.
"""
function isequal(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
check_parent(a, b)
return isequal(data(a), data(b))
end
###############################################################################
#
# Ad hoc comparison
#
###############################################################################
@doc raw"""
==(a::ResFieldElem, b::Union{Integer, Rational, AbstractFloat})
Return `true` if $a == b$ arithmetically, otherwise return `false`.
"""
function ==(a::ResFieldElem, b::Union{Integer, Rational, AbstractFloat})
z = base_ring(a)(b)
return data(a) == mod(z, modulus(a))
end
@doc raw"""
==(a::Union{Integer, Rational, AbstractFloat}, b::ResFieldElem)
Return `true` if $a == b$ arithmetically, otherwise return `false`.
"""
function ==(a::Union{Integer, Rational, AbstractFloat}, b::ResFieldElem)
z = base_ring(b)(a)
return data(b) == mod(z, modulus(b))
end
@doc raw"""
==(a::ResFieldElem{T}, b::T) where {T <: RingElem}
Return `true` if $a == b$ arithmetically, otherwise return `false`.
"""
function ==(a::ResFieldElem{T}, b::T) where {T <: RingElem}
z = base_ring(a)(b)
return data(a) == mod(z, modulus(a))
end
@doc raw"""
==(a::T, b::ResFieldElem{T}) where {T <: RingElem}
Return `true` if $a == b$ arithmetically, otherwise return `false`.
"""
function ==(a::T, b::ResFieldElem{T}) where {T <: RingElem}
z = base_ring(b)(a)
return data(b) == mod(z, modulus(b))
end
###############################################################################
#
# Inversion
#
###############################################################################
@doc raw"""
inv(a::ResFieldElem)
Return the inverse of the element $a$ in the residue ring. If an impossible
inverse is encountered, an exception is raised.
"""
function Base.inv(a::ResFieldElem)
g, ainv = gcdinv(data(a), modulus(a))
if !isone(g)
error("Impossible inverse in inv")
end
return parent(a)(ainv)
end
###############################################################################
#
# Exact division
#
###############################################################################
function divexact(a::ResFieldElem{T}, b::ResFieldElem{T}; check::Bool=true) where {T <: RingElement}
check_parent(a, b)
fl, q = divides(a, b)
return q
end
function divides(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
check_parent(a, b)
iszero(b) && error("Division by zero in divides")
return true, a*inv(b)
end
###############################################################################
#
# GCD
#
###############################################################################
@doc raw"""
gcd(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
Return a greatest common divisor of $a$ and $b$ if one exists. This is done
by taking the greatest common divisor of the data associated with the
supplied residues and taking its greatest common divisor with the modulus.
"""
function gcd(a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
check_parent(a, b)
return parent(a)(gcd(gcd(data(a), modulus(a)), data(b)))
end
###############################################################################
#
# Square root
#
###############################################################################
@doc raw"""
is_square(a::ResFieldElem{T}) where T <: Integer
Return `true` if $a$ is a square.
"""
function is_square(a::ResFieldElem{T}) where T <: Integer
if iszero(a)
return true
end
p = modulus(a)
pm1div2 = div(p - 1, 2)
return isone(a^pm1div2)
end
@doc raw"""
sqrt(a::ResFieldElem{T}; check::Bool=true) where T <: Integer
Return the square root of $a$. By default the function will throw an exception
if the input is not square. If `check=false` this test is omitted.
"""
function Base.sqrt(a::ResFieldElem{T}; check::Bool=true) where T <: Integer
U = parent(a)
p = modulus(a)
if p == 2 # special case, cannot find a quadratic nonresidue mod 2
return deepcopy(a)
end
# Compute Q, S such that p - 1 = Q*2^S
Q = p - 1
S = 0 # power of 2 dividing p - 1
while iseven(Q)
Q >>= 1
S += 1
end
# find a quadratic nonresidue z mod p
z = U(rand(1:p - 1))
while is_square(z)
z = U(rand(1:p - 1))
end
# set up
M = S
c = z^Q
t = a^Q
R = a^div(Q + 1, 2)
# main loop
while true
if iszero(t)
return zero(U)
end
if isone(t)
return R
end
u = t
i = 0
while i < M
if isone(u)
break
end
u = u^2
i += 1
end
check && i == M && error("Not a square in sqrt")
b = c
for j = 1:M - i - 1
b = b^2
end
M = i
c = b^2
t *= c
R *= b
end
end
###############################################################################
#
# Unsafe functions
#
###############################################################################
function zero!(a::ResFieldElem{T}) where {T <: RingElement}
a.data = zero!(a.data)
return a
end
function mul!(c::ResFieldElem{T}, a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
c.data = mod(data(a)*data(b), modulus(a))
return c
end
function add!(c::ResFieldElem{T}, a::ResFieldElem{T}, b::ResFieldElem{T}) where {T <: RingElement}
c.data = mod(data(a) + data(b), modulus(a))
return c
end
###############################################################################
#
# Random functions
#
###############################################################################
RandomExtensions.maketype(R::ResidueField, _) = elem_type(R)
function rand(rng::AbstractRNG,
sp::SamplerTrivial{<:Make2{<:ResFieldElem{T},
<:ResidueField{T}}}
) where {T}
S, v = sp[][1:end]
S(rand(rng, v))
end
function RandomExtensions.make(S::ResidueField, vs...)
R = base_ring(S)
if length(vs) == 1 && elem_type(R) == Random.gentype(vs[1])
Make(S, vs[1])
else
Make(S, make(base_ring(S), vs...))
end
end
rand(rng::AbstractRNG, S::ResidueField, v...) = rand(rng, make(S, v...))
rand(S::ResidueField, v...) = rand(Random.GLOBAL_RNG, S, v...)
###############################################################################
#
# residue_field constructor
#
###############################################################################
@doc raw"""
residue_field(R::Ring, a::RingElement; cached::Bool = true)
Create the residue ring $R/(a)$ where $a$ is an element of the ring $R$. We
require $a \neq 0$. If `cached == true` (the default) then the resulting
residue ring parent object is cached and returned for any subsequent calls
to the constructor with the same base ring $R$ and element $a$.
"""
function residue_field(R::Ring, a::RingElement; cached::Bool = true)
iszero(a) && throw(DivideError())
T = elem_type(R)
S = EuclideanRingResidueField{T}(R(a), cached)
return S, Generic.EuclideanRingResidueMap(R, S)
end
@doc raw"""
quo(::Type{Field}, R::Ring, a::RingElement; cached::Bool = true)
Returns `S, f` where `S = residue_field(R, a)` and `f` is the
projection map from `R` to `S`. This map is supplied as a map with section
where the section is the lift of an element of the residue field back
to the ring `R`.
"""
function quo(::Type{Field}, R::Ring, a::RingElement; cached::Bool = true)
S, f = residue_field(R, a; cached = cached)
return S, f
end