algebra 0.2.1

data/doc-ja/sample-factorize01.rb.v.rd

@@ -0,0 +1,11 @@
+=begin
+  # sample-factorize01.rb
+
+  require "algebra"
+  
+  P = Polynomial(Integer, "x")
+  x = P.var
+  f = 8*x**7 - 20*x**6 + 6*x**5 - 11*x**4 + 44*x**3 - 9*x**2 - 27
+  p f.factorize #=> (2x - 3)^3(x^2 + x + 1)^2
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-factorize02.rb.v.rd

@@ -0,0 +1,13 @@
+=begin
+  # sample-factorize02.rb
+
+  require "algebra"
+  
+  Z7 = ResidueClassRing(Integer, 7)
+  P = Polynomial(Z7, "x")
+  x = P.var
+  f = 8*x**7 - 20*x**6 + 6*x**5 - 11*x**4 + 44*x**3 - 9*x**2 - 27
+  p f.factorize #=> (x + 5)^2(x + 3)^2(x + 2)^3
+  
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-factorize03.rb.v.rd

@@ -0,0 +1,14 @@
+=begin
+  # sample-factorize03.rb
+
+  require "algebra"
+  
+  A = AlgebraicExtensionField(Rational, "a") {|a| a**2 + a + 1}
+  a = A.var
+  P = Polynomial(A, "x")
+  x = P.var
+  f = x**4 + (2*a + 1)*x**3 + 3*a*x**2 + (-3*a - 5)*x - a + 1
+  p f.factorize #=> (x + a)^3(x - a + 1)
+  
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-factorize04.rb.v.rd

@@ -0,0 +1,14 @@
+=begin
+  # sample-factorize04.rb
+
+  require "algebra"
+  
+  A = AlgebraicExtensionField(Rational, "a") {|a| a**2 - 2}
+  B = AlgebraicExtensionField(A, "b"){|b| b**2 + 1}
+  P = Polynomial(B, "x")
+  x = P.var
+  f = x**4 + 1
+  p f.factorize
+  #=> (x - 1/2ab - 1/2a)(x + 1/2ab - 1/2a)(x + 1/2ab + 1/2a)(x - 1/2ab + 1/2a)
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-factorize05.rb.v.rd

@@ -0,0 +1,53 @@
+=begin
+  # sample-factorize05.rb
+
+  require "algebra"
+  
+  def show(f, mod = 0)
+    if mod > 0
+      zp = ResidueClassRing(Integer, mod)
+      pzp = Polynomial(zp, f.variable)
+      f = f.convert_to(pzp)
+    end
+    fact = f.factorize
+    printf "mod %2d: %-15s  =>  %s\n", mod, f, fact
+  end
+  
+  Px = Polynomial(Integer, "x")
+  x = Px.var
+  f = x**4 + 10*x**2 + 1
+  #f = x**4 - 10*x**2 + 1
+  show(f)
+  Primes.new.each do |mod|
+    break if mod > 100
+    show(f, mod)
+  end
+  
+  #mod  0: x^4 + 10x^2 + 1  =>  x^4 + 10x^2 + 1
+  #mod  2: x^4 + 1          =>  (x + 1)^4
+  #mod  3: x^4 + x^2 + 1    =>  (x + 2)^2(x + 1)^2
+  #mod  5: x^4 + 1          =>  (x^2 + 3)(x^2 + 2)
+  #mod  7: x^4 + 3x^2 + 1   =>  (x^2 + 4x + 6)(x^2 + 3x + 6)
+  #mod 11: x^4 - x^2 + 1    =>  (x^2 + 5x + 1)(x^2 + 6x + 1)
+  #mod 13: x^4 + 10x^2 + 1  =>  (x^2 - x + 12)(x^2 + x + 12)
+  #mod 17: x^4 + 10x^2 + 1  =>  (x^2 + 3x + 1)(x^2 + 14x + 1)
+  #mod 19: x^4 + 10x^2 + 1  =>  (x + 17)(x + 10)(x + 9)(x + 2)
+  #mod 23: x^4 + 10x^2 + 1  =>  (x^2 + 6)(x^2 + 4)
+  #mod 29: x^4 + 10x^2 + 1  =>  (x^2 + 21)(x^2 + 18)
+  #mod 31: x^4 + 10x^2 + 1  =>  (x^2 + 22x + 30)(x^2 + 9x + 30)
+  #mod 37: x^4 + 10x^2 + 1  =>  (x^2 + 32x + 36)(x^2 + 5x + 36)
+  #mod 41: x^4 + 10x^2 + 1  =>  (x^2 + 19x + 1)(x^2 + 22x + 1)
+  #mod 43: x^4 + 10x^2 + 1  =>  (x + 40)(x + 29)(x + 14)(x + 3)
+  #mod 47: x^4 + 10x^2 + 1  =>  (x^2 + 32)(x^2 + 25)
+  #mod 53: x^4 + 10x^2 + 1  =>  (x^2 + 41)(x^2 + 22)
+  #mod 59: x^4 + 10x^2 + 1  =>  (x^2 + 13x + 1)(x^2 + 46x + 1)
+  #mod 61: x^4 + 10x^2 + 1  =>  (x^2 + 54x + 60)(x^2 + 7x + 60)
+  #mod 67: x^4 + 10x^2 + 1  =>  (x + 55)(x + 39)(x + 28)(x + 12)
+  #mod 71: x^4 + 10x^2 + 1  =>  (x^2 + 43)(x^2 + 38)
+  #mod 73: x^4 + 10x^2 + 1  =>  (x + 68)(x + 44)(x + 29)(x + 5)
+  #mod 79: x^4 + 10x^2 + 1  =>  (x^2 + 64x + 78)(x^2 + 15x + 78)
+  #mod 83: x^4 + 10x^2 + 1  =>  (x^2 + 18x + 1)(x^2 + 65x + 1)
+  #mod 89: x^4 + 10x^2 + 1  =>  (x^2 + 9x + 1)(x^2 + 80x + 1)
+  #mod 97: x^4 + 10x^2 + 1  =>  (x + 88)(x + 54)(x + 43)(x + 9)
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-galois-group01.rb.v.rd

@@ -0,0 +1,27 @@
+=begin
+  # sample-galois-group01.rb
+
+  require "algebra/rational"
+  require "algebra/polynomial"
+  
+  P = Algebra.Polynomial(Rational, "x")
+  x = P.var
+  
+  (x**3 - 3*x + 1).galois_group.each do |g|
+    p g
+  end
+  #=> [0, 1, 2]
+  #   [1, 2, 0]
+  #   [2, 0, 1]]
+  
+  (x**3 - x + 1).galois_group.each do |g|
+    p g
+  end
+  #=> [0, 1, 2]
+  #   [1, 0, 2]
+  #   [2, 0, 1]
+  #   [0, 2, 1]
+  #   [1, 2, 0]
+  #   [2, 1, 0]
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-gaussian-elimination01.rb.v.rd

@@ -0,0 +1,19 @@
+=begin
+  # sample-gaussian-elimination01.rb
+
+  require "algebra"
+  M = MatrixAlgebra(Rational, 5, 4)
+  a = M.matrix{|i, j| i + j}
+  a.display #=>
+    #[0, 1, 2, 3]
+    #[1, 2, 3, 4]
+    #[2, 3, 4, 5]
+    #[3, 4, 5, 6]
+    #[4, 5, 6, 7]
+  a.kernel_basis.each do |v|
+    puts "a * #{v} = #{a * v}"
+    #=> a * [1, -2, 1, 0] = [0, 0, 0, 0, 0]
+    #=> a * [2, -3, 0, 1] = [0, 0, 0, 0, 0]
+  end
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-geometry01.rb.v.rd

@@ -0,0 +1,33 @@
+=begin
+  # sample-geometry01.rb
+
+  require 'algebra'
+  R = MPolynomial(Rational)
+  x,y,a1,a2,b1,b2,c1,c2 = R.vars('xya1a2b1b2c1c2')
+  
+  V = Vector(R, 2)
+  X, A, B, C = V[x,y], V[a1,a2], V[b1,b2], V[c1,c2]
+  
+  D = (B + C) /2
+  E = (C + A) /2
+  F = (A + B) /2
+  
+  def line(p1, p2, p3)
+    SquareMatrix.det([[1, *p1], [1, *p2], [1, *p3]])
+  end
+  
+  l1 = line(X, A, D)
+  l2 = line(X, B, E)
+  l3 = line(X, C, F)
+  s = line(A, B, C)
+  
+  g = Groebner.basis [l1, l2, l3, s-1] #s-1 means non degeneracy
+  
+  g.each_with_index do |f, i|
+    p f
+  end
+  #x - 1/3a1 - 1/3b1 - 1/3c1
+  #y - 1/3a2 - 1/3b2 - 1/3c2
+  #a1b2 - a1c2 - a2b1 + a2c1 + b1c2 - b2c1 - 1
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-geometry02.rb.v.rd

@@ -0,0 +1,34 @@
+=begin
+  # sample-geometry02.rb
+
+  require 'algebra'
+  R = MPolynomial(Rational)
+  x,y,a1,a2,b1,b2,c1,c2 = R.vars('xya1a2b1b2c1c2')
+  
+  V = Vector(R, 2)
+  X, A, B, C = V[x,y], V[a1,a2], V[b1,b2], V[c1,c2]
+  
+  def line(p1, p2, p3)
+    SquareMatrix.det([[1, *p1], [1, *p2], [1, *p3]])
+  end
+  
+  def vline(p1, p2, p3)
+    (p1-p2).norm2 - (p1-p3).norm2
+  end
+  
+  l1 = vline(X, A, B)
+  l2 = vline(X, B, C)
+  l3 = vline(X, C, A)
+  
+  s = line(A, B, C)
+  
+  g = Groebner.basis [l1, l2, l3, s-1] #s-1 means non degeneracy
+  
+  g.each do |f|
+    p f
+  end
+  #x - 1/2a1a2b1 + 1/2a1a2c1 + 1/2a1b1c2 - 1/2a1c1c2 - 1/2a1 - 1/2a2^2b2 + 1/2a2^2c2 + 1/2a2b1^2 - 1/2a2b1c1 + 1/2a2b2^2 - 1/2a2c2^2 - 1/2b1^2c2 + 1/2b1c1c2 - 1/2b2^2c2 + 1/2b2c2^2 - 1/2c1
+  #y + 1/2a1^2b1 - 1/2a1^2c1 - 1/2a1b1^2 + 1/2a1c1^2 + 1/2a2^2b1 - 1/2a2^2c1 - 1/2a2b1b2 - 1/2a2b1c2 + 1/2a2b2c1 + 1/2a2c1c2 + 1/2b1^2c1 + 1/2b1b2c2 - 1/2b1c1^2 -1/2b2c1c2 - 1/2b2 - 1/2c2
+  #a1b2 - a1c2 - a2b1 + a2c1 + b1c2 - b2c1 - 1
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-geometry03.rb.v.rd

@@ -0,0 +1,45 @@
+=begin
+  # sample-geometry03.rb
+
+  #incenter
+  puts "too heavy ... skip (#{$0})"
+  exit
+  require 'algebra'
+  
+  R = MPolynomial(Rational)
+  x,y,a1,a2,b1,b2,c1,c2 = R.vars('xya1a2b1b2c1c2')
+  Q = LocalizedRing(R)
+  x0,y0,a10,a20,b10,b20,c10,c20 = R.vars.map{|v| Q[v]}
+  V = Vector(R, 2)
+  W = Vector(Q, 2)
+  X, A, B, C = V[x,y], V[a1,a2], V[b1,b2], V[c1,c2]
+  
+  def bisector(p1, p2, p3)
+    p1,p2,p3 = [p1,p2,p3].map{|v| v.convert_to(W)}
+    k1 = (p1.inner_product(p2))**2/p2.norm2
+    k2 = (p1.inner_product(p3))**2/p3.norm2
+    (k1-k2).numerator
+  end
+  
+  def line(p1, p2, p3)
+    SquareMatrix.det([[1, *p1], [1, *p2], [1, *p3]])
+  end
+  
+  l1 = bisector(X-A, B-A, C-A)
+  p l1
+  l2 = bisector(X-B, C-B, A-B)
+  p l2
+  l3 = bisector(X-C, A-C, B-C)
+  p l3
+  
+  s = line(A, B, C)
+  
+  g = Groebner.basis [l1, l2, l3, s-1] #s-1 means non degeneracy
+  
+  g.each do |f|
+    p f
+  end
+  
+  #p g.size > 1
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-geometry04.rb.v.rd

@@ -0,0 +1,33 @@
+=begin
+  # sample-geometry04.rb
+
+  require 'algebra'
+  
+  R = MPolynomial(Rational)
+  x,y,a1,a2,b1,b2,c1,c2 = R.vars('xya1a2b1b2c1c2')
+  V = Vector(R, 2)
+  X, A, B, C = V[x,y], V[a1,a2], V[b1,b2], V[c1,c2]
+  
+  def perpendicular(p0, p1, p2, p3)
+    (p0-p1).inner_product(p2-p3)
+  end
+  
+  def line(p1, p2, p3)
+    SquareMatrix.det([[1, *p1], [1, *p2], [1, *p3]])
+  end
+  
+  l1 = perpendicular(X, A, B, C)
+  l2 = perpendicular(X, B, C, A)
+  l3 = perpendicular(X, C, A, B)
+  
+  s = line(A, B, C)
+  g = Groebner.basis [l1, l2, l3, s-1] #s-1 means non degeneracy
+  
+  g.each do |f|
+    p f
+  end
+  #x + a1a2b1 - a1a2c1 - a1b1c2 + a1c1c2 + a2^2b2 - a2^2c2 - a2b1^2 + a2b1c1 - a2b2^2 + a2c2^2 + b1^2c2 - b1c1c2 - b1 + b2^2c2 - b2c2^2
+  #y - a1^2b1 + a1^2c1 + a1b1^2 - a1c1^2 - a2^2b1 + a2^2c1 + a2b1b2 + a2b1c2 - a2b2c1 - a2c1c2 - a2 - b1^2c1 - b1b2c2 + b1c1^2 + b2c1c2
+  #a1b2 - a1c2 - a2b1 + a2c1 + b1c2 - b2c1 - 1
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-geometry07.rb.v.rd

@@ -0,0 +1,62 @@
+=begin
+  # sample-geometry07.rb
+
+  require "algebra"
+  R = MPolynomial(Rational)
+  m, b, a = R.vars("mba")
+  K = LocalizedRing(R)
+  a0, b0, m0 = K[a], K[b], K[m]
+  
+  M = SquareMatrix(K, 3)
+  l0, l1, l2 = M[[0, 1, 0], [1, 1, -1], [1, 0, 0]]
+  m4 = M[[a0, 1, -a0], [1, b0, -b0], [m0, -1, 0]]
+  m40 = m4.dup; m40.set_row(0, l0)
+  m41 = m4.dup; m41.set_row(1, l1)
+  m42 = m4.dup; m42.set_row(2, l2)
+  
+  def mdet(m, i)
+    i = i % 3
+    m.minor(i, 2).determinant * (-1) ** i
+  end
+  
+  def tris(m, i)
+    pts = [0, 1, 2] - [i]
+    (m.determinant)**2 / mdet(m, pts[0]) / mdet(m, pts[1])
+  end
+  
+  u0 = (tris(m4, 0) - tris(m40, 0)).numerator
+  u1 = (tris(m4, 1) - tris(m41, 1)).numerator
+  u2 = (tris(m4, 2) - tris(m42, 2)).numerator
+  
+  puts [u0, u1, u2]
+  puts
+  
+  [u0, u1, u2].each do |um|
+    p um.factorize
+  end
+  puts
+  
+  x = u0 / a / (m*b+1)
+  y = u1 / (m+a) / (b-1)
+  z = u2 / (-b*a+1)
+  
+  p x
+  p y
+  p z
+  puts
+  
+  gb = Groebner.basis([x, y, z])
+  puts gb
+  puts
+  
+  gb.each do |v|
+    p v.factorize
+  end
+  #(-1)(-mb + m + ba^3 + ba^2 - ba - a^2)
+  #(-1)(-ma + m + ba^2 - a^2)
+  #(-1)(b + a - 1)(-ba + 1)(a)
+  #(-1)(-ba + 1)(a)(a^2 + a - 1)
+  
+  # => a = -1/2 + \sqrt{5}/2
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-groebner01.rb.v.rd

@@ -0,0 +1,13 @@
+=begin
+  # sample-groebner01.rb
+
+  require "algebra"
+  P = MPolynomial(Rational, "xyz")
+  x, y, z = P.vars("xyz")
+  f1 = x**2 + y**2 + z**2 -1
+  f2 = x**2 + z**2 - y
+  f3 = x - z
+  p Groebner.basis([f1, f2, f3])
+  #=> [x - z, y - 2z^2, z^4 + 1/2z^2 - 1/4]
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-groebner02.rb.v.rd

@@ -0,0 +1,18 @@
+=begin
+  # sample-groebner02.rb
+
+  require "algebra"
+  
+  P = MPolynomial(Rational)
+  x, y, z = P.vars "xyz"
+  f1 = x**2 + y**2 + z**2 -1
+  f2 = x**2 + z**2 - y
+  f3 = x - z
+  
+  coeff, basis = Groebner.basis_coeff([f1, f2, f3])
+  basis.each_with_index do |b, i|
+    p [coeff[i].inner_product([f1, f2, f3]), b]
+    p coeff[i].inner_product([f1, f2, f3]) == b #=> true
+  end
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-groebner03.rb.v.rd

@@ -0,0 +1,19 @@
+=begin
+  # sample-groebner03.rb
+
+  require "algebra"
+  F5 = ResidueClassRing(Integer, 2)
+  F = AlgebraicExtensionField(F5, "a") {|a| a**3 + a + 1}
+  a = F.var
+  P = MPolynomial(F)
+  
+  x, y, z = P.vars("xyz")
+  f1 = x + y**2 + z**2 - 1
+  f2 = x**2 + z**2 - y * a
+  f3 = x - z - a
+  
+  f = x**3 + y**3 + z**3
+  q, r = f.divmod_s(f1, f2, f3)
+  p f == q.inner_product([f1, f2, f3]) + r #=> true
+((<_|CONTENTS>))
+=end

data/doc-ja/sample-group01.rb.v.rd

@@ -0,0 +1,21 @@
+=begin
+  # sample-group01.rb
+
+  require "algebra"
+  e = Permutation[0, 1, 2, 3, 4]
+  a = Permutation[1, 0, 3, 4, 2]
+  b = Permutation[0, 2, 1, 3, 4]
+  p a * b #=> [2, 0, 3, 4, 1]
+  
+  g = Group.new(e, a, b)
+  g.complete!
+  p g == PermutationGroup.symmetric(5) #=> true
+  
+  
+  
+  
+  
+  
+  
+((<_|CONTENTS>))
+=end