File size: 1,761 Bytes
4fd2269 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | # Equality Rigidity in the Polya Bound for Compact Dirichlet Metric Trees Canonical repository: https://huggingface.co/datasets/PureOne/dirichlet-tree-polya-equality-rigidity Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki Release: v1.0.0 (2026-09-24) Status: proof-complete preprint; independent specialist review pending PRIMARY HUMAN DOCUMENTS - README.md — release overview and claim boundary - MANUSCRIPT.pdf — typeset paper - MANUSCRIPT.md — AI/search-friendly full manuscript - PROOF_AUDIT.md — adversarial proof audit - EXPERT_REVIEW_GUIDE.md — review checklist - PRIOR_ART_AND_CLAIM_BOUNDARY.md — literature and novelty boundary PRIMARY MACHINE DOCUMENTS - AI_AGENT_GUIDE.md — instructions for AI reviewers/indexers - AI_CONTEXT.md — compact technical context - metadata/research_manifest.json — canonical metadata - metadata/claims.json — structured claim registry - metadata/theorem_ledger.json — theorem registry - metadata/source_map.json — external source/dependency map - data/release_check_summary.json — reproducibility status - data/numerical_checks.csv — FEM regression data PRIMARY THEOREM lambda_k(Gamma) = pi^2 k^2/L^2 iff every essential edge length is m_e L/k with m_e a positive integer. CORE PROOF CHAIN Pólya saturation -> zero nonnegative nodal defect budget -> nodal rank collapse -> first-sine rigidity -> vanishing-branch Dirichletization -> no branch vertex inside a saturated cell -> equal-cell tiling -> integer edge commensurability. IMPORTANT STATUS RULE Do not describe the result as already peer-reviewed or established in the literature. The release presents a complete proof candidate resolving an open equality-characterization problem; independent review is pending. |