Share
Embed
わかったつもりになる Gröbner 基底
Haskell で計算機代数勉強会(http://partake.in/events/451a51b0-b18e-4e01-bda4-423bf57f4051 )での発表資料です。Gröbner 基底についての簡単な導入と計算法についての紹介です。
Hiromi Ishii
May 04, 2013
Transcript
295 slides
-
ࣗݾհ ੴҪେւʢa.k.a. @mr_konnʣ Twitter: @mr_konn Blog: http:/ /blog.konn-san.com/ Web: http:/
/konn-san.com/ Haskell lover ૣҴాେֶֶՊ࢛ ຊϩδοΫͷਓؒͷഺ͕ࠓԑ͋ͬͯ زԿʢಛʹ Gröbner جఈʣ ͷݚڀࣨʹ computational-algebra ͷ࡞ऀ 135݄4༵ -
Table of Contents Gröbner جఈͷ؆୯ͳಋೖ Gröbner جఈͷܭࢉ๏ Buchberger ΞϧΰϦζϜ ࠷దԽख๏ɿsyzygy,
sugar strategy Haskell ͷܕϨϕϧϓϩάϥϛϯάͷݱࡏ 135݄4༵ -
Table of Contents Gröbner جఈͷ؆୯ͳಋೖ Gröbner جఈͷܭࢉ๏ Buchberger ΞϧΰϦζϜ ࠷దԽख๏ɿsyzygy,
sugar strategy Haskell ͷܕϨϕϧϓϩάϥϛϯάͷݱࡏ 135݄4༵ -
Gröbner جఈ “άϨϒφʔ͖͍ͯ” ͱಡΉ 1960s: ኍதฏ༞ɺB. Buchberger Β͕ಠཱʹൃݟ Gröbner
Buchberger ͷࢣঊͷ໊લ 135݄4༵ -
Gröbner جఈ “άϨϒφʔ͖͍ͯ” ͱಡΉ 1960s: ኍதฏ༞ɺB. Buchberger Β͕ಠཱʹൃݟ Gröbner
Buchberger ͷࢣঊͷ໊લ ኍதಛҟղফͷͨΊʹߟ͑ͨ 135݄4༵ -
Gröbner جఈ “άϨϒφʔ͖͍ͯ” ͱಡΉ 1960s: ኍதฏ༞ɺB. Buchberger Β͕ಠཱʹൃݟ Gröbner
Buchberger ͷࢣঊͷ໊લ ኍதಛҟղফͷͨΊʹߟ͑ͨ ٕज़ͷਐาͰܭࢉग़དྷΔΑ͏ʹͳΓԠ༻͕ग़Δ 135݄4༵ -
Gröbner جఈ “άϨϒφʔ͖͍ͯ” ͱಡΉ 1960s: ኍதฏ༞ɺB. Buchberger Β͕ಠཱʹൃݟ Gröbner
Buchberger ͷࢣঊͷ໊લ ኍதಛҟղফͷͨΊʹߟ͑ͨ ٕज़ͷਐาͰܭࢉग़དྷΔΑ͏ʹͳΓԠ༻͕ग़Δ ମ্ଟ߲ࣜͷΠσΞϧͷੑ࣭ͷΑ͍ੜݩ 135݄4༵ -
ମ ͍ͨʢ≠͔ΒͩʣͱಡΉ ͠ࢉɺҾ͖ࢉɺֻ͚ࢉɺׂΓࢉʢ0Ҏ֎ʣ͕ग़͖ΔΑ ͏ͳߏ ྫɿ༗ཧମ ℚ ͱ͔ෳૉମ ℂ ͱ͔ ྫɿશମ
ℤ ମͰͳ͍ʢ1/2͡Όͳ͍ʣ ҎԼͰখจࣈͷ k ͰମΛද͢ 135݄4༵ -
ମ্ͷଟ߲ࣜ k[X1 , …, Xn ] = {k Λͱ͢Δ n-มଟ߲ࣜશମ} มͷ͕ࣗ໌ͳ࣌ k[] = k[X1
, …, Xn ] ͱॻ͘ ࣗવʹ͠ࢉɺҾ͖ࢉɺֻ͚ࢉ͕ఆٛͰ͖Δʢׂ Γࢉग़དྷΔͱݶΒͳ͍ʣ ྫɿX1 2 + 2 X1 X2 + X2 2 ∈ k[X1 , X2 ], y2 − x ∈ k[x, y] 135݄4༵ -
ΠσΞϧ R ͷ෦ू߹ I ͕ ΠσΞϧ Ͱ͋Δͱ 1. ҙͷ
x, y ∈ I ʹ͍ͭͯ x − y ∈ I 2.ҙͷ c ∈ R, x ∈ I ʹ͍ͭͯ cx ∈ I ഒ֓೦ͷ҃ΔछͷҰൠԽʹͳ͍ͬͯΔ ΠσΞϧ I ʹଐ͢Δ ⇔ I ͷݩͰׂΕΔ a ͕ b ͷഒ ⇔ ⟨a⟩ ⊆ ⟨b⟩ ఆٛ 135݄4༵ -
ͳͥΠσΞϧʁ ΠσΞϧزԿతʹͦͷྵͷ͢ਤܗͱରԠ͢Δ ʢਖ਼֬ʹࠜجΠσΞϧ͕ରԠʣ ⟨y − x2⟩ɿ์ઢ ⟨y2 + x2 − 1, y + 2x − 1⟩ɿԁͱઢͷަ ަ 㱻 ࿈ཱํఔࣜͷղ ΠσΞϧ࿈ཱ͞ΕͨؔࣜͱݟΔ͜ͱ͕ग़དྷΔ Gröbner
جఈΛ͏ͱ৭Μͳਤܗɾ࿈ཱํఔࣜʹ ؔ͢Δܭࢉ͕؆୯ʹग़དྷΔΑ͏ʹͳΔ 135݄4༵ -
ੜݩ ্ͷ ⟨f1 ,…, fr ⟩ ͖ͬ͞ͷΠσΞϧͷఆٛΛຬͨ͢ɻ ٯʹɺମ্ଟ߲ࣜͷΠσΞϧɺదͳ f1 ,…, fr ʹ
ΑΓɺͯ͢͜ͷܗͰॻ͚ΔʢHilbert ͷجఈఆཧʣ f1 , … , fr ∈ k[ ] ʹ͍ͭͯɺ ⟨f1 ,…, fr ⟩ := {a1 f1 +…+ ar fr ∣ ai ∈ k[] (i = 1, … r)} Λ f1 ,…, fr ʹΑΓੜ͞ΕΔΠσΞϧͱ͍͏ɻ I = ⟨f1 ,…, fr ⟩ ͷ࣌ɺ f1 ,…, fr Λ I ͷجఈɺ·ͨ ੜݩͱݺͿɻ ఆٛ 135݄4༵ -
Hilbert ͷجఈఆཧ Noether ͱʮҙͷΠσΞϧ͕༗ݶݸͷੜݩͰॻ͚Δʢʹ༗ ݶੜʣʯͱ͍͏݅Λຬͨ͢ ܭࢉػͰѻ͏ʹɺଟ߲ࣜͷΠσΞϧ༗ݶݸͷଟ߲ࣜͷͱ͠ ͯఆٛ͢Εे ূ໌Ή͔͍͕ͣ͠ɺମͷ߹ʹ͍ͭͯ Gröbner جఈΛ͏ͱ
؆୯ʹࣔͤΔɻ ʢূ໌ɿGröbner جఈΛऔΕΑ͍▪ʣ Noether ্ͷଟ߲ࣜ Noether Ͱ͋Δ ఆཧ 135݄4༵ -
Α͍ੑ࣭ʁ ࠨͷΛߟ͑Δ f1 ͱ f2 ͷ “࠷େެࣜ” f = GCD(f1
, f2 ) ͕Θ ͔ΕΑ͍ I = ⟨ f ⟩ ͱͳΔͷͰɺ ͋ͱ g, h Λ f Ͱׂ ΓΕΔ͔ݟΔ f1 = x3 + x2 + x + 1 f2 = x2 − x − 2 I = ⟨ f1 , f2 ⟩ ⊆ k[x] ͱ͢Δͱɺg = x3 − 1, h = x2 + 1 ͦΕͧΕ I ʹଐ͔͢ʁ 1 135݄4༵ -
࠷େެࣜͷٻΊํ Euclid ͷޓআ๏Λ͏ ͚ͩͰͳ͘ɺׂΓࢉݪཧཱ͕͢Δ ҙͷͰ͑Δ ͷ߹ɿ͋Δݩ͕ ⟨a, b⟩ ʹଐ͢Δ ɹ㱻
a, b ͰׂΕΔ ɹ㱻 a, b ͷ࠷େެͰׂΕΔ ಉ༷ͷ͜ͱ͕Ұมଟ߲ࣜͰཱ 135݄4༵ -
Euclid ͷޓআ๏ ೖྗɿf, g 1. f Λ g ͰׂΓࢉͨ͠༨ΓΛ r0 ͱ͢Δ
2.g Λ r0 ͰׂΓࢉͨ͠༨ΓΛ r1 ͱ͢Δ 3.r0 Λ r1 ͰׂΓࢉͨ͠༨ΓΛ r2 ͱ͢Δ 4.ҎԼθϩʹͳΔ·Ͱ܁Γฦ͠ ग़ྗɿθϩͰͳ͍࠷ޙͷ rn 135݄4༵ -
Ұมଟ߲ࣜͷׂΓࢉ ઌఔͷͰ Euclidͷ ޓআ๏Λ͏ͱ͖ͷ࠷ ॳͷεςοϓ ߱ႈͷॱʹฒΔ େ͖͍߲ͱͷா৲Λ߹ Θ͍ͤͯ͘ x +2
x2 x 2 x3 +x2 +x +1 x3 x2 2x 2x2 +3x +1 2x2 2x 4 5x +5 135݄4༵ -
ଟมͷ߹ f1 = X2Y − 1 f2 = X3 − Y2 − X I = ⟨ f1 , f2 ⟩
⊆ k[X, Y] ͱ͢Δͱɺ g = X2Y2 − X3Y − XY − 1 I ʹଐ͔͢ʁ 2 135݄4༵ -
ଟมͷ߹ ೋมͷ߹Λߟ͑Δ f1 = X2Y − 1 f2 = X3 − Y2 − X I = ⟨ f1 , f2
⟩ ⊆ k[X, Y] ͱ͢Δͱɺ g = X2Y2 − X3Y − XY − 1 I ʹଐ͔͢ʁ 2 135݄4༵ -
ଟมͷ߹ ೋมͷ߹Λߟ͑Δ f1 ͱ f2 ͷ “࠷େެࣜ” ͷΑ͏ͳΛߟ͑ΒΕ Δ͔ʁ f1
= X2Y − 1 f2 = X3 − Y2 − X I = ⟨ f1 , f2 ⟩ ⊆ k[X, Y] ͱ͢Δͱɺ g = X2Y2 − X3Y − XY − 1 I ʹଐ͔͢ʁ 2 135݄4༵ -
ଟมͷ߹ ೋมͷ߹Λߟ͑Δ f1 ͱ f2 ͷ “࠷େެࣜ” ͷΑ͏ͳΛߟ͑ΒΕ Δ͔ʁ f1
= X2Y − 1 f2 = X3 − Y2 − X I = ⟨ f1 , f2 ⟩ ⊆ k[X, Y] ͱ͢Δͱɺ g = X2Y2 − X3Y − XY − 1 I ʹଐ͔͢ʁ 2 ➡ ग़དྷͳ͍ʂ 135݄4༵ -
࠷େެࣜऔΕͳ͍ ࠷େެ͕ࣜඞͣऔΕΔͳΒɺҙͷΠσΞ ϧҰͭͷଟ߲ࣜʹΑΓ⟨ f ⟩ ͷܗͰॻ͚Δ ͔͠͠ɺྫ͑⟨x, y⟩ʹ্͍ͭͯͷΑ͏ͳ f ଘࡏ͠ͳ͍ʂ ผͷखஈΛߟ͑Δ͠
ׂΓࢉͷ༨Γ͕ॏཁͩͬͨ ➡ ׂΓࢉΛҰൠԽͯ͠ΈΑ͏ʂ 135݄4༵ -
ଟ߲ࣜͷදݱ ୯߲ࣜॱংͷલʹɺଟ߲ࣜͷදݱʹ͍ͭͯ จࣈͱࢦͷྻʢ1, x2, xy, y2 ͳͲʣΛ୯߲ࣜͱ͍ ͍ɺͦΕͧΕʹΛॻ͚ͯՃ͑ͨͷΛଟ߲ࣜ ͱݺͿͷͩͬͨ จࣈͷؒʹॱ൪ΛܾΊΕɺ୯߲ࣜͷϕΫ
τϧͱಉҰࢹग़དྷΔ x > y ͱ͢Εɺx2 ↔ (2, 0), xy ↔ (1, 1), 1 ↔ (0, 0) ͱݴ͏۩߹ʹରԠ͢Δ 135݄4༵ -
ଟ߲ࣜͷදݱ ୯߲ࣜॱংͷલʹɺଟ߲ࣜͷදݱʹ͍ͭͯ จࣈͱࢦͷྻʢ1, x2, xy, y2 ͳͲʣΛ୯߲ࣜͱ͍ ͍ɺͦΕͧΕʹΛॻ͚ͯՃ͑ͨͷΛଟ߲ࣜ ͱݺͿͷͩͬͨ จࣈͷؒʹॱ൪ΛܾΊΕɺ୯߲ࣜͷϕΫ
τϧͱಉҰࢹग़དྷΔ x > y ͱ͢Εɺx2 ↔ (2, 0), xy ↔ (1, 1), 1 ↔ (0, 0) ͱݴ͏۩߹ʹରԠ͢Δ ͦ͜Ͱ n-ม୯߲ࣜશମΛℤn ≥0 ͱಉҰࢹ͢Δ 135݄4༵ -
୯߲ࣜॱং ℤn ≥0 ্ͷॱংؔ > ɺ࣍ͷࡾͭͷ݅Λຬͨ ͢ͱ͖୯߲ࣜॱংͰ͋Δͱݴ͏ɿ 1. શॱংੑɿ (α < β) or (α = β) or (α > β) 2.Ճ๏ੑɿα ≤ β ⇒ α + γ ≤ β + γ
3.ඇෛੑɿα ≥ 0 (ҙͷ α ∈ ℤn ≥0 ʹ͍ͭͯ) ఆٛ 135݄4༵ -
୯߲ࣜॱংͷิ 3 ͷඇෛੑͷ݅ɺશॱংੑͱՃ๏ੑͷԼͰ ҎԼͷೋͭͱಉ ྻੑɿҙͷۭͰͳ͍ ℤn ≥0 ͷ෦ू߹͕ < ʹؔͯ͠࠷খΛ࣋ͭ
߱݅ɿ > ʹؔ͢ΔແݶԼ߱ྻ " " " α0 > α1 > α2 > ⋯ > αn > ⋯ ଘࡏ͠ͳ͍ 135݄4༵ -
୯߲ࣜॱংͷิ 3 ͷඇෛੑͷ݅ɺશॱংੑͱՃ๏ੑͷԼͰ ҎԼͷೋͭͱಉ ྻੑɿҙͷۭͰͳ͍ ℤn ≥0 ͷ෦ू߹͕ < ʹؔͯ͠࠷খΛ࣋ͭ
߱݅ɿ > ʹؔ͢ΔແݶԼ߱ྻ " " " α0 > α1 > α2 > ⋯ > αn > ⋯ ଘࡏ͠ͳ͍ ͜ΕΒɺΞϧΰϦζϜͷఀࢭੑͷূ໌Ͱ͏ 135݄4༵ -
୯߲ࣜॱংͷྫ ҎԼ α = (a1 , …, an ), β = (b1 , …, bn ) ͱ͢Δ ࣙॻࣜॱং
>lex ୯߲ࣜॱং α >lex β :⟺ a1 = b1 , …, ai−1 = bi−1 , ai > bi ٯࣙॻࣜॱং >revlex ୯߲ࣜॱংͰͳ͍ α >revlex β :⟺ ai+1 = bi+1 , …, an = bn , ai < bi ʢ※࠷ޙͷෆ߸ͷ͖ʹҙʂʣ 135݄4༵ -
୯߲ࣜॱংͷྫ ͖࣍ࣙॻࣜॱং >grlex ୯߲ࣜॱং α >grlex β :⟺ ∣α∣ > ∣β∣ or
(∣α∣=∣β∣ and α >lex β) ͨͩ͠ ∣α∣ = a1 + ⋯ + an ʢશ࣍ʣ ͖࣍ٯࣙॻࣜॱং >grevlex ୯߲ࣜॱং α >grevlex β :⟺ ∣α∣>∣β∣ or (∣α∣=∣β∣ and α >revlex β) 135݄4༵ -
ଋ ୯߲ࣜॱং > Λݻఆ͢Δɻଟ߲ࣜ f ʹݱΕΔ ʢൈ͖ͷʣ୯߲ࣜͷதͰɺ> ʹ͍ͭͯ࠷ େͱͳΔͷΛઌ಄୯߲ࣜͱӠ͍ɺLM(f) Ͱ
ද͢ɻLM(f) ͷΛઌ಄ͱ͍͍ɺLC(f) Ͱද͢ɻLT(f) = LC(f) LM(f) Λઌ಄߲ͱݺͿɻ 135݄4༵ -
ྫ f = x + 2y2w + 3z3 (x >
y > z >w) >lex ɿLM(f) = x, LC(f) = 1, LT(f) = x >grlex ɿLM(f) = y2w, LC(f) = 2, LT(f) = 2y2w >grevlex ɿLM(f) = z3, LC(f) = 3, LT(f) = 3z3 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = a2 = XY − 1 Y2 − 1 X2Y + XY2 + Y2 XY − 1, Y2 − 1
Ͱ X2Y + XY2 + Y2 ΛׂΔɻࣙॻࣜॱংΛ͏ɻ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X a2 = XY − 1 Y2 − 1 X2Y + XY2 + Y2 X2Y − X
X Λֻ͚Εઌ಄߲͕ফ͑Δɻ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X a2 = XY − 1 Y2 − 1 X2Y + XY2 + Y2 X2Y − X
XY2 + X Ҿ͘ɻ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X a2 = XY − 1 Y2 − 1 X2Y + XY2 + Y2 X2Y − X
XY2 + X + Y2 ্͔ΒҰͭ߱Ζͯ͠ɺ߱ႈͷॱʹฒΔ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + a2 = XY − 1 Y2 − 1 X2Y + XY2 + Y2
X2Y − X XY2 + X + Y2 ઌ಄߲ʹɻ XY − 1 ͰׂΕΔɻ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = XY − 1 Y2 − 1
X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 + Y ઌఔͱಉ༷ʹܭࢉɻ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = XY − 1 Y2 − 1
X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y ઌ಄߲ʹɻXY, Y2 ͲͪΒͰׂΕͳ͍ɻ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = 1 XY − 1
Y2 − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y X ׂΕͳ͍ͷͰ X ༨Γͱͯ͠ԣʹΑ͚Δ Y2 − Y 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = 1 XY − 1
Y2 − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y X Y2 − Y ઌ಄߲ʹɻ XY ແཧͩ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = 1 XY − 1
Y2 − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y X Y2 ͰׂΕΔͷͰɺׂΔɻ Y2 − Y Y2 − 1 Y + 1 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = 1 XY − 1
Y2 − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y X Y2 − Y Y2 − 1 Y + 1 Y 1 0 1 Y, 1 ڞʹͲͷ߲ͰׂΕͳ͍ͷͰԣʹΑ͚Δ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = 1 XY − 1
Y2 − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y X Y2 − Y Y2 − 1 Y + 1 Y 1 0 1 r = X + Y + 1 Α͚ͨͷΛͯ͠ɺ༨Γ r ͕ग़Δ 135݄4༵ -
࣮ྫɿଟมͷׂΓࢉ a1 = X + Y a2 = 1 XY − 1
Y2 − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − Y X + Y2 − Y X Y2 − Y Y2 − 1 Y + 1 Y 1 0 1 r = X + Y + 1 X2Y + XY2 + Y2 = (XY − 1) (X+Y) + (Y2 − 1) ⋅1 + X + Y + 1 135݄4༵ -
͋·Γ ͷ a1 = a2 = Y2 − 1 XY − 1 X2Y + XY2 + Y2 ׂΔॱ൪Λม͑ɺY2 − 1,
XY − 1Ͱ X2Y + XY2 + Y2 ΛׂΔɻ 135݄4༵ -
༨Γͷ a1 = X + 1 a2 = X Y2 − 1
XY − 1 X2Y + XY2 + Y2 X2Y − X XY2 + X + Y2 XY2 − X 2X + Y2 2X Y2 Y2 − 1 1 0 1 r = 2X + 1 X2Y + XY2 + Y2 = (XY − 1) X + (Y2 − 1)(X + 1) + 2X + 1 135݄4༵ -
Gröbner جఈ ୯߲ࣜॱং > ΛҰͭݻఆ͢Δɻଟ߲ࣜͷΠσΞ ϧ I ⊆ k[] ʹ͍ͭͯɺI ͷ༗ݶ෦ू߹
G = {g1, …, gn } ⊆ I ͕࣍ͷ݅Λຬͨ͢ͱ͖ɺG > ʹؔ͢ Δ I ͷ Gröbner جఈ Ͱ͋Δͱݴ͏ɻ ⟨LT(I)⟩ = ⟨LT(g1 ), …, LT(gn )⟩ (i.e. ⟨LT(f) ∣ f ∈ I ⟩ = ⟨LT(g1 ), …, LT(gn )⟩) ఆٛ 135݄4༵ -
Gröbner جఈͷੑ࣭ ҙͷଟ߲ࣜΠσΞϧʹର͠ Gröbner جఈ͕ଘࡏ͢Δ ΠσΞϧ I ͷ Gröbner جఈ
G = {g1 , …, gk } I Λੜ ͢ΔɻଈͪɺI = ⟨g1 , …, gk ⟩ ఆཧ 135݄4༵ -
Gröbner جఈͷੑ࣭ ҙͷଟ߲ࣜΠσΞϧʹର͠ Gröbner جఈ͕ଘࡏ͢Δ ΠσΞϧ I ͷ Gröbner جఈ
G = {g1 , …, gk } I Λੜ ͢ΔɻଈͪɺI = ⟨g1 , …, gk ⟩ Gröbner جఈʹΑΔׂΓࢉͷ༨Γॱ൪ʹґΒͳ͍ɻ ఆཧ 135݄4༵ -
Gröbner جఈͷੑ࣭ ҙͷଟ߲ࣜΠσΞϧʹର͠ Gröbner جఈ͕ଘࡏ͢Δ ΠσΞϧ I ͷ Gröbner جఈ
G = {g1 , …, gk } I Λੜ ͢ΔɻଈͪɺI = ⟨g1 , …, gk ⟩ Gröbner جఈʹΑΔׂΓࢉͷ༨Γॱ൪ʹґΒͳ͍ɻ Gröbner جఈͰׂͬͨ༨Γ͕θϩͰ͋Δࣄͱ I ʹଐ͢Δ ͜ͱಉɿ r = f ̅G = 0 ⟺ f ∈ I ఆཧ 135݄4༵ -
Table of Contents Gröbner جఈͷ؆୯ͳಋೖ Gröbner جఈͷܭࢉ๏ Buchberger ΞϧΰϦζϜ ࠷దԽख๏ɿsyzygy,
sugar strategy Haskell ͷܕϨϕϧϓϩάϥϛϯάͷݱࡏ 135݄4༵ -
Buchberger ΞϧΰϦζϜ Gröbner جఈ͕ศརͦ͏ͳͷΘ͔ͬͨ ۩ମతͳܭࢉ๏ɿBuchberger ΞϧΰϦζϜ ४උతͳఆٛɿf, g ∈ k[] ͷ S-ଟ߲ࣜ S(f,
g) := ɹɹ ɹɹ f − ɹɹ ɹɹg LCM(LT(f), LT(g)) LT(f) LCM(LT(f), LT(g)) LT(g) 135݄4༵ -
Buchberger ΞϧΰϦζϜ Gröbner جఈ͕ศརͦ͏ͳͷΘ͔ͬͨ ۩ମతͳܭࢉ๏ɿBuchberger ΞϧΰϦζϜ ४උతͳఆٛɿf, g ∈ k[] ͷ S-ଟ߲ࣜ S(f,
g) := ɹɹ ɹɹ f − ɹɹ ɹɹg f, g ͷઌ಄߲ಉ࢜Λଧফ͠߹Θͤͨ LCM(LT(f), LT(g)) LT(f) LCM(LT(f), LT(g)) LT(g) 135݄4༵ -
Buchberger ΞϧΰϦζϜ Gröbner جఈ͕ศརͦ͏ͳͷΘ͔ͬͨ ۩ମతͳܭࢉ๏ɿBuchberger ΞϧΰϦζϜ ४උతͳఆٛɿf, g ∈ k[] ͷ S-ଟ߲ࣜ S(f,
g) := ɹɹ ɹɹ f − ɹɹ ɹɹg f, g ͷઌ಄߲ಉ࢜Λଧফ͠߹Θͤͨ ͨͩ͠ LCM((a1 , …, an ), (b1 , …, bn )) := (max{a1 , b1 }, …, max{an , bn }) LCM(LT(f), LT(g)) LT(f) LCM(LT(f), LT(g)) LT(g) 135݄4༵ -
Buchberger ఆ๏ I ⊆ k[]ɿΠσΞϧɹɹ >ɿ୯߲ࣜॱং G = {g1 , …, gk } ⊆ IɿI ͷੜݩ G’ = (g1 , …, gk )ɿG
ͷݩΛదʹฒͨͷ ͜ͷͱ͖ҎԼͷೋͭಉɿ 1. G > ʹؔ͢Δ I ͷ Gröbner جఈ 2.S(gi , gk )G’ = 0ɹ(∀ i < j) ఆཧ 135݄4༵ -
Buchberger ΞϧΰϦζϜ ೖྗɿG = (f1 , …, fs ) R ← {S(p, q)G’ ∣ p ≠ q ∈ G} \ {0} G ←
(G, R) R ≠ ∅ ग़ྗɿG R = ∅ 135݄4༵ -
؆୯ͳ࣮ buchberger :: [Polynomial k ord n] → [Polynomial k
ord n] buchberger ideal = fst $ until (null ∘ snd) loop (ideal, calc ideal) where loop (ggs, acc) = let cur = nub $ ggs ++ acc in (cur, calc cur) calc acc = [ q | f ← acc, g ← acc, f ≠ g , let q = sPolynomial f g `mod` acc , q ≠ zero ] 135݄4༵ -
lex Ͱܭࢉ͢Δͱʁ G = {x2y − 1, x3 − y2 − x, y3 + xy − x, − y3 − xy + x, y5 + y4 + y3 + x2 − x − 1, − y5 − y4 − y3 − x2 + x + 1, − y6 − y5 − y4 − y3 + x + y − 1, y7 + 2y6 + 2y5 + 2y4 + 2y3 − y2 − 2x + 1, y6 + y5 + y4 + y3 − x − y + 1, − y7 − 2y6 − 2y5 − 2y4 − 2y3 + y2 + 2x − 1, − y9 − 2y8 − 3y7 + y4 − 4y + 3, − 1 / 2y10 − 3 / 2y9 − 5 / 2y8 − 7 / 2y7 + 1 / 2y5 + 1 / 2y4 − 9 / 2y + 7 / 2, y7 − y2 + 2y − 1, 1 / 2y8 + y7 − 1 / 2y3 + 3 / 2y − 1, − y7 + y2 − 2y + 1, − y8 − 2y7 + y3 − 3y + 2, − 1 / 2y9 − 3 / 2y8 − 5 / 2y7 + 1 / 2y4 +
1 / 2y3 − 7 / 2y + 5 / 2, y9 + 2y8 + 3y7 − y4 + 4y − 3, y8 + 2y7 − y3 + 3y − 2, 1 / 2y7 − 1 / 2y2 + y − 1 / 2, 1 / 2y10 + 3 / 2y9 + 5 / 2y8 + 7 / 2y7 − 1 / 2y5 − 1 / 2y4 + 9 / 2y − 7 / 2, − 1 / 2y8 − y7 + 1 / 2y3 − 3 / 2y + 1, 1 / 2y9 + 3 / 2y8 + 5 / 2y7 − 1 / 2y4 − 1 / 2y3 + 7 / 2y − 5 / 2, − 1 / 2y7 + 1 / 2y2 − y + 1 / 2} 135݄4༵ -
ޮͷ Grevlex ͕Ұ൪ͯ͘جఈ៉ྷͳͷ͕ٻ·Γ ͍͢ͱ͞ΕΔ lex جఈෳࡶʹͳΔ͕͔͔࣌ؒ͠Δ ʹΑͬͯ Grevlex ͷํ͕͍͜ͱ͋Δ ͕ɺ΄΅େ
Grevlex ͕ѹతʹ͍ Ԡ༻ʹΑͬͯ grevlex Ͱͳ͘ lex Λ͏ 135݄4༵ -
ۃখɾඃGröbnerجఈ Buchberger ΞϧΰϦζϜͰٻΊͨجఈʹແବ͕͋Δ ۃখɾඃ Gröbner جఈʂ Gröbnerجఈ G ͕ۃখ ⇔ ҙͷ
i ʹ͍ͭͯ LC(gi ) = 1, LT(gi ) Ͳͷ LT(gj ) (j ≠ i) ͰׂΕͳ͍ 135݄4༵ -
ۃখɾඃGröbnerجఈ Buchberger ΞϧΰϦζϜͰٻΊͨجఈʹແବ͕͋Δ ۃখɾඃ Gröbner جఈʂ Gröbnerجఈ G ͕ۃখ ⇔ ҙͷ
i ʹ͍ͭͯ LC(gi ) = 1, LT(gi ) Ͳͷ LT(gj ) (j ≠ i) ͰׂΕͳ͍ G ͕ඃ ⇔ ҙͷ i ʹ͍ͭͯ LC(gi ) = 1 ͔ͭ gi ͷͲͷ߲ LT(gj ) (j ≠ i) ͰׂΕͳ͍ 135݄4༵ -
ඃ Gröbner جఈͷҰҙੑ Gröbner جఈෳଘࡏ͠͏Δ buchberger ͰٻΊͨɺͦ ͷۃখԽ……etc ͦΕΒඃԽ͢ΕҰக͢ Δʂʢ୯߲ࣜॱং͕ಉ͡ͳΒʣ
I ⊆ k[]ɿΠσΞϧ >ɿ୯߲ࣜॱং I ͷ > ʹ͍ͭͯͷඃ Gröbner جఈҰ ҙʹఆ·Δ ఆཧ 135݄4༵ -
ඃ Gröbner جఈͷҰҙੑ Gröbner جఈෳଘࡏ͠͏Δ buchberger ͰٻΊͨɺͦ ͷۃখԽ……etc ͦΕΒඃԽ͢ΕҰக͢ Δʂʢ୯߲ࣜॱং͕ಉ͡ͳΒʣ
ΠσΞϧ͕͍͔͠Ͳ͏͔Λɺ ඃ Gröbner جఈͷੜݩ͕ ͍͔͠Ͱఆग़དྷΔʂ I ⊆ k[]ɿΠσΞϧ >ɿ୯߲ࣜॱং I ͷ > ʹ͍ͭͯͷඃ Gröbner جఈҰ ҙʹఆ·Δ ఆཧ 135݄4༵ -
ඃԽͷखଓ ·ͣۃখԽΛߦ͏ 1. G ͷ֤ݩΛ࠷ߴ࣍Ͱׂͬͯ LC(p) = 1 2. (2)
ͷ݅Λຬͨ͞ͳ͍ΛऔΓআ͘ 135݄4༵ -
ඃԽͷखଓ ·ͣۃখԽΛߦ͏ 1. G ͷ֤ݩΛ࠷ߴ࣍Ͱׂͬͯ LC(p) = 1 2. (2)
ͷ݅Λຬͨ͞ͳ͍ΛऔΓআ͘ ͦΕΛඃԽ͢Δ 1. p ∈ G ΛऔΓɺp’ = p̅G \ {p}, G’ = G \ {p} ∪ {p’} ͱ͢Δ 2. q ∈ G’ \ {p’} ʹ͍ͭͯಉ༷ͷࣄΛ͢ΔɻҎԼಉจɻ 135݄4༵ -
࣮ྫ దٓΞοϓσʔτ͢Δඞཁ͕͋ΔͷͰ ST Ͱָͯ͠ॻ͍ͨ ඃԽͷ࣮ಉ༷ minimizeGroebnerBasis :: (Field k, IsPolynomial
k n, IsMonomialOrder order) ⇒ [OrderedPolynomial k ord n] → [OrderedPolynomial k ord n] minimizeGroebnerBasis bs = runST $ do left ← newSTRef bs right ← newSTRef [] whileM_ (not . null <$> readSTRef left) $ do f : xs ← readSTRef left writeSTRef left xs ys ← readSTRef right if any (λg → leadingMonomial g `divs` leadingMonomial f) xs ∨ any (λg → leadingMonomial g `divs` leadingMonomial f) ys then writeSTRef right ys else writeSTRef right (monoize f : ys) readSTRef right 135݄4༵ -
Table of Contents Gröbner جఈͷ؆୯ͳಋೖ Gröbner جఈͷܭࢉ๏ Buchberger ΞϧΰϦζϜ ࠷దԽख๏ɿsyzygy,
sugar strategy Haskell ͷܕϨϕϧϓϩάϥϛϯάͷݱࡏ 135݄4༵ -
θϩ؆ؔ Buchberger Կނ͍ʁ Buchberger ׂΓࢉͷ͔ͨ·Γ lex ΑΓ grevlex ͕͍ͷɺͦͬͪͷ΄ ͏ׂ͕Γࢉͷεςοϓ͕খ͍͔͞Β
ׂΓࢉͷճΛͬͱݮΒͤͳ͍ʁ 135݄4༵ -
θϩ؆ؔ ʮׂͬͯ༨ΓθϩʯΛҰൠԽͨ͠ͷ͕࣍ ଟ߲ࣜ f ∈ k[] ͕ G = {g1 , …, gk } ⊆ k[] Λ ๏ͱͯ͠θϩʹ؆ʢه߸ɿ
f →G 0ʣ͞ΕΔ ⇔ f = a1 g1 + ⋯ + ak gk (ai ∈ k[]) ͔ͭ [ai gi = 0 ·ͨ deg(f) ≥ deg(ai gi )] ୠ͠ɺdeg(f) f ͷଟॏ࣍ deg(f) = LM(f) ఆٛ 135݄4༵ -
վྑ Buchberger ఆ๏ ࣮ Buchberger ఆ๏θϩ؆Ͱेʂ I ⊆ k[]ɿΠσΞϧɹɹ >ɿ୯߲ࣜॱং G = {g1 , …, gk } ⊆ IɿI
ͷੜݩ ͜ͷͱ͖ҎԼͷೋͭಉɿ 1. G > ʹؔ͢Δ I ͷ Gröbner جఈ 2. S(gi , gj ) →G 0ɹ(∀ i < j) ఆཧ 135݄4༵ -
۩ମతʹ͍ͭθϩ؆ʁ I ⊆ k[]ɿΠσΞϧɹɹ >ɿ୯߲ࣜॱং G = {g1 , …, gk } ⊆ IɿI ͷੜݩ S̅(f̅, ̅g̅)̅G’ = 0 ⇒ S(f, g) →G 0 LCM(LM(f), LM(g)) = LM(f) LM(g)
⇒ S(f, g) →G 0 ʢf, g ͕ ޓ͍ʹૉ ͳΒ S-ଟ߲ࣜθϩʹ؆͞ΕΔʣ ໋ 135݄4༵ -
ޓ͍ʹૉఆ ೋ൪ͷ͕݅͑Δʂ x3 ͱ z4 ޓ͍ʹૉͳͷͰ S(x3 + y, z4) →G 0 ͱͳΔ ɹɹɹ
S(x3 + y, z4) = yz4 ɹɹɹ∴ S(x3 + y, z4)G = y ≠ 0 ࠓ·Ͱͷఆ๏ͩͱແବʹׂΓࢉΛ͢Δʂ ͲΕ͘Β͍վળʁ 135݄4༵ -
Benchmark simple prime I1 = ⟨x2 + y2 + z2 − 1, x2 + y2 + z2 − 2x, 2x − 3y − z⟩ I2 = ⟨x2y − 2xy − 4z − 1, z − y2, x3 − 4zy⟩ I3 = ⟨2S − ay, b2 − (x2 + y2), c2 − ((a − x)2 + y2)⟩" I4
= ⟨z5 + y4 + x3 − 1, z3 + y3 + x2 − 1⟩ 135݄4༵ -
Benchmark lex01 grlex01 grevlex01 lex03 grlex03 grevlex03 0ms 22.5ms 45ms
67.5ms 90ms simple prime grlex02 grevlex02 0.9s 1s 1.1s 1.2s 1.3s grlex04 grevlex04 0μs 150μs 300μs 450μs 600μs I1 = ⟨x2 + y2 + z2 − 1, x2 + y2 + z2 − 2x, 2x − 3y − z⟩ I2 = ⟨x2y − 2xy − 4z − 1, z − y2, x3 − 4zy⟩ I3 = ⟨2S − ay, b2 − (x2 + y2), c2 − ((a − x)2 + y2)⟩" I4 = ⟨z5 + y4 + x3 − 1, z3 + y3 + x2 − 1⟩ 135݄4༵ -
syzygy ͷجఈ ͦͦ S-ଟ߲ࣜͱԿͳͷ͔ʁ ࣮ syzygy ͱݺΕΔͷͷجఈʂ Gröbner جఈͷجఈͱҙຯ͕एׯҧ͏ “syzygy
ͷͱ” ͱࢥ͑Α͍ 135݄4༵ -
syzygy (h1 , …, hs ) ∈ k[]s ͕ F = (f1 , …, fs
) ⊆ k[]s ͷ ઌ಄߲ͷ syzygy :⇔ h1 LT(f1 ) + ⋯ + hs LT(fs ) = 0 F ͷઌ಄߲ syzygy ͷશମΛ S(F) ͱॻ͘ɻ ఆٛ 135݄4༵ -
syzygy (h1 , …, hs ) ∈ k[]s ͕ F = (f1 , …, fs
) ⊆ k[]s ͷ ઌ಄߲ͷ syzygy :⇔ h1 LT(f1 ) + ⋯ + hs LT(fs ) = 0 F ͷઌ಄߲ syzygy ͷશମΛ S(F) ͱॻ͘ɻ T ⊆ S(F) ͕ S(F) ͷجఈ ⇔ S(F) ͷͲͷݩ T ͷݩͷ༗ ݶݸͷͰॻ͚Δɻ ఆٛ 135݄4༵ -
syzygy (h1 , …, hs ) ∈ k[]s ͕ F = (f1 , …, fs
) ⊆ k[]s ͷ ઌ಄߲ͷ syzygy :⇔ h1 LT(f1 ) + ⋯ + hs LT(fs ) = 0 F ͷઌ಄߲ syzygy ͷશମΛ S(F) ͱॻ͘ɻ T ⊆ S(F) ͕ S(F) ͷجఈ ⇔ S(F) ͷͲͷݩ T ͷݩͷ༗ ݶݸͷͰॻ͚Δɻ ei = (0, …, 0, 1, 0, …, 0) (i ൪͚ͩ 1) ͱॻ͘͜ͱʹ͢ Δɻ͜ͷͱ͖ ͱஔ͘ͱɺ S(fi , fj ) = Sij ⋅ F ʢੵʣͱͳΔɻ LCM(LT(fi ), LT(fj )) LT(fi) LCM(LT(fi ), LT(fj )) LT(fj) Sij := ei − ej ఆٛ 135݄4༵ -
syzygy ͷجఈͱθϩ؆ I ⊆ k[]ɿΠσΞϧɹɹ >ɿ୯߲ࣜॱং G = {g1 , …, gk } ⊆ IɿI ͷੜݩ S ⊆ S(G)ɿG ͷઌ಄߲
syzygy ͷجఈ ͜ͷͱ͖ҎԼͷೋͭಉɿ 1. G > ʹؔ͢Δ I ͷ Gröbner جఈ 2.ҙͷ T ∈ S ʹର͠ɺ T ⋅ G = ∑ k i = 1 ti gi →G 0ɹ(∀ i < j) ఆཧ 135݄4༵ -
S-ଟ߲ࣜͱ syzygy ࣮ Sij ͷશମ S(G) ͷجఈ ༨ͳجఈ͍ࠞͬͯ͡Δ F = (x2y2 + z, xy2 − y, x2y + yz) S12
= (1, -x, 0) S13 = (1, 0, -y) S23 = (0, x, -y) S13 − S12 = (0, x, -y) = S23 ∴ S23 ཁΒͳ͍ࢠ 135݄4༵ -
S-ଟ߲ࣜͱ syzygy ࣮ Sij ͷશମ S(G) ͷجఈ ༨ͳجఈ͍ࠞͬͯ͡Δ F = (x2y2 + z, xy2 − y, x2y + yz) S12
= (1, -x, 0) S13 = (1, 0, -y) S23 = (0, x, -y) S13 − S12 = (0, x, -y) = S23 ∴ S23 ཁΒͳ͍ࢠ ༨ͳجఈΛ༧Ίఆग़དྷͳ͍͔ʁ 135݄4༵ -
ແବͳ syzygy جఈͷఆ G = (g1 , …, gs ) gi , gj , gk ∈ G ⊆
{Sij ∣ 1 ≤ j < k ≤ s}ɿS(G) ͷجఈ LT(gk ) ∣ LCM(LT(gi ), LT(gj )) ͔ͭ Sik , Sjk ∈ ⇒ S \ {Sij } S(G) ͷجఈ ໋ 135݄4༵ -
ແବͳ syzygy جఈͷఆ G = (g1 , …, gs ) gi , gj , gk ∈ G ⊆
{Sij ∣ 1 ≤ j < k ≤ s}ɿS(G) ͷجఈ LT(gk ) ∣ LCM(LT(gi ), LT(gj )) ͔ͭ Sik , Sjk ∈ ⇒ S \ {Sij } S(G) ͷجఈ ໋ ͜ΕͰׂΓࢉͷճΛେ෯ʹݮΒͤΔʂ 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 2. LCM(LT(fi ), LT(fj )) ≠ LT(fi ) LT(fj ) ͔ͭ Test(fi , fj , B) ِ͕ͳΒ 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 2. LCM(LT(fi ), LT(fj )) ≠ LT(fi ) LT(fj ) ͔ͭ Test(fi , fj , B) ِ͕ͳΒ 1. S := S(fi , fj )G 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 2. LCM(LT(fi ), LT(fj )) ≠ LT(fi ) LT(fj ) ͔ͭ Test(fi , fj , B) ِ͕ͳΒ 1. S := S(fi , fj )G 2. S ≠ 0 ͳΒ t = t + 1, ft = S, G = G ∪ {ft }, B = B ∪ {(i, t)∣1 ≤ i ≤ t − 1} 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 2. LCM(LT(fi ), LT(fj )) ≠ LT(fi ) LT(fj ) ͔ͭ Test(fi , fj , B) ِ͕ͳΒ 1. S := S(fi , fj )G 2. S ≠ 0 ͳΒ t = t + 1, ft = S, G = G ∪ {ft }, B = B ∪ {(i, t)∣1 ≤ i ≤ t − 1} 3. B = B \ {(i, j)} 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 2. LCM(LT(fi ), LT(fj )) ≠ LT(fi ) LT(fj ) ͔ͭ Test(fi , fj , B) ِ͕ͳΒ 1. S := S(fi , fj )G 2. S ≠ 0 ͳΒ t = t + 1, ft = S, G = G ∪ {ft }, B = B ∪ {(i, t)∣1 ≤ i ≤ t − 1} 3. B = B \ {(i, j)} ग़ྗɿG 135݄4༵ -
վྑ൛ Buchbergerɾվ ೖྗɿ F = (f1 , …, fs ) ॳظԽɿB := {(i, j)∣1 ≤ i < j ≤ s}ʢsyzygyجఈͷީิʣ G := F t := s
खॱɿ B = ∅ ͱͳΔ·Ͱ࣍Λ܁Γฦ͢ɿ 1. (i, j) ∈ B ΛҙʹબͿ 2. LCM(LT(fi ), LT(fj )) ≠ LT(fi ) LT(fj ) ͔ͭ Test(fi , fj , B) ِ͕ͳΒ 1. S := S(fi , fj )G 2. S ≠ 0 ͳΒ t = t + 1, ft = S, G = G ∪ {ft }, B = B ∪ {(i, t)∣1 ≤ i ≤ t − 1} 3. B = B \ {(i, j)} ग़ྗɿG ୠ͠Test(fi , fj , B) ⇔ ∃ k ≠ i, j [(i, k), (i, j) ∉ B, LT(fk ) ∣ LCM(LT(fi ), LT(fj ))] 135݄4༵ -
࣮ syzygyBuchberger ideal = runST $ do bases ← newSTRef
{ Entry LM(f) f | f ← ideal } pairs ← newSTRef {(f, g) | (f, g) ← combinations ideal } len ← newSTRef $ length ideal whileM_ (not . null <$> readSTRef pairs) $ do Just ((f, g), rest) ← viewMin <$> readSTRef pairs bases0 ← readSTRef bases b .= rest let redundant = any (λ(Entry _ h) → h ∉ {f, g} ∧ (all (∉ rest) [(f, h), (g, h)]) ∧ LM(h) | LCM(LM(f), LM(g))) bases when (LCM(LM(f), LM(g)) ≠ LM(f) LM(g) ∧ not redundant) $ do len0 ← readSTRef len let s = S(f, g) `mod` map payload (toList bases0) when (s ≠ zero) $ do pairs += { (q, s) | Entry _ q ← qs } bases %= insert (Entry LM(s) s) len *= 2 map payload . toList <$> readSTRef bases 135݄4༵ -
࣮ͷղઆ ޮͷͨΊ ST Ϟφυʹͨ͠ {} Ͱғ·Ε͍ͯΔͷ༏ઌΩϡʔͷͭΓ ܦݧతʹɺׂΓࢉΛ͢Δࡍઌ಄߲Λঢॱʹฒ͓ͯ ͘ͱΑ͍ ͲΜͲΜׂΕͯճ͕গͳ͘ͳΔ جఈީิΛઌ಄߲Λ༏ઌͱ͢ΔΩϡʔͱͯ࣋ͬ͠
͓͍ͯͯɺׂΔͱ͖ʹ toList Ͱঢॱʹฒ͍ͯΔ 135݄4༵ -
Benchmark lex01 grlex01 grevlex01 lex03 grlex03 grevlex03 0ms 22.5ms 45ms
67.5ms 90ms simple prime syzygy grlex02 grevlex02 0s 0.375s 0.75s 1.125s 1.5s grlex04 grevlex04 0μs 150μs 300μs 450μs 600μs 135݄4༵ -
Benchmark lex01 grlex01 grevlex01 lex03 grlex03 grevlex03 0ms 22.5ms 45ms
67.5ms 90ms simple prime syzygy grlex02 grevlex02 0s 0.375s 0.75s 1.125s 1.5s grlex04 grevlex04 0μs 150μs 300μs 450μs 600μs ͗ͯ͢ݟ͑ͳ͍…… 135݄4༵ -
ޓ͍ʹૉఆͱͷൺֱ lex01 grlex01 grevlex01 lex03 grlex03 grevlex03 0ms 2.5ms 5ms
7.5ms 10ms grlex02 grevlex02 0s 0.375s 0.75s 1.125s 1.5s grlex04 grevlex04 58μs 59.25μs60.5μs61.75μs 63μs prime syzygy 135݄4༵ -
ޓ͍ʹૉఆͱͷൺֱ lex01 grlex01 grevlex01 lex03 grlex03 grevlex03 0ms 2.5ms 5ms
7.5ms 10ms grlex02 grevlex02 0s 0.375s 0.75s 1.125s 1.5s grlex04 grevlex04 58μs 59.25μs60.5μs61.75μs 63μs prime syzygy ͦΕͰ͍ ʂ 135݄4༵ -
selection strategy normal strategy ઌ಄߲ͷ LCM ͕ৗʹ࠷খʹͳΔͷ lex ॱংͳͲ࣍Λอͨͳ͍ॱংͰٯޮՌ sugar
strategy Ծతͳ੪࣍Խ͕࣍࠷খͷΛબͿ 135݄4༵ -
selection strategy normal strategy ઌ಄߲ͷ LCM ͕ৗʹ࠷খʹͳΔͷ lex ॱংͳͲ࣍Λอͨͳ͍ॱংͰٯޮՌ sugar
strategy Ծతͳ੪࣍Խ͕࣍࠷খͷΛબͿ ͍ͣΕಉҰҐ͕ग़ͨΒૣ͘ग़ͯདྷͨํΛબͿ 135݄4༵ -
selection strategy normal strategy ઌ಄߲ͷ LCM ͕ৗʹ࠷খʹͳΔͷ lex ॱংͳͲ࣍Λอͨͳ͍ॱংͰٯޮՌ sugar
strategy Ծతͳ੪࣍Խ͕࣍࠷খͷΛબͿ ͍ͣΕಉҰҐ͕ग़ͨΒૣ͘ग़ͯདྷͨํΛબͿ ͜ͷ݅Λൈ͔͢ͱڪ͘͘͠ͳΔ…… 135݄4༵ -
੪࣍Խ࣍ ੪࣍ࣜʢ֤୯߲ࣜͷશ͕͍࣍͠ଟ߲ࣜʣΛੜݩͱ͢ΔΠ σΞϧͷܭࢉܦݧతʹ͍ ༨ͳมͰੜݩΛ੪࣍Խ͔ͯ͠Βܭࢉ͢Δͱ͍͏ώϡʔ ϦεςΟΫε͕ΒΕ͍ͯΔ ੪࣍Խͷྫɿxy + 2x + y3 + 3 ⇒ xyz + 2xz2 + y3 + 3z3 ɿಘΒΕͨجఈ͔Β༨ͳมΛফڈͯ͠ Gröbner
جఈʹͳΔͱݶΒͳ͍ ੪࣍Խͯ͠ಘΒΕͨݩʹରͯ͠͏Ұ Buchberger Λ͏͜ͱʹͳΔʢͦΕͰଟগ͘ͳΔ߹͕ ͋ΔΒ͍͠ʣ 135݄4༵ -
sugar ଟ߲ࣜ (fi , fj ) ͷ sugar Λ࣍ͷΑ͏ʹఆΊΔɻ Sfᵢ = deg(fi
), Sfⱼ = deg(fj ) 135݄4༵ -
sugar ଟ߲ࣜ (fi , fj ) ͷ sugar Λ࣍ͷΑ͏ʹఆΊΔɻ Sfᵢ = deg(fi
), Sfⱼ = deg(fj ) Sf ɿgiven Ͱ t ͕୯߲ࣜͳΒ Stf = deg(t) + Sf 135݄4༵ -
sugar ଟ߲ࣜ (fi , fj ) ͷ sugar Λ࣍ͷΑ͏ʹఆΊΔɻ Sfᵢ = deg(fi
), Sfⱼ = deg(fj ) Sf ɿgiven Ͱ t ͕୯߲ࣜͳΒ Stf = deg(t) + Sf f = g + h ͷ࣌ɺSf = max(Sg , Sf ) 135݄4༵ -
sugar ଟ߲ࣜ (fi , fj ) ͷ sugar Λ࣍ͷΑ͏ʹఆΊΔɻ Sfᵢ = deg(fi
), Sfⱼ = deg(fj ) Sf ɿgiven Ͱ t ͕୯߲ࣜͳΒ Stf = deg(t) + Sf f = g + h ͷ࣌ɺSf = max(Sg , Sf ) (fi , fj ) ͷ sugar ɺ্ʹैͬͯܭࢉͨ͠ S-ଟ ߲ࣜͷ sugar ͱ͢Δɻ 135݄4༵ -
࣮ࡍͷ࣮ ͓͋ͭΒ͖͑ʹ༏ઌΩϡʔΛ͍ͬͯͨ “selection strategy = ༏ઌͷܭࢉํ๏” ͱͯ͠நԽग़དྷΔʂ double sugar ͱ͍͏ख๏͜Ε͚ͩͰແཧ
ʢͰͦ͜·ͰޮՌ͕ͳ͍Β͍͠ͷͰແࢹʣ 135݄4༵ -
࣮ࡍͷ࣮ ͓͋ͭΒ͖͑ʹ༏ઌΩϡʔΛ͍ͬͯͨ “selection strategy = ༏ઌͷܭࢉํ๏” ͱͯ͠நԽग़དྷΔʂ double sugar ͱ͍͏ख๏͜Ε͚ͩͰແཧ
ʢͰͦ͜·ͰޮՌ͕ͳ͍Β͍͠ͷͰແࢹʣ (i, j) Λอଘ͢Δ࣌ʹॏΈอଘ͓ͯ͘͠ 135݄4༵ -
࣮ syzygyBuchbergerWithStrategy strategy ideal = runST $ do let gens
= zip [1..] ideal bases ← newSTRef { Entry LM(f) f | (_, f) ← gens } pairs ← newSTRef { Entry (calcWeight strategy f g, j) (f, g) | ((i, f), (j, g)) ← combinations ideal } len ← newSTRef $ length ideal whileM_ (not . null <$> readSTRef pairs) $ do Just (Entry _ (f, g), rest) ← viewMin <$> readSTRef pairs -- தུ when (s ≠ zero) $ do pairs += { Entry (calcWeight strategy q s, j) (q, s) | Entry _ q ← qs | j ← [len0 + 1 ..] } bases %= insert (Entry LM(s) s) len *= 2 map payload . toList <$> readSTRef bases ॏΈΛՃ͢Δ͚ͩͰ࣮ग़དྷͯ͠·ͬͨ…… 135݄4༵ -
Benchmark lex01 grlex01 grevlex01 lex03 grlex03 grevlex03 0ms 0.15ms 0.3ms
0.45ms 0.6ms grlex02 grevlex02 16ms 17ms 18ms 19ms 20ms grlex04 grevlex04 58μs 58.1μs 58.2μs58.3μs58.4μs syzygy sugar 135݄4༵ -
Benchmarkʢจ൛ʣ grevlex01 lex02 grevlex02 0ms 10ms 20ms 30ms 40ms grevlex03
0ms 700ms1400ms2100ms 2800ms syzygy sugar lex01 0ms 0.5ms 1ms 1.5ms 2ms I1 = ⟨35y4 − 10xy2 − 210y2z + 3x2 + 30xz − 105z2 + 140yt − 21u, 5xy3 − 140y3z − 3x2y + 45xyz − 420yz2 + 210y2t − 25xt + 70zt + 126yu⟩ I2 = ⟨x + y + z + w, xy + yz + zw + wx, xyz + yzw + zwx + wxy, xyzw − 1⟩ɹ I3 = ⟨x31 − x6 − x − y, x8 − z, x10 − t⟩ 135݄4༵ -
Table of Contents Gröbner جఈͷ؆୯ͳಋೖ Gröbner جఈͷܭࢉ๏ Buchberger ΞϧΰϦζϜ ࠷దԽख๏ɿsyzygy,
sugar strategy Haskell ͷܕϨϕϧϓϩάϥϛϯάͷݱࡏ 135݄4༵ -
ґଘܕͱূ໌ͷ ΦϯύϨʔυ DataKinds GADTs ͱ͍֦ͬͨுػೳΛଟ༻ ୯߲ࣜࢦϕΫτϧͰදݱ͍ͯ͠ΔͷͰɺมͷͷ۠ ผΛ͔ͬ͠Γ͚͍ͭͨ ͖ͭ͞ϕΫτϧʂ ڥք݅ূ໌͠Α͏ʂ
͜Ε͚ͩͰ͔ͳΓେมͳͷͰɺʮΞϧΰϦζϜͷ ଥੑʯͱ͔͍ࣔͯ͠ͳ͍Ͱ͢ʢࢮ͵ʣ 135݄4༵ -
ৄ͘͠ίʔυࢀর -- | N-ary Monomial. IntMap contains degrees for each
xi. type Monomial (n :: Nat) = Vector Int n -- | Monomial with monomial order. newtype OrderedMonomial (ord :: ⋆) n = OrderedMonomial { getMonomial :: Monomial n } deriving instance (Eq (Monomial n)) ⇒ Eq (OrderedMonomial ordering n) type MonomialOrder = ∀n. Monomial n → Monomial n → Ordering -- | Class to lookup ordering from its (type-level) name. class IsOrder (ordering :: ⋆) where cmpMonomial :: Proxy ordering → MonomialOrder -- | Class for Monomial orders. class IsOrder name ⇒ IsMonomialOrder name where 135݄4༵ -
ৄ͘͠ίʔυࢀর data Lex = Lex data Revlex = Revlex data
Grevlex = Grevlex lex :: MonomialOrder lex Nil Nil = EQ lex (x :- xs) (y :- ys) = x `compare` y <> xs `lex` ys lex _ _ = error "cannot happen" revlex :: Monomial n → Monomial n → Ordering revlex (x :- xs) (y :- ys) = xs `revlex` ys <> y `compare` x revlex Nil Nil = EQ revlex _ _ = error "cannot happen!" graded :: (Monomial n → Monomial n → Ordering) → (Monomial n → Monomial n → Ordering) graded cmp xs ys = comparing totalDegree xs ys <> cmp xs ys instance IsOrder Grevlex where cmpMonomial _ = graded revlex instance IsOrder Revlex where cmpMonomial _ = revlex 135݄4༵ -
ΠσΞϧ hack data Ideal r = ∀n. Ideal (Vector r
n) instance Eq r ⇒ Eq (Ideal r) where (≡) = (≡) `on` generators generators :: Ideal r → [r] generators (Ideal is) = toList is addToIdeal :: r → Ideal r → Ideal r addToIdeal i (Ideal is) = Ideal (i :- is) toIdeal :: NoetherianRing r ⇒ [r] → Ideal r toIdeal = foldr addToIdeal (Ideal Nil) 135݄4༵ -
ΠσΞϧ hack data Ideal r = ∀n. Ideal (Vector r
n) instance Eq r ⇒ Eq (Ideal r) where (≡) = (≡) `on` generators generators :: Ideal r → [r] generators (Ideal is) = toList is addToIdeal :: r → Ideal r → Ideal r addToIdeal i (Ideal is) = Ideal (i :- is) toIdeal :: NoetherianRing r ⇒ [r] → Ideal r toIdeal = foldr addToIdeal (Ideal Nil) ΠσΞϧϦετ……Ͱͳ͍ʂ 135݄4༵ -
ΠσΞϧ hack data Ideal r = ∀n. Ideal (Vector r
n) instance Eq r ⇒ Eq (Ideal r) where (≡) = (≡) `on` generators generators :: Ideal r → [r] generators (Ideal is) = toList is addToIdeal :: r → Ideal r → Ideal r addToIdeal i (Ideal is) = Ideal (i :- is) toIdeal :: NoetherianRing r ⇒ [r] → Ideal r toIdeal = foldr addToIdeal (Ideal Nil) ΠσΞϧϦετ……Ͱͳ͍ʂ ඇৗʹਂԕͳΔཧ༝ʹΑΓଘࡏྔԽ͞Εͨ sized-vector 135݄4༵ -
ΠσΞϧ hack data Ideal r = ∀n. Ideal (Vector r
n) instance Eq r ⇒ Eq (Ideal r) where (≡) = (≡) `on` generators generators :: Ideal r → [r] generators (Ideal is) = toList is addToIdeal :: r → Ideal r → Ideal r addToIdeal i (Ideal is) = Ideal (i :- is) toIdeal :: NoetherianRing r ⇒ [r] → Ideal r toIdeal = foldr addToIdeal (Ideal Nil) ΠσΞϧϦετ……Ͱͳ͍ʂ ඇৗʹਂԕͳΔཧ༝ʹΑΓଘࡏྔԽ͞Εͨ sized-vector ফڈΠσΞϧͷܭࢉͷ࣌ʹ҉ཪʹܕΛ߹ΘͤΔҝ 135݄4༵ -
⁋᧒Λ߹Θͤʹ༻ҙ͞Εͨ data Monomorphic k = ∀a. Monomorphic (k a) --
| A types which have the monomorphic representation. class Monomorphicable k where -- | Monomorphic representation type MonomorphicRep k :: ⋆ -- | Promote the monomorphic value to the polymophic one. promote :: MonomorphicRep k → Monomorphic k -- | Demote the polymorphic value to the monomorphic representation. demote :: Monomorphic k → MonomorphicRep k -- | Convinience function to demote polymorphic types -- into monomorphic one directly. demote' :: Monomorphicable k ⇒ k a → MonomorphicRep k demote' = demote ∘ Monomorphic -- | Demote polymorphic nested types directly into -- monomorphic representation. demoteComposed :: Monomorphicable (f :∘: g) ⇒ f (g a) → MonomorphicRep (f :∘: g) demoteComposed = demote ∘ Monomorphic ∘ Comp 135݄4༵ -
੍͚ͯΔײ͡ thEliminationIdeal :: ( IsMonomialOrder ord, Field k, IsPolynomial k
m , IsPolynomial k (m :-: n) , (n ≼ m) ~ True) ⇒ SNat n → Ideal (OrderedPolynomial k ord m) → Ideal (OrderedPolynomial k ord (m ⊖ n)) thEliminationIdeal n = case singInstance n of SingInstance → mapIdeal (changeOrderProxy Proxy) ∘ thEliminationIdealWith (weightedEliminationOrder n) n 135݄4༵ -
੍͚ͯΔײ͡ thEliminationIdeal :: ( IsMonomialOrder ord, Field k, IsPolynomial k
m , IsPolynomial k (m :-: n) , (n ≼ m) ~ True) ⇒ SNat n → Ideal (OrderedPolynomial k ord m) → Ideal (OrderedPolynomial k ord (m ⊖ n)) thEliminationIdeal n = case singInstance n of SingInstance → mapIdeal (changeOrderProxy Proxy) ∘ thEliminationIdealWith (weightedEliminationOrder n) n Gröbner جఈΛ͏ͱɺ࿈ཱํఔ͔ࣜΒจࣈΛফ ڈग़དྷΔʢ͍͢͝ʂʣ 135݄4༵ -
੍͚ͯΔײ͡ thEliminationIdeal :: ( IsMonomialOrder ord, Field k, IsPolynomial k
m , IsPolynomial k (m :-: n) , (n ≼ m) ~ True) ⇒ SNat n → Ideal (OrderedPolynomial k ord m) → Ideal (OrderedPolynomial k ord (m ⊖ n)) thEliminationIdeal n = case singInstance n of SingInstance → mapIdeal (changeOrderProxy Proxy) ∘ thEliminationIdealWith (weightedEliminationOrder n) n Gröbner جఈΛ͏ͱɺ࿈ཱํఔ͔ࣜΒจࣈΛফ ڈग़དྷΔʢ͍͢͝ʂʣ n จࣈ·ͰΛফڈ͍ͨ͠㱺 ม࠷Ͱ n ݸ 135݄4༵ -
ূ໌ͯ͠Δײ͡ intersection :: ∀ r k n ord. ( IsMonomialOrder
ord, Field r, IsPolynomial r k, IsPolynomial r n , IsPolynomial r (k ⊕ n) ) ⇒ Vector (Ideal (OrderedPolynomial r ord n)) k → Ideal (OrderedPolynomial r ord n) intersection Nil = Ideal $ singletonV one intersection idsv@(_ :- _) = let sk = sLengthV idsv sn = sing :: SNat n ts = genVars (sk %+ sn) tis = zipWith (λ ideal t → mapIdeal ((t *) . shiftR sk) ideal) (toList idsv) ts j = foldr appendIdeal (principalIdeal (one - foldr (+) zero ts)) tis in case plusMinusEqR sn sk of Eql → case propToBoolLeq (plusLeqL sk sn) of LeqTrueInstance → thEliminationIdeal sk j 135݄4༵ -
࠷ޙʹ͍͍͍ͨ͜ͱ ؼೲ๏ίετ͕͔͔Δ ূ໌࣮ߦ࣌ʹԆ͞ΕΔ͔Βλμ͡Όͳ͍ γϯάϧτϯίετ͕͔͔Δ Haskell ͰͷґଘܕͰ࣮༻తͳΞϓϦॻ͘ͷΉ͍ͣ HP ඪ४ఴͷ GHC 7.4.*
Ϋι ίϯύΠϧ͢Δʹ rm *.hi *.o ͠ͳ͍ͱܕػೳ͕ ͑ͳ͍ 135݄4༵ -
࠷ޙʹ͍͍͍ͨ͜ͱ ؼೲ๏ίετ͕͔͔Δ ূ໌࣮ߦ࣌ʹԆ͞ΕΔ͔Βλμ͡Όͳ͍ γϯάϧτϯίετ͕͔͔Δ Haskell ͰͷґଘܕͰ࣮༻తͳΞϓϦॻ͘ͷΉ͍ͣ HP ඪ४ఴͷ GHC 7.4.*
Ϋι ίϯύΠϧ͢Δʹ rm *.hi *.o ͠ͳ͍ͱܕػೳ͕ ͑ͳ͍ छଟ૬ͳ֎෦ϥΠϒϥϦͱϦϯΫग़དྷͳ͍ 135݄4༵ -
࠷ޙʹ͍͍͍ͨ͜ͱ ؼೲ๏ίετ͕͔͔Δ ূ໌࣮ߦ࣌ʹԆ͞ΕΔ͔Βλμ͡Όͳ͍ γϯάϧτϯίετ͕͔͔Δ Haskell ͰͷґଘܕͰ࣮༻తͳΞϓϦॻ͘ͷΉ͍ͣ HP ඪ४ఴͷ GHC 7.4.*
Ϋι ίϯύΠϧ͢Δʹ rm *.hi *.o ͠ͳ͍ͱܕػೳ͕ ͑ͳ͍ छଟ૬ͳ֎෦ϥΠϒϥϦͱϦϯΫग़དྷͳ͍ Ҋ֎ܕͷ⁋᧒͋͏ 135݄4༵ -
ࢀߟจݙ D. Cox, J. Little and D. O’Shea. Ideals, Varieties
and Algorithms. UTM. Springer. A. Giovini, T. Moran, G. Niesi, L. Robbiano and C. Traverse. "One sugar cube, please" OR Selection strategies in the Buchberger algorithm. ᑸݩ. άϨϒφʔجఈ໘ന͍ʂ. ߨٛ. 2012ૣҴాେֶجװཧֶ෦ֶՊֶC1 ߨٛࢿྉ 135݄4༵