algebra 0.2.1

data/doc-ja/samples-ja.rd

@@ -0,0 +1,221 @@
+=begin
+[((<index-ja|URL:index-ja.html>))] 
+
+= 練習帖
+
+== CONTENTS
+* ((<有限集合>))
+  * ((<集合>))
+  * ((<写像>))
+  * ((<群>))
+* ((<多項式の計算>))
+* ((<多変数多項式の計算>))
+* ((<多変数多項式の計算その２>))
+* ((<多項式を複数の多項式で割った余りを求める>))
+* ((<多項式のグレブナ基底を求める>))
+* ((<素体を作る>))
+* ((<代数体を作る>))
+* ((<商体の生成>))
+  * ((<整数環の商体を取って有理数を作る>))
+  * ((<有理関数体の生成>))
+  * ((<代数拡大体上の有理式の計算>))
+  * ((<代数関数体>))
+* ((<線形代数>))
+  * ((<連立1次方程式を解く>))
+  * ((<正方行列の対角化>))
+  * ((<行列の単因子を求める>))
+  * ((<行列の Jordan 標準形を求める>))
+  * ((<Cayley-Hamilton の定理の（次元毎の）証明>))
+* ((<グレブナ基底を元の基底で表現する>))
+* ((<任意の基底で割った商と余りを求める（余り＝０に意味がある）>))
+* ((<因数分解>))
+  * ((<整数係数多項式の因数分解>))
+  * ((<Zp 係数多項式の因数分解>))
+  * ((<有理数の代数拡大上の多項式の因数分解>))
+  * ((<有理数の代数拡大の代数拡大上の多項式の因数分解>))
+  * ((<x^4 + 10x^2 + 1 の因数分解>))
+  * ((<整数、有理係数多変数多項式の因数分解>))
+  * ((<Zp 係数多変数多項式の因数分解>))
+* ((<代数方程式>))
+  * ((<最小多項式>))
+  * ((<最小分解体>))
+  * ((<多項式のガロア群>))
+* ((<初等幾何>))
+  * ((<重心の存在>))
+  * ((<外心の存在>))
+  * ((<垂心の存在>))
+  * ((<4 つの等面積>))
+* ((<解析>))
+  * ((<ラグランジュの乗数法>))
+
+== 有限集合
+
+=== 集合
+
+<<< sample-set01.rb.v.rd
+
+=== 写像
+
+<<< sample-map01.rb.v.rd
+
+=== 群
+
+<<< sample-group01.rb.v.rd
+
+== 多項式の計算
+
+<<< sample-polynomial01.rb.v.rd
+
+== 多変数多項式の計算
+
+<<< sample-polynomial02.rb.v.rd
+
+== 多変数多項式の計算その２
+
+<<< sample-m-polynomial01.rb.v.rd
+
+== 多項式を複数の多項式で割った余りを求める
+
+<<< sample-divmod01.rb.v.rd
+
+== 多項式のグレブナ基底を求める
+
+<<< sample-groebner01.rb.v.rd
+
+== 素体を作る
+
+<<< sample-primefield01.rb.v.rd
+
+== 代数体を作る
+
+<<< sample-algebraicfield01.rb.v.rd
+
+=== これと同じものが次の様に書ける。
+
+<<< sample-algebraicfield02.rb.v.rd
+
+=== ルートの計算
+
+<<< sample-algebraic-root01.rb.v.rd
+
+== 商体の生成
+
+=== 整数環の商体を取って有理数を作る
+
+<<< sample-quotientfield01.rb.v.rd
+
+=== 有理関数体の生成
+
+<<< sample-quotientfield02.rb.v.rd
+
+=== 代数拡大体上の有理式の計算
+
+<<< sample-quotientfield03.rb.v.rd
+
+=== 代数関数体
+
+<<< sample-quotientfield04.rb.v.rd
+
+== 線形代数
+
+=== 連立1次方程式を解く
+
+<<< sample-gaussian-elimination01.rb.v.rd
+
+=== 正方行列の対角化
+
+<<< sample-diagonalization01.rb.v.rd >>>
+
+=== 行列の単因子を求める
+
+<<< sample-elementary-divisor01.rb.v.rd
+
+=== 行列の Jordan 標準形を求める
+
+<<< sample-jordan-form01.rb.v.rd
+
+=== Cayley-Hamilton の定理の（次元毎の）証明
+
+<<< sample-cayleyhamilton01.rb.v.rd
+
+== グレブナ基底を元の基底で表現する
+
+<<< sample-groebner02.rb.v.rd
+
+== 任意の基底で割った商と余りを求める（余り＝０に意味がある）
+
+<<< sample-groebner03.rb.v.rd
+
+== 因数分解
+
+=== 整数係数多項式の因数分解
+
+<<< sample-factorize01.rb.v.rd
+
+=== Zp 係数多項式の因数分解
+
+<<< sample-factorize02.rb.v.rd
+
+=== 有理数の代数拡大上の多項式の因数分解
+
+<<< sample-factorize03.rb.v.rd
+
+=== 有理数の代数拡大の代数拡大上の多項式の因数分解
+
+<<< sample-factorize04.rb.v.rd
+
+=== x^4 + 10x^2 + 1 の因数分解
+
+<<< sample-factorize05.rb.v.rd
+
+=== 整数、有理係数多変数多項式の因数分解
+
+<<< sample-m-factorize01.rb.v.rd
+
+=== Zp 係数多変数多項式の因数分解
+
+<<< sample-m-factorize02.rb.v.rd
+
+== 代数方程式
+
+=== 最小多項式
+
+<<< sample-algebraic-equation01.rb.v.rd
+
+=== 最小分解体
+
+<<< sample-splitting-field01.rb.v.rd
+
+=== 多項式のガロア群
+
+<<< sample-galois-group01.rb.v.rd
+
+== 初等幾何
+
+=== 重心の存在
+
+<<< sample-geometry01.rb.v.rd
+
+=== 外心の存在
+
+<<< sample-geometry02.rb.v.rd
+
+#=== 内心の存在
+
+#<<< sample-geometry03.rb.v.rd
+
+=== 垂心の存在
+
+<<< sample-geometry04.rb.v.rd
+
+
+=== 4 つの等面積
+see ((<URL:http://www1.odn.ne.jp/drinkcat/topic/column/quest/quest_2/quest_2.html>)) Question 3.
+
+<<< sample-geometry07.rb.v.rd
+
+== 解析
+=== ラグランジュの乗数法
+<<< sample-lagrange-multiplier01.rb.v.rd
+
+=end

data/doc-ja/style.css

@@ -0,0 +1,85 @@
+/*
+ * style.css: CSS style definition file for `Rubyavailable'.
+ * (<URL:http://www.jin.gr.jp/~nahi/Ruby/*>)
+ */
+
+body {
+    background: #EEEEEE;
+    color: black;
+    margin-left: 2%;
+    margin-right: 2%;
+    font-size: 10.5pt;
+    font-family: verdana, arial, helvetica, Sans-Serif;
+}
+
+h1 {
+    font-family: "comic sans ms", verdana, sans-serif; 
+#    text-align: right;
+    margin-top: 5%;
+    margin-right: 10%;
+}
+
+h2, h3, h4, h5, h6 {
+    font-family: verdana, arial, helvetica, Sans-Serif;
+}
+
+h2 {
+    color: #FFFFFF;
+#    background: #CC3333;
+    background: #33CCAA;
+}
+
+div.header p.status { text-align: right; }
+div.header p.last-modified { text-align: left; }
+
+/*
+li p {
+    margin-top: -1ex;
+}
+*/
+
+dt {
+    font-weight: bold;
+    margin-top: 2ex;
+    margin-left: 1em;
+}
+
+address {
+    color: gray;
+    background: #EEEEEE;
+    text-align: right;
+    font-family: Times, serif;
+    font-style: normal;
+    font-variant: normal;
+    font-weight: normal;
+}
+
+pre {
+    border-right: #646464 1px solid;
+    padding-right: 0.5em;
+    border-top: #646464 1px solid;
+    padding-top: 0.5em;
+    border-left: #646464 1px solid;
+    padding-left: 0.5em;
+    border-bottom: #646464 1px solid;
+    padding-bottom: 0.5em;
+    margin-left: 1em;
+    margin-right: 2em;
+    white-space: pre;
+    background-color: #e6e6e6;
+    color: black;
+}
+
+span.download {
+    font-weight: normal;
+    color: blue;
+    background: #EEEEEE;
+}
+
+.path {
+    font-family: Verdana, Arial, Helvetica, sans-serif;
+}
+
+.navi {
+    text-align: right;
+}

data/doc-ja/todo.html

@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="utf-8" ?>
+<!DOCTYPE html 
+  PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta http-equiv="Content-type" content="text/html; charset=utf-8" />
+<title>doc-ja/todo.rd</title>
+<link href="style.css" type="text/css" rel="stylesheet" />
+</head>
+<body>
+<h1><a name="label-0" id="label-0">ToDo</a></h1><!-- RDLabel: "ToDo" -->
+<ul>
+<li>Factorization of multi-variate polynomials over algebraic field</li>
+<li>Factorization over polynomial ring over Euclidian ring</li>
+<li>Geometry</li>
+</ul>
+
+</body>
+</html>

data/doc-ja/todo.rd

@@ -0,0 +1,9 @@
+=begin
+
+= ToDo
+
+* Factorization of multi-variate polynomials over algebraic field
+* Factorization over polynomial ring over Euclidian ring
+* Geometry
+=end
+

data/lib/algebra.rb

@@ -0,0 +1,36 @@
+#
+#  algebra
+#                                                    by Shin-ichiro HARA
+#
+#  Version 0.04 (2003.06.19)
+#
+
+require 'algebra/auto-require'
+require 'algebra/rational'
+require 'algebra/version'
+
+module Algebra
+  require 'algebra/algebraic-equation'
+  require 'algebra/polynomial' # class Polynomial
+  require 'algebra/m-polynomial'
+  require 'algebra/residue-class-ring'
+  require 'algebra/algebraic-extension-field'
+  require 'algebra/localized-ring'
+  require 'algebra/matrix-algebra'
+
+  require 'algebra/finite-set'
+  require 'algebra/finite-map'
+  require 'algebra/permutation-group'
+end
+include Algebra
+
+require 'algebra/polynomial' # function Polyomial
+require 'algebra/m-polynomial'
+
+require 'algebra/residue-class-ring'
+require 'algebra/algebraic-extension-field'
+require 'algebra/localized-ring'
+require 'algebra/matrix-algebra'
+
+# for backward compatibility
+require 'algebra/splitting-field'

data/lib/algebra/algebraic-equation.rb

@@ -0,0 +1,56 @@
+# Utility for Algebraic Equations
+#
+#   by Shin-ichiro Hara
+#
+# Version 1.11 (2002.02.23)
+
+require 'algebra/polynomial'
+require 'algebra/polynomial-factor'
+require 'algebra/m-polynomial'
+require 'algebra/groebner-basis'
+require 'algebra/residue-class-ring'
+require 'algebra/splitting-field'
+
+module Algebra
+  module AlgebraicEquation
+    def symmetric_product(objs)
+      a = [1]
+      objs.each do |x|
+        ax = a.collect { |t| t * x }
+        a.each_index do |i|
+          a[i] = a[i] + ax[i - 1] if i > 0 && i < a.size
+        end
+        a.push ax.last
+      end
+      a
+    end
+
+    def minimal_polynomial(e, *fs)
+      raise 'too many polys' if fs.size > 'x'.ord - 'a'.ord # ("a"..."x").size
+      require 'algebra/groebner-basis'
+      (mpring = e.class).vars('x')
+      x = mpring.var('x')
+      gb = mpring.with_ord(:lex) do
+        Algebra::Groebner.basis([x - e, * fs])
+      end
+      gb.last
+    end
+
+    module_function :minimal_polynomial
+    module_function :symmetric_product
+  end
+end
+
+if __FILE__ == $PROGRAM_NAME
+  include Algebra::AlgebraicEquation
+  require 'algebra/rational'
+  PQ = Algebra.MPolynomial(Rational)
+  a, b, c, _d = PQ.vars('abcd')
+  p minimal_polynomial(a + b, a**3 - 2, b**2 + b + 1)
+  p minimal_polynomial(a + b + c, a**2 - 2, b**2 - 3, c**2 - 5)
+  #  p minimal_polynomial(a + b, a**5-2, b**4+b**3+b**2+b+1)
+  # x^20 + 5x^19 + 15x^18 + 35x^17 + 70x^16 + 113x^15 + 155x^14 + 215x^13 + 410x^12 + 1095x^11 + 1929x^10 + 2185x^9 + 1180x^8 - 905x^7 - 835x^6 + 17x^5 + 40x^4 - 255x^3 - 45x^2 + 135x + 81
+
+  # too difficult, deg == 16
+  # p minimal_polynomial(a+b+c+d, a**2-2, b**2-3, c**2-5, d**2-7)
+end

data/lib/algebra/algebraic-extension-field.rb

@@ -0,0 +1,135 @@
+# Algebraic Extension Field
+#
+#   by Shin-ichiro Hara
+#
+# Version 1.00 (2002.02.27)
+
+require 'algebra/polynomial'
+# require "algebra/m-polynomial"
+require 'algebra/residue-class-ring'
+
+module Algebra
+  def AlgebraicExtensionField(field, var = 'x', &b)
+    AlgebraicExtensionField.create(field, var, &b)
+  end
+  module_function :AlgebraicExtensionField
+
+  class AlgebraicExtensionField < ResidueClassRing
+    def self.create(field, var_obj)
+      poly_ring = Algebra.Polynomial(field, var_obj)
+
+      modulus = yield(poly_ring.var)
+      klass = super(poly_ring, modulus)
+
+      #      def klass.var; self[ground.var]; end
+      klass.sysvar :var, klass[klass.ground.var]
+      klass.sysvar :base, field
+
+      if Algebra::AlgebraicExtensionField >= field
+        env_ring = Algebra.Polynomial(field.env_ring, var_obj)
+        klass.sysvar :def_polys, field.def_polys + [modulus]
+      else
+        env_ring = poly_ring
+        klass.sysvar :def_polys, [modulus]
+      end
+
+      poly_ring.class_eval <<-__DEF__
+      def abs_lift
+	if Algebra::AlgebraicExtensionField >= ground
+	  project(self.class.env_ring) {|c, n| c.abs_lift }
+	else
+	  project(self.class.env_ring) {|c, n| c }
+	end
+      end
+      __DEF__
+      poly_ring.sysvar :env_ring, env_ring
+      klass.sysvar :env_ring, env_ring
+
+      klass
+    end
+
+    def [](n)
+      lift[n]
+    end
+
+    def abs_lift
+      Algebra::AlgebraicExtensionField >= self.class.base ? lift.abs_lift : lift
+    end
+
+    def self.to_ary
+      [self, var]
+    end
+  end
+
+  ################# experimental ###################
+
+  def QuadraticExtensionField(field, var_obj = nil)
+    poly_ring = Algebra.Polynomial(field, 'x')
+    modulus = yield(poly_ring.var)
+    unless modulus.deg == 2
+      raise 'give deg 2 polynomial to QuadraticicExtensionField.'
+    end
+
+    fact = modulus.factorize
+    if o = fact.find { |x| x[0].deg == 1 }
+      b = o[0][0]
+      a = o[0][1]
+      c = b / a
+      return [field, - c, c]
+    end
+
+    c = modulus[0]
+    b = modulus[1]
+    a = modulus[2]
+    a2 = a * 2
+    b0 = a2.zero? ? b : (b / a2)
+    c1 = c / a - b0**2
+    cs = (-c1).to_s
+    r = 'r'
+    var_obj ||= r + (/^\d+$/ !~ cs ? '(' + cs + ')' : cs)
+
+    klass, v = AlgebraicExtensionField(field, var_obj) { |x| x**2 + c1 }
+
+    r1 = v - b0
+    r2 = - v - b0
+    [klass, r1, r2]
+  end
+  module_function :QuadraticExtensionField
+
+  def Sqrt(field, a, _name = nil)
+    QuadraticExtensionField(field, nil) { |x| x**2 - a }
+  end
+
+  module_function :Sqrt
+
+  def Root(field, a = nil, deg = 2, cs = nil, &b)
+    r, x = Polynomial(field)
+    if b
+      f = yield(x)
+      as = a ? a.to_s : f.to_s
+    else
+      f = x**deg - a
+      as = a.to_s
+    end
+
+    r = deg == 2 ? 'r' : "r[#{deg}]"
+    cs ||= r + (/^\d+$/ !~ as ? '(' + as + ')' : as)
+    k = f.splitting_field(nil, cs)
+    [k.field, *k.roots]
+  end
+
+  module_function :Root
+end
+
+if $PROGRAM_NAME == __FILE__
+  R2, r2, _r2_ = Root(Rational, 2)
+  R3, r3, _r3_ = Root(R2, 3)
+  R6, r6, _r6_ = Root(R3, 6)
+
+  p r6
+  p (r6 + r2 + r3) * (r6 + r2 - r3)
+
+  P, x = Polynomial(R6, x)
+  p (x**4 - 60 * x**2 + 36).factorize
+  #=> (x - 2r3 - 3r2)(x + 2r3 - 3r2)(x - 2r3 + 3r2)(x + 2r3 + 3r2)
+end