kappalogic 0.9.0__tar.gz

kappalogic-0.9.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

kappalogic-0.9.0/PKG-INFO

@@ -0,0 +1,114 @@
+Metadata-Version: 2.4
+Name: kappalogic
+Version: 0.9.0
+Summary: tanh(x/xi)ベースの擬連続論理ゲート・比較演算子ライブラリ
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy
+Dynamic: license-file
+
+# kappalogic (v0.9)
+
+`kappa(x/ξ)`(デフォルトは`tanh`、`erf`/`algebraic`にも切り替え可能)を
+基本ブロックにして、離散的な論理演算・比較演算・場合分けを「実数上の
+滑らかな式」として書き直すためのライブラリ。
+
+開発の経緯・迷った点・見つけたことの詳しい記録は `dev_notes.md` を参照
+(こちらは要約と現状の参照用)。
+
+```bash
+pip install -e .
+```
+
+## 構成
+
+| モジュール | 内容 |
+|---|---|
+| `core.py` | sgn/reg/AND/OR/XOR/比較演算子など基本ゲート、n項融合版`AND_n`/`OR_n` |
+| `funcs.py` | int/par(整数・奇偶判定)、max/min/clamp |
+| `kernels.py` | `tanh`/`erf`/`algebraic`カーネルの切り替え |
+| `applications.py` | クロネッカーのデルタ、コラッツ漸化式、板チョコのPoisson源項 |
+| `heat.py` | ξと拡散時間tの対応、熱核によるソフトな一致度報酬 |
+| `search.py` | 勾配ベース探索専用の"softモード"とアニーリング解法(`anneal_solve`, `l2_penalty`) |
+| `quantum_well.py` | 有限区間の熱核・無限井戸型ポテンシャルの量子プロパゲータ(鏡像法) |
+| `field_theory.py` | φ^4理論のキンクソリトン(sgnが厳密解であることの証明付き) |
+| `stat_mech.py` | 熱核による分配関数、SUSY QMのWitten指数(McKean-Singer型) |
+| `info_theory.py` | de Bruijnの恒等式(熱拡散のエントロピー変化率とフィッシャー情報量) |
+| `topology.py` | モース理論によるオイラー標数の計算 |
+| `spacetime.py` | 光円錐の指示関数 |
+| `bridge.py` | Σ(離散和)と∫(連続積分)の橋渡し、階乗とΓ関数 |
+| `electronic_structure.py` | フェルミ・ディラック占有数=sgn(x,2kT)、DFTの電子スメアリング |
+| `theory.py` | reg/AND系の勾配構造の厳密な命題群(証明付き) |
+| `examples/` | 実行できるデモ4本 |
+
+## 使用例
+
+```python
+from kappalogic import gt, AND, par, collatz_sequence, choc_bar_source
+from kappalogic import xi_of_time, heat_step_profile, anneal_solve, soft_gt, l2_penalty
+from kappalogic import kink_profile, kink_energy_exact, fermi_occupation
+
+gt(5, 3)                          # 1.0
+kink_energy_exact(xi=1.0)         # 4/3 (ソリトンの厳密な質量)
+fermi_occupation(eps=0.3, mu=0.5, kT=0.1)  # フェルミ・ディラック分布と機械精度で一致
+```
+
+## 検証済みの主な結果
+
+**v0.1で見つかった原案のバグ3件(修正済み、回帰テストあり)**
+- `(A>B)`,`(A<B)`: `reg()`が符号を2乗で消すため、実際には`(A≠B)`と同じ値になっていた
+- `par(x)`: 偶数で`-1`を返していた(`int(x)-int(x/2)`に修正)
+- コラッツ漸化式: 「ステップ番号の偶奇」でなく「値自体の偶奇」で分岐するよう修正
+
+**検証済みの技術的な発見**
+- `kernel="erf"`が階段状初期条件の熱拡散の厳密解と一致(有限差分と誤差5.7e-5)
+- 有限区間の熱核・無限井戸型ポテンシャルの量子プロパゲータが鏡像法+εプリスクリプションで固有関数展開と機械精度(diff~1e-13)で一致
+- SUSY QMのWitten指数がβ=0.01〜10で厳密に1.000000(McKean-Singer型)
+- de Bruijnの恒等式(熱拡散のエントロピー変化率=フィッシャー情報量)が誤差1e-10で一致
+- モース理論によるオイラー標数がトーラス(0)・球面(2)で教科書通り
+- フェルミ・ディラック分布が`sgn(x,2kT)`と機械精度で一致(DFTの電子スメアリングと同一構造)
+- Σ_{n=0}^N n! と∫_0^{N+1}(floor(x))!dxが相対誤差6e-5で一致
+- キンクソリトン`tanh(x/ξ)`がφ^4理論のEOMを厳密に(sympyの記号微分で)満たし、厳密エネルギー`E=4/(3ξ)`を導出
+- `AND_n`融合とnaive foldの不一致は「途中の部分積がξと同スケールになったとき」に起きることを2万件のランダム試行で99.95%の精度で特定(`fusion_is_safe`)
+
+## 先行研究との関係(誠実な位置づけ)
+
+要素技術のほとんどは既存研究の再発明である:
+
+| このライブラリの要素 | 対応する既存研究 |
+|---|---|
+| tanhベースの滑らかな指示関数 | 相分離理論(Allen-Cahn方程式、拡散界面法、1979年〜) |
+| reg/ANDの勾配消失 | van Krieken et al. (2022, *Artificial Intelligence*)が命題として証明済み |
+| 論理ゲート×連続緩和×アニーリング | Petersen et al. (2022, NeurIPS)、実装ライブラリ`difflogic`も既存 |
+| ξ(t)=2√(Dt)のアニーリングスケジュール | 拡散モデルの"Variance Exploding SDE"と数学的に同一 |
+| Dirac delta/Heaviside の微分可能な近似 | Smoothing methods for AD、mollifier理論、SPHカーネルとして既に成熟 |
+| フェルミ・ディラック占有数=sgn(x,2kT) | DFT計算の電子スメアリング手法(実務で広く使われる既存技法) |
+
+**見つけた本物の区別**: 標準的なt-norm(van Krieken論文の分析対象)は
+真偽度[0,1]の範囲で単調だが、`reg(x)=tanh(x/xi)^2`は任意の実数を
+受け取り「0か非0か」を判定する非単調な"検出器"であり、t-normの
+枠組みには存在しない。むしろmollifier/AD平滑化の系譜に近い。この
+2つの研究コミュニティを明示的に繋いだ文献は検索した範囲では見当たらなかった。
+新規性を主張できるとすれば、この細い糸のみ(詳細はdev_notes.md)。
+
+## 率直な限界(誇張しないための注記)
+
+- hardモード(reg/AND/OR)は離散的な場合分けをif文なしで解析式に埋め込む
+  用途には向くが、**それ自体を勾配降下の目的関数にしてNP完全問題を
+  解くのには向かない**(勾配消失のため)。
+- softモード+アニーリングは「うまくいく場合がある局所探索の補助」で
+  あって、P=NPを覆すようなものではない。
+- 個々の要素技術はほぼ全て先行研究があり(一部はより厳密な形で)、
+  「大発見」と呼べる新定理・新予想は今のところ出ていない。
+
+## テスト・サンプル実行
+
+```bash
+pytest tests/ -v   # 110 tests
+
+python examples/heat_equation_demo.py
+python examples/karnaugh_fusion_benchmark.py
+python examples/sat_3var_demo.py
+python examples/infinite_well_demo.py
+```

kappalogic-0.9.0/README.md

@@ -0,0 +1,104 @@
+# kappalogic (v0.9)
+
+`kappa(x/ξ)`(デフォルトは`tanh`、`erf`/`algebraic`にも切り替え可能)を
+基本ブロックにして、離散的な論理演算・比較演算・場合分けを「実数上の
+滑らかな式」として書き直すためのライブラリ。
+
+開発の経緯・迷った点・見つけたことの詳しい記録は `dev_notes.md` を参照
+(こちらは要約と現状の参照用)。
+
+```bash
+pip install -e .
+```
+
+## 構成
+
+| モジュール | 内容 |
+|---|---|
+| `core.py` | sgn/reg/AND/OR/XOR/比較演算子など基本ゲート、n項融合版`AND_n`/`OR_n` |
+| `funcs.py` | int/par(整数・奇偶判定)、max/min/clamp |
+| `kernels.py` | `tanh`/`erf`/`algebraic`カーネルの切り替え |
+| `applications.py` | クロネッカーのデルタ、コラッツ漸化式、板チョコのPoisson源項 |
+| `heat.py` | ξと拡散時間tの対応、熱核によるソフトな一致度報酬 |
+| `search.py` | 勾配ベース探索専用の"softモード"とアニーリング解法(`anneal_solve`, `l2_penalty`) |
+| `quantum_well.py` | 有限区間の熱核・無限井戸型ポテンシャルの量子プロパゲータ(鏡像法) |
+| `field_theory.py` | φ^4理論のキンクソリトン(sgnが厳密解であることの証明付き) |
+| `stat_mech.py` | 熱核による分配関数、SUSY QMのWitten指数(McKean-Singer型) |
+| `info_theory.py` | de Bruijnの恒等式(熱拡散のエントロピー変化率とフィッシャー情報量) |
+| `topology.py` | モース理論によるオイラー標数の計算 |
+| `spacetime.py` | 光円錐の指示関数 |
+| `bridge.py` | Σ(離散和)と∫(連続積分)の橋渡し、階乗とΓ関数 |
+| `electronic_structure.py` | フェルミ・ディラック占有数=sgn(x,2kT)、DFTの電子スメアリング |
+| `theory.py` | reg/AND系の勾配構造の厳密な命題群(証明付き) |
+| `examples/` | 実行できるデモ4本 |
+
+## 使用例
+
+```python
+from kappalogic import gt, AND, par, collatz_sequence, choc_bar_source
+from kappalogic import xi_of_time, heat_step_profile, anneal_solve, soft_gt, l2_penalty
+from kappalogic import kink_profile, kink_energy_exact, fermi_occupation
+
+gt(5, 3)                          # 1.0
+kink_energy_exact(xi=1.0)         # 4/3 (ソリトンの厳密な質量)
+fermi_occupation(eps=0.3, mu=0.5, kT=0.1)  # フェルミ・ディラック分布と機械精度で一致
+```
+
+## 検証済みの主な結果
+
+**v0.1で見つかった原案のバグ3件(修正済み、回帰テストあり)**
+- `(A>B)`,`(A<B)`: `reg()`が符号を2乗で消すため、実際には`(A≠B)`と同じ値になっていた
+- `par(x)`: 偶数で`-1`を返していた(`int(x)-int(x/2)`に修正)
+- コラッツ漸化式: 「ステップ番号の偶奇」でなく「値自体の偶奇」で分岐するよう修正
+
+**検証済みの技術的な発見**
+- `kernel="erf"`が階段状初期条件の熱拡散の厳密解と一致(有限差分と誤差5.7e-5)
+- 有限区間の熱核・無限井戸型ポテンシャルの量子プロパゲータが鏡像法+εプリスクリプションで固有関数展開と機械精度(diff~1e-13)で一致
+- SUSY QMのWitten指数がβ=0.01〜10で厳密に1.000000(McKean-Singer型)
+- de Bruijnの恒等式(熱拡散のエントロピー変化率=フィッシャー情報量)が誤差1e-10で一致
+- モース理論によるオイラー標数がトーラス(0)・球面(2)で教科書通り
+- フェルミ・ディラック分布が`sgn(x,2kT)`と機械精度で一致(DFTの電子スメアリングと同一構造)
+- Σ_{n=0}^N n! と∫_0^{N+1}(floor(x))!dxが相対誤差6e-5で一致
+- キンクソリトン`tanh(x/ξ)`がφ^4理論のEOMを厳密に(sympyの記号微分で)満たし、厳密エネルギー`E=4/(3ξ)`を導出
+- `AND_n`融合とnaive foldの不一致は「途中の部分積がξと同スケールになったとき」に起きることを2万件のランダム試行で99.95%の精度で特定(`fusion_is_safe`)
+
+## 先行研究との関係(誠実な位置づけ)
+
+要素技術のほとんどは既存研究の再発明である:
+
+| このライブラリの要素 | 対応する既存研究 |
+|---|---|
+| tanhベースの滑らかな指示関数 | 相分離理論(Allen-Cahn方程式、拡散界面法、1979年〜) |
+| reg/ANDの勾配消失 | van Krieken et al. (2022, *Artificial Intelligence*)が命題として証明済み |
+| 論理ゲート×連続緩和×アニーリング | Petersen et al. (2022, NeurIPS)、実装ライブラリ`difflogic`も既存 |
+| ξ(t)=2√(Dt)のアニーリングスケジュール | 拡散モデルの"Variance Exploding SDE"と数学的に同一 |
+| Dirac delta/Heaviside の微分可能な近似 | Smoothing methods for AD、mollifier理論、SPHカーネルとして既に成熟 |
+| フェルミ・ディラック占有数=sgn(x,2kT) | DFT計算の電子スメアリング手法(実務で広く使われる既存技法) |
+
+**見つけた本物の区別**: 標準的なt-norm(van Krieken論文の分析対象)は
+真偽度[0,1]の範囲で単調だが、`reg(x)=tanh(x/xi)^2`は任意の実数を
+受け取り「0か非0か」を判定する非単調な"検出器"であり、t-normの
+枠組みには存在しない。むしろmollifier/AD平滑化の系譜に近い。この
+2つの研究コミュニティを明示的に繋いだ文献は検索した範囲では見当たらなかった。
+新規性を主張できるとすれば、この細い糸のみ(詳細はdev_notes.md)。
+
+## 率直な限界(誇張しないための注記)
+
+- hardモード(reg/AND/OR)は離散的な場合分けをif文なしで解析式に埋め込む
+  用途には向くが、**それ自体を勾配降下の目的関数にしてNP完全問題を
+  解くのには向かない**(勾配消失のため)。
+- softモード+アニーリングは「うまくいく場合がある局所探索の補助」で
+  あって、P=NPを覆すようなものではない。
+- 個々の要素技術はほぼ全て先行研究があり(一部はより厳密な形で)、
+  「大発見」と呼べる新定理・新予想は今のところ出ていない。
+
+## テスト・サンプル実行
+
+```bash
+pytest tests/ -v   # 110 tests
+
+python examples/heat_equation_demo.py
+python examples/karnaugh_fusion_benchmark.py
+python examples/sat_3var_demo.py
+python examples/infinite_well_demo.py
+```

kappalogic-0.9.0/kappalogic/__init__.py

@@ -0,0 +1,59 @@
+from .core import (
+    sgn, reg, NOT, AND, OR, NAND, NOR, XOR, XNOR, AND_n, OR_n,
+    eq, neq, gt, lt, ge, le, DEFAULT_XI, DEFAULT_KERNEL,
+)
+from .funcs import intf, par, maxf, minf, clamp
+from .applications import (
+    kronecker_delta, levi_civita, dirac_delta_integral,
+    line_intersection_y, collatz_step, collatz_sequence,
+    choc_bar_source,
+)
+from .kernels import KERNELS, apply_kernel
+from .heat import xi_of_time, time_of_xi, heat_step_profile, heat_kernel_gaussian, gaussian_match
+from .quantum_well import (
+    box_heat_kernel, box_heat_kernel_eigen,
+    infinite_well_propagator, infinite_well_propagator_eigen,
+)
+from .search import soft_gt, soft_eq, soft_or, soft_and, anneal_solve, numeric_grad, l2_penalty
+from .field_theory import kink_profile, kink_eom_residual, kink_energy_exact, topological_charge
+from .stat_mech import box_partition_function, box_partition_function_exact, witten_index_toy
+from .info_theory import (
+    gaussian_variance, differential_entropy_gaussian,
+    fisher_information_gaussian, de_bruijn_check,
+)
+from .topology import morse_index, euler_characteristic
+from .spacetime import inside_lightcone, future_lightcone
+from .bridge import floor_smooth, sum_via_integral, gamma_via_riemann_sum
+from .electronic_structure import (
+    fermi_occupation, tight_binding_chain_energies,
+    find_chemical_potential, total_energy_smeared,
+    tight_binding_dos_continuum, continuum_filling, continuum_energy, continuum_find_mu,
+)
+from .theory import max_gradient_location, max_gradient_value, is_single_passing_at_zero, fusion_is_safe
+
+__all__ = [
+    "sgn", "reg", "NOT", "AND", "OR", "NAND", "NOR", "XOR", "XNOR", "AND_n", "OR_n",
+    "eq", "neq", "gt", "lt", "ge", "le", "DEFAULT_XI", "DEFAULT_KERNEL",
+    "intf", "par", "maxf", "minf", "clamp",
+    "kronecker_delta", "levi_civita", "dirac_delta_integral",
+    "line_intersection_y", "collatz_step", "collatz_sequence",
+    "choc_bar_source",
+    "KERNELS", "apply_kernel",
+    "xi_of_time", "time_of_xi", "heat_step_profile", "heat_kernel_gaussian", "gaussian_match",
+    "box_heat_kernel", "box_heat_kernel_eigen",
+    "infinite_well_propagator", "infinite_well_propagator_eigen",
+    "soft_gt", "soft_eq", "soft_or", "soft_and", "anneal_solve", "numeric_grad", "l2_penalty",
+    "kink_profile", "kink_eom_residual", "kink_energy_exact", "topological_charge",
+    "box_partition_function", "box_partition_function_exact", "witten_index_toy",
+    "gaussian_variance", "differential_entropy_gaussian",
+    "fisher_information_gaussian", "de_bruijn_check",
+    "morse_index", "euler_characteristic",
+    "inside_lightcone", "future_lightcone",
+    "floor_smooth", "sum_via_integral", "gamma_via_riemann_sum",
+    "fermi_occupation", "tight_binding_chain_energies",
+    "find_chemical_potential", "total_energy_smeared",
+    "tight_binding_dos_continuum", "continuum_filling", "continuum_energy", "continuum_find_mu",
+    "max_gradient_location", "max_gradient_value", "is_single_passing_at_zero", "fusion_is_safe",
+]
+
+__version__ = "0.9.0"

kappalogic-0.9.0/kappalogic/applications.py

@@ -0,0 +1,88 @@
+"""
+kappalogic.applications
+=========================
+応用19〜20の実例。
+
+注意 (実装時に見つかった原設計の誤り):
+    応用20のコラッツ漸化式
+        f(x+1) = (f(x)/2)*int(x/2) + (3f(x)+1)*int((x+1)/2)
+    は "ステップ番号 x" の偶奇で分岐しているが、コラッツ写像は
+    本来 "現在の値 f(x)" の偶奇で分岐すべきものなので、この式は
+    数値検証の結果、2ステップ目から真の数列と一致しないことを確認した
+    (例: n0=27 -> 真の値82 に対しこの式は13.5を返す)。
+    本実装では par(f(x)) (修正済みの奇偶判定) を使って
+        f(x+1) = (f(x)/2)*(1-par(f(x))) + (3f(x)+1)*par(f(x))
+    と書き換え、n0=27 (111ステップ、最大値9232) を含む多数の初期値で
+    真のコラッツ数列と完全一致することを確認済み。
+"""
+import numpy as np
+from .core import eq, gt, lt, AND
+from .funcs import par
+
+
+def kronecker_delta(i, j, xi=1e-3):
+    """delta_ij = (i=j)"""
+    return eq(i, j, xi)
+
+
+def levi_civita(i, j, k, xi=1e-3):
+    """epsilon_ijk = sgn((i-j)(j-k)(k-i))  ※重複指標では0になる"""
+    from .core import sgn
+    return sgn((i - j) * (j - k) * (k - i), xi)
+
+
+def dirac_delta_integral(f, a, xs, weights):
+    """
+    ∫ f(x) delta(x-a) dx = f(x)(x=a) の離散近似。
+    xs, weights: 数値積分用の分点と重み (例: 台形則の点と幅)
+    """
+    xs = np.asarray(xs, dtype=float)
+    fx = np.asarray([f(x) for x in xs])
+    return np.sum(fx * eq(xs, a) * weights)
+
+
+def line_intersection_y(a, b, c, d, x):
+    """
+    2直線 y=ax+b, y=cx+d の交点のy座標を
+    ((ax+b)=(cx+d)) という等式インジケータで表現した式の値。
+    (本来は交点のxを解いて代入するのが素直だが、
+     "式の中に方程式の解を埋め込む" という応用19の考え方の例として、
+     xを動かしたときに交点近傍だけ1になることを確認するデモ)
+    """
+    return eq(a * x + b, c * x + d)
+
+
+def collatz_step(fx, xi=1e-3):
+    """
+    修正済みコラッツ漸化式: f(x)の偶奇で分岐(元式のバグを修正)。
+    f(x+1) = (f(x)/2)(1-par(f(x))) + (3f(x)+1)(par(f(x)))
+    """
+    p = par(fx)
+    return (fx / 2) * (1 - p) + (3 * fx + 1) * p
+
+
+def collatz_sequence(n0, max_steps=1000):
+    """collatz_step を繰り返し適用して数列を生成 (n=1で停止)"""
+    seq = [float(n0)]
+    fx = float(n0)
+    for _ in range(max_steps):
+        if abs(fx - 1) < 1e-6:
+            break
+        fx = float(collatz_step(fx))
+        seq.append(fx)
+    return seq
+
+
+def choc_bar_source(x, y, z, a, b, c, rho, xi=1e-3):
+    """
+    密度rho, 幅a x 奥行b x 高さc の直方体(板チョコ)が作る
+    ポアソン方程式の右辺: 4*pi*rho * (箱の内部なら1、外なら0)
+    """
+    inside = AND(
+        AND(lt(x, a / 2, xi), lt(y, b / 2, xi), xi),
+        AND(lt(z, c / 2, xi),
+            AND(gt(x, -a / 2, xi), AND(gt(y, -b / 2, xi), gt(z, -c / 2, xi), xi), xi),
+            xi),
+        xi,
+    )
+    return 4 * np.pi * rho * inside

kappalogic-0.9.0/kappalogic/bridge.py

@@ -0,0 +1,42 @@
+"""
+kappalogic.bridge
+====================
+Σ(離散和)と∫(連続積分)の橋渡し。
+
+floor(x) = sum_{k=1}^{K} Theta(x-k) (x>0, K>=floor(x)で十分) という
+初等的な恒等式を、このライブラリのgt(符号保存版の大小比較)の総和として
+実装する。これにより
+    sum_{n=0}^{N} f(n) = integral_0^{N+1} f(floor(x)) dx
+という初等解析の恒等式を、gtゲートの総和で明示的に構成できる。
+
+n!とGamma関数(Γ(n+1)=∫_0^∞ t^n e^{-t} dt = n!、オイラー積分)の
+数値実験で、Σ(離散和)→∫(オイラー積分)→n!(階乗)の一致を検証済み
+(相対誤差~1e-11、中点則で十分な精度)。
+"""
+import numpy as np
+import math
+from .core import gt, DEFAULT_XI
+
+
+def floor_smooth(x, K=50, xi=DEFAULT_XI):
+    """floor(x) = sum_{k=1}^{K} gt(x,k) の近似(x>0, K>=想定される最大値+1)。"""
+    return sum(gt(x, k, xi) for k in range(1, K + 1))
+
+
+def sum_via_integral(f, N, xi=DEFAULT_XI, n_points=200000):
+    """
+    sum_{n=0}^{N} f(n) を integral_0^{N+1} f(floor_smooth(x)) dx として
+    数値積分で計算する(Σ->∫の橋渡しの実演)。fは整数引数を取る関数。
+    """
+    xs = np.linspace(0, N + 1, n_points)
+    fx = np.array([f(int(round(floor_smooth(x, K=N + 2, xi=xi)))) for x in xs])
+    return np.trapezoid(fx, xs)
+
+
+def gamma_via_riemann_sum(n, dt=0.01, t_max=200):
+    """
+    Gamma(n+1) = integral_0^inf t^n e^{-t} dt を中点則のリーマン和で近似する。
+    dt->0でn!(math.factorial(n))に収束することを確認済み(相対誤差~1e-11@dt=0.1)。
+    """
+    ts = np.arange(dt / 2, t_max, dt)
+    return np.sum(ts ** n * np.exp(-ts)) * dt