Answers are grounded in this paper and cite their sources.
# **Author:** Zhang Xun **Status:** Preprint **Language:** Chinese (LaTeX, XeLaTeX) ## Overview This book develops the FBGT (Function Growth Branch Tree) axiomatic framework and its operator-topological extension, unifying cognitive topology, information geometry, transformation-group algebra, and computational complexity. It presents a geometric-algebraic proof that \(P ≠ NP\), a phase-transition symmetry picture of the Riemann Hypothesis within \(ZFC + supacg\), and a three-gate operator-topology account of complexity barriers. ## Structure - **Chapter 0** — Prologue and master outline: from dimensional collapse to operator judgment- **Chapter 1** — FBGT axioms and topological foundation- **Chapter 2** — Information geometry and differentiable structure- **Chapter 3** — Transformation groups and Lie-algebraic micro-engine- **Chapter 4** — Cognitive loops and logical algorithms- **Chapter 5** — Topological and group-theoretic proof of \(P ≠ NP\)- **Chapter 6** — Metamathematical provenance and cognitive uncertainty- **Chapter 7** — The three gates of operator topology- **Chapter 8** — Riemann Hypothesis: phase-transition symmetry and metamathematical boundary- **Appendix A** — Core algebraic corrections- **Appendix B** — Writing and derivation conventions- **Appendix C** — Open problems- **Correction A** — Exterior derivative–boundary duality and Cartan structure equations ## Compilation ```bashxelatex FBGT_preprint.texxelatex FBGT_preprint.tex Requires XeLaTeX with ctex, amsmath, amsthm, mathtools, hyperref, booktabs, enumitem. Scope and Honesty Statement All results are strictly confined to the stated axiom system. The Riemann Hypothesis result holds within ZFC+supacgZFC+supacg, not in classical ZFCZFC; the conservative-extension gap is recorded as open problem O6. No claim beyond the proved chains is made. License CCBY4.0 Knowledge belongs to all humanity. This work indicates only the directions explored and places reached by human mathematicians. Key wordFBGT (Function Growth Branch Tree); cognitive topology; information geometry; transformation-group algebra; Lie-algebraic micro-engine; reasoning step group (SAG); operator topology; topological rigidity; algorithmic rigidity; minimal incompressible section; intrinsic section measure; Tarski boundary; computational complexity; \(P≠ NP\); Riemann Hypothesis; phase-transition symmetry; metamathematical boundary; \(+\). FBGT(函数生长枝);认知拓扑;信息几何;变换群代数;李代数微观引擎;推理步骤群(SAG);算子拓扑;拓扑刚性;算法刚性;最小不可压缩截面;内蕴截面测度;塔斯基边界;计算复杂性;\(P≠ NP\);黎曼猜想;相变对称性;元数学边界;\(+\)。
No takes yet. Share an insight, caveat, or question.
xun zhang (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: