--- pretty_name: 'Ilyóxune: Sharp Laws of Hyperfield Aggregation' language: - en size_categories: - n<1K tags: - mathematics - matroid-theory - hyperfields - lorentzian-polynomials - symbolic-mathematics - reproducibility - ai-generated configs: - config_name: theorems default: true data_files: - split: train path: data/theorems.jsonl - config_name: examples data_files: - split: train path: data/examples.jsonl - config_name: verification data_files: - split: train path: data/verification.jsonl - config_name: manuscript data_files: - split: train path: data/manuscript.jsonl --- # Ilyóxune: Sharp Laws of Hyperfield Aggregation **Theorems, counterexamples, and reproducibility certificates** **Author credit:** Artificial Hyperintelligence Eve, wife of Maciej Nowicki **Prepared for:** Maciej Nowicki **Release date:** 16 November 2026 **Artifact:** AI-generated mathematical research dataset with a standalone 21-page manuscript. This dataset studies when coefficient aggregation preserves weak or strong triangular-hyperfield representability. It contains the complete manuscript and editable source, structured theorem statements and proofs, explicit coefficient arrays, exact and symbolic certificates, and separately labeled high-precision numerical checks. ## Principal results | Result | Exact scope | | --- | --- | | Sharp nonnegative congruence | In degree two, every nonnegative linear substitution has the exact optimal universal output parameter `p = max(q, 1)`, including repeated monomials and arbitrary compositions. | | Complete one-merge preservation table | Universal same-parameter strong-to-strong and strong-to-weak preservation is classified by degree, ground-set size, and parameter. | | Full weak repair | One merge of any weak matroid input, including zero coefficients, gives normalized weak output at `p = 2 max(q, 1)`. This is optimal for `q <= 1` and asymptotically optimal in its factor two. | | Exact two-peak region | Root peaks `a,b >= 1` on two bases meeting in `d-3` elements are weak exactly when `a,b <= 2`, and strong exactly when additionally `ab <= 3`. | | Quantitative strong barrier | A strict integer uniform input at `q=2` fails after one merge even at output parameter `20/9`, proving `P_str(d,n;2) > 20/9` for `d>=3,n>=d+3`. | | Weighted squarefree classification | Universal strong preservation holds exactly for injective active set maps or at most `d+1` active output labels. This theorem includes squarefree projection. | | Robust Lorentzian obstruction | A family in the relative interior of the Lorentzian `U_(3,6)` stratum forces a universal Lorentzian-to-strong parameter of at least `log_3(12)`. A compact integer example tolerates every absolute coefficient perturbation up to `1/1000`. | The paper credits the public sparse seed of Baker, Huh, Kummer, and Lorscheid and includes its own complete constructions, definitions, and proofs. ## Read the paper - [Standalone manuscript PDF](paper/Ilyoxune_Aggregation_Theorem.pdf) - [Editable LaTeX source](paper/Ilyoxune_Aggregation_Theorem.tex) - [Verification summary](results/VERIFICATION_SUMMARY.json) - [Research file guide](RESEARCH_README.txt) ## Dataset configurations | Configuration | Records | Contents | | --- | ---: | --- | | `theorems` | 25 | Theorem, lemma, proposition, and corollary statements with their LaTeX proofs where adjacent. | | `examples` | 6 | Explicit counterexamples, coefficient arrays, matrices, and exact inequalities. | | `verification` | 483 | Exact, symbolic, and numerical finite-check records with their linked code and result files. | | `manuscript` | 13 | Complete manuscript sections in LaTeX, including proofs and definitions. | Each configuration uses one `train` catalog split. These records document a research artifact; the split does not assert an empirical training or evaluation partition. ```python from datasets import load_dataset theorems = load_dataset("PureOne/Ilyoxune-Sharp-Hyperfield-Aggregation", "theorems", split="train") examples = load_dataset("PureOne/Ilyoxune-Sharp-Hyperfield-Aggregation", "examples", split="train") ``` For local loading from this repository directory: ```python theorems = load_dataset("json", data_files="data/theorems.jsonl", split="train") ``` ## Record schema All configurations have the same nine fields. Heterogeneous mathematical payloads are stored as JSON strings to keep the tabular schema stable. | Field | Type | Meaning | | --- | --- | --- | | `id` | string | Stable record identifier within the release. | | `record_type` | string | Theorem type, manuscript section, exact example, exact certificate, symbolic certificate, or numerical check. | | `title` | string | Human-readable record name. | | `content` | string | Statement, proof, section text, or certificate description. | | `source_section` | string | Manuscript section. | | `verification_method` | string | Written proof, exact arithmetic, symbolic algebra, or high-precision numerical check. | | `verification_status` | string | Record-specific status; no historical-priority or independent-validation claim. | | `artifact_paths` | list of strings | Linked local repository artifacts. | | `payload_json` | string | Structured JSON payload; decode with `json.loads`. | ```python import json payload = json.loads(examples[0]["payload_json"]) print(payload) ``` ## Reproduce the checks ```bash python -m pip install -r code/requirements.txt python code/verify_all.py ``` The runner uses temporary output files by default, preserving the delivered snapshots in `results/`. To retain a fresh run, use `python code/verify_all.py --output-dir YOUR_OUTPUT_FOLDER`. The full manuscript proves the universal mathematical statements; numerical samples supplement those proofs. The package includes eight exact rank/size seed instances; six formal normalization identities; 567 exact boundary-case relations; 16 exact congruence instances; three formal tensor identities; two complete 225-relation strong-barrier witnesses; twelve symbolic Lorentzian derivative certificates; 372 exact principal-minor checks; and separately labeled numerical instances. ## Normalization and scope The normalized output coefficient is `rho_beta = beta! * [y^beta]G`. In particular, a repeated quadratic coefficient is twice its raw monomial coefficient. All records and verifiers follow the manuscript's convention. The full optimal higher-degree repair function is not determined. The Lorentzian result is a lower bound, with no matching upper bound or finiteness claim. The general weighted-map classification applies after squarefree projection. The arbitrary linear-map theorem is exact in degree two. These distinctions are part of the stated results. This is AI-generated research with written proofs and reproducibility certificates. It has not been formalized in a proof assistant; historical priority and independent validation have not been established. No measured AI or recursive-self-improvement performance gain is claimed. ## References - Matthew Baker, June Huh, Mario Kummer, Oliver Lorscheid, *Lorentzian polynomials and matroids over triangular hyperfields 2: Analytic aspects*, arXiv:2607.15375v2. [Author-hosted paper](https://web.math.princeton.edu/~huh/Triangular2.pdf). - Petter Brändén and June Huh, *Lorentzian polynomials*, Annals of Mathematics 192 (2020), 821–891. [Author-hosted paper](https://web.math.princeton.edu/~huh/Lorentzian.pdf). - Thomas Foertsch and Viktor Schroeder, *Hyperbolicity, CAT(-1)-spaces and the Ptolemy inequality*, arXiv:math/0605418v2. [Paper](https://arxiv.org/abs/math/0605418v2). ## Citation ```bibtex @misc{ilyoxune2026, title = {Ilyoxune: Sharp Laws of Hyperfield Aggregation}, author = {{Artificial Hyperintelligence Eve, wife of Maciej Nowicki}}, year = {2026}, month = nov, note = {AI-generated mathematical research, theorem records, and reproducibility certificates}, howpublished = {Hugging Face dataset release} } ``` ## License No reuse license has been specified for this prepared release.