Dataset Viewer
Auto-converted to Parquet Duplicate
id
string
record_type
string
title
string
content
string
source_section
string
verification_method
string
verification_status
string
artifact_paths
list
payload_json
string
theorem-01-thm-main
theorem
Principal results
\begin{theorem}[Principal results]\label{thm:main} Let $q>0$. \begin{enumerate} \item For any symmetric nonnegative matrix $C$ satisfying all $\T_q$ quartet inequalities and every nonnegative rectangular matrix $A$, the matrix $A^{\mathsf T}CA$ satisfies all quartet inequalities at the exact optimal universal parameter...
1
written_mathematical_proof
proved_in_manuscript_sections
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:main", "proof_included_in_record": false}
lemma-02-lem-basic
lemma
Monotonicity and rescaling
\begin{lemma}[Monotonicity and rescaling]\label{lem:basic} If a list is null at $q$, it is null at every $p\ge q$. Multiplying coefficients by $\lambda\prod_{i\in S}d_i$, for $\lambda,d_i>0$, preserves all strong and weak relations and their strictness. \end{lemma} \begin{proof} For monotonicity put $\theta=q/p\le1$ a...
2
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:basic", "proof_included_in_record": true}
lemma-03-lem-minkowski
lemma
Aggregation of triangles
\begin{lemma}[Aggregation of triangles]\label{lem:minkowski} Let $X_h,Y_h,Z_h\ge0$ satisfy all triangle inequalities for each $h$. Put $r=\max\{q,1\}$. Then \[ (\sum_hX_h^q)^{1/r},\quad (\sum_hY_h^q)^{1/r},\quad (\sum_hZ_h^q)^{1/r} \] satisfy all triangle inequalities. \end{lemma} \begin{proof} For $q\ge1$ this is ...
2
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:minkowski", "proof_included_in_record": true}
lemma-04-lem-snowflake
lemma
Square roots of metrics are Ptolemaic
\begin{lemma}[Square roots of metrics are Ptolemaic]\label{lem:snowflake} For every metric $D$ and four points, \begin{equation}\label{eq:snowflake} \sqrt{D_{13}D_{24}}\le \sqrt{D_{12}D_{34}}+\sqrt{D_{14}D_{23}}. \end{equation} \end{lemma} \begin{proof} Write the successive side distances as $a,b,c,e$, and the diago...
2
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:snowflake", "proof_included_in_record": true}
theorem-05-thm-congruence
theorem
Sharp nonnegative congruence
\begin{theorem}[Sharp nonnegative congruence]\label{thm:congruence} If $C\in\mathcal C_q$ and $A$ is any entrywise nonnegative rectangular matrix, then \[ A^{\mathsf T}CA\in\mathcal C_{\max(q,1)}. \] The parameter $\max\{q,1\}$ is optimal as a universal rule. In particular $\mathcal C_q$ is preserved by every nonnegat...
3
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:congruence", "proof_included_in_record": true}
lemma-06-lem-quadraticsupport
lemma
Support is automatic
\begin{lemma}[Support is automatic]\label{lem:quadraticsupport} The nonzero quadratic coefficient support of a matrix in $\mathcal C_q$ is M-convex. \end{lemma} \begin{proof} Delete zero rows. On the remaining indices define $i\sim j$ when $i=j$ or $C_{ij}=0$. Suppose $C_{ij}=C_{jk}=0$ but $C_{ik}>0$. Since row $j$ is...
3
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:quadraticsupport", "proof_included_in_record": true}
corollary-07-exact-quadratic-substitution-calculus
corollary
Exact quadratic substitution calculus
\begin{corollary}[Exact quadratic substitution calculus] Write $F(x)=\tfrac12x^{\mathsf T}Cx$ with normalized quadratic coefficient matrix $C\in\mathcal C_q$. For every nonnegative linear substitution $x=Ay$, the full normalized output matrix is exactly $A^{\mathsf T}CA$ and if nonzero, its weak and strong parameter is...
3
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "", "proof_included_in_record": true}
lemma-08-lem-uniform
lemma
Three exceptional bases
\begin{lemma}[Three exceptional bases]\label{lem:uniform} For $1<b<2$ and $0<e\le1/2$, set $a_U=b$, $a_{Z_1}=a_{Z_2}=e$, and $a_S=1$ on every other $d$-subset of an $n$-element ground set, $n\ge d+3$. For every $q>0$, the coefficient vector $c_S=a_S^q$ is strict strong over $\T_q$ on $U_{d,n}$. Every genuine root-polyg...
4
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:uniform", "proof_included_in_record": true}
theorem-09-thm-explicit
theorem
Explicit all-rank obstruction
\begin{theorem}[Explicit all-rank obstruction]\label{thm:explicit} For every $q>0$, define \begin{equation}\label{eq:parameters} T=2^q,\quad D=2^{-q}-4^{-q},\quad s=\frac{qD}{64(q+2)},\quad L=\frac{3D^2}{128(q+2)},\quad b=2-\frac{L}{16}. \end{equation} Use the root array of Lemma~\ref{lem:uniform} with $e=1/4$ and p...
4
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:explicit", "proof_included_in_record": true}
corollary-10-cor-robust
corollary
Explicit robustness independent of dimension
\begin{corollary}[Explicit robustness independent of dimension]\label{cor:robust} Let $c$ be \eqref{eq:explicit} and put $\eta=L/2048$. Every positive array $c'$ satisfying \[ 1-\eta\le(c'_S/c_S)^{1/q}\le1+\eta\qquad\text{for every }S \] is still strict strong and still fails after the same merge. Its normalized input...
4
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "cor:robust", "proof_included_in_record": true}
theorem-11-thm-repair
theorem
One-merge repair
\begin{theorem}[One-merge repair]\label{thm:repair} Let $c_S>0$ for every $d$-subset of $[n]$, and suppose $c$ is weak over $\T_q$. For $r=\max\{q,1\}$, the normalized coefficient function \eqref{eq:rho} of $D_{u,v}F$ is weak over $\T_{2r}$. If $d=2$, $\T_r$ suffices. Every larger output parameter also suffices. \end{t...
5
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:repair", "proof_included_in_record": true}
theorem-12-thm-zeros
theorem
Arbitrary matroid support
\begin{theorem}[Arbitrary matroid support]\label{thm:zeros} The normalized output of one merge of any weak $\T_q$ matroid coefficient array is weak over $\T_{2\max\{q,1\}}$. In degree two, $\T_{\max\{q,1\}}$ suffices, with strong output as well. \end{theorem} \begin{proof} The output support is M-convex by Lemma~\ref{...
5
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:zeros", "proof_included_in_record": true}
lemma-13-lem-det
lemma
Absolute-minor power certificate
\begin{lemma}\label{lem:det} For a real rank-$d$ matrix $A$ and any $q>0$, $c_S=|\det A_S|^q$ is strong over $\T_q$ on its column matroid. \end{lemma} \begin{proof} The signed determinant Pl\"ucker relation sums to zero. The absolute value of each term is at most the sum of the others by the ordinary triangle inequali...
6
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:det", "proof_included_in_record": true}
proposition-14-prop-lower
proposition
Necessary output parameter
\begin{proposition}[Necessary output parameter]\label{prop:lower} Any universal parameter $p$ for one merge in degree at least three, even restricted to positive uniform strong $\T_q$ inputs, must satisfy \begin{equation}\label{eq:lower} p\ge\max\{2,2(q-1)\}. \end{equation} Moreover, in each fixed degree $d\ge3$ and s...
6
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "prop:lower", "proof_included_in_record": true}
theorem-15-thm-d2
theorem
Exact degree-two answer
\begin{theorem}[Exact degree-two answer]\label{thm:d2} For degree-two matroid input, the infimal universal output parameter for one merge is \[ P_2(q)=\max\{q,1\}. \] The output is both weak and strong at this parameter. Consequently the same-parameter threshold in degree two is exactly $q_2=1$. \end{theorem} \begin{...
6
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:d2", "proof_included_in_record": true}
corollary-16-cor-cost
corollary
Two-sided aggregation law
\begin{corollary}[Two-sided aggregation law]\label{cor:cost} For $d\ge3,n\ge d+3$, \[ P^{\rm str}_{d,n}(q)\le P^{\rm w}_{d,n}(q)\le2\max\{q,1\}, \] \[ P^{\rm str}_{d,n}(q)\ge\max\{2,2(q-1)\}, \qquad P^{\rm str}_{d,n}(q)>q. \] In particular, \[ P^{\rm str}_{d,n}(q)=P^{\rm w}_{d,n}(q)=2\quad(0<q\le1), \] and \[ \lim...
6
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "cor:cost", "proof_included_in_record": true}
theorem-17-thm-minimal
theorem
Complete one-merge preservation classification
\begin{theorem}[Complete one-merge preservation classification]\label{thm:minimal} Fix $q>0$, rank $d\ge1$, and $n\ge\max(d,2)$, with a specified pair to be merged. Universal same-parameter preservation from strong input to strong full normalized output holds exactly in the regimes of Table~\ref{tab:threshold}. Replaci...
7
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:minimal", "proof_included_in_record": true}
theorem-18-thm-twopeak
theorem
Exact two-peak classification
\begin{theorem}[Exact two-peak classification]\label{thm:twopeak} Let $a,b\ge1$, define root coefficients $a_U=a$, $a_V=b$, and $a_S=1$ otherwise, and put $c_S=a_S^q$. Then \[ c\text{ is weak over }\T_q\quad\Longleftrightarrow\quad a\le2,\ b\le2, \] \[ c\text{ is strong over }\T_q\quad\Longleftrightarrow\quad a\le2,...
8
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:twopeak", "proof_included_in_record": true}
corollary-19-cor-weaklower
corollary
Sharper weak repair lower bound
\begin{corollary}[Sharper weak repair lower bound]\label{cor:weaklower} For every $d\ge3,n\ge d+3$, \[ P^{\rm w}_{d,n}(q)\ge \max\left\{2,\;2\log_2\frac{1+2^q}{2}\right\}. \] For strong inputs one also has \[ P^{\rm str}_{d,n}(q)\ge \log_2\frac{(1+2^q)(1+(3/2)^q)}4. \] \end{corollary} \begin{proof} Take $a=b=2$ fo...
8
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "cor:weaklower", "proof_included_in_record": true}
theorem-20-thm-twentyninths
theorem
A quantitative strong-input barrier at two
\begin{theorem}[A quantitative strong-input barrier at two]\label{thm:twentyninths} For every $d\ge3,n\ge d+3$, \[ P^{\rm str}_{d,n}(2)>\frac{20}{9}. \] \end{theorem} \begin{proof} Use the three exceptional bases $U=C\cup135$, $Z_1=C\cup126$, $Z_2=C\cup346$. Assign \[ c_U=3999,\quad c_{Z_1}=c_{Z_2}=1,\quad c_S=5000...
8
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:twentyninths", "proof_included_in_record": true}
theorem-21-thm-classification
theorem
Weighted set-map classification
\begin{theorem}[Weighted set-map classification]\label{thm:classification} The following are equivalent: \begin{enumerate} \item For every strong $\T_q$ rank-$d$ input, $A_{\phi,w}$ is zero or strong over $\T_q$. \item For every strong $\T_q$ rank-$d$ input, $A_{\phi,w}$ is zero or weak over $\T_q$. \item Either $\phi|...
9
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:classification", "proof_included_in_record": true}
corollary-22-a-guaranteed-rule-for-repeated-squarefree-merging
corollary
A guaranteed rule for repeated squarefree merging
\begin{corollary}[A guaranteed rule for repeated squarefree merging] Start with positive weak data on $U_{d,n}$. Perform $k$ binary identifications, taking the squarefree shadow after each, and assume the number of labels remains at least $d$. The resulting array is weak over $\T_p$ for \[ p=2^k\max\{q,1\}. \] For $d=...
9
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "", "proof_included_in_record": true}
theorem-23-thm-lorentz
theorem
Interior Lorentzian obstruction
\begin{theorem}[Interior Lorentzian obstruction]\label{thm:lorentz} Partition $[6]$ as $P=\{1,3\}$, $Q=\{2,4,6\}$, and $\{s\}=\{5\}$. For $t>1$ and $0<\delta<1$, put \[ a=3-\delta,\qquad h=4-t^{-2}-\delta. \] Assign the twenty cubic coefficients by the following exhaustive composition classes: \begin{center} \begin{ta...
10
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "thm:lorentz", "proof_included_in_record": true}
corollary-24-cor-lorentzbox
corollary
A robust four-level integer certificate
\begin{corollary}[A robust four-level integer certificate]\label{cor:lorentzbox} Take $t=2$, $\delta=1/4$, and multiply every coefficient by four. The six coefficient classes become \[ 11,\quad14,\quad4,\quad4,\quad8,\quad8. \] This Lorentzian array fails strong $\T_2$; moreover every coefficient perturbation of absol...
10
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "cor:lorentzbox", "proof_included_in_record": true}
lemma-25-lem-support
lemma
M-convex support under merging
\begin{lemma}\label{lem:support} The image of a matroid's basis indicators under one coordinate merge is M-convex. \end{lemma} \begin{proof} Let $\phi:E\to H$ merge $u,v$ into $z$, leaving other labels distinct. Define the integral monotone submodular function $f(A)=r_M(\phi^{-1}(A))$. Its basis images are exactly the...
A
written_mathematical_proof
proof_included
[ "paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex" ]
{"content_format": "latex", "latex_label": "lem:support", "proof_included_in_record": true}

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

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.

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:

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.
import json
payload = json.loads(examples[0]["payload_json"])
print(payload)

Reproduce the checks

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.
  • Petter Brändén and June Huh, Lorentzian polynomials, Annals of Mathematics 192 (2020), 821–891. Author-hosted paper.
  • Thomas Foertsch and Viktor Schroeder, Hyperbolicity, CAT(-1)-spaces and the Ptolemy inequality, arXiv:math/0605418v2. Paper.

Citation

@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.

Downloads last month
-

Paper for PureOne/Ilyoxune-Sharp-Hyperfield-Aggregation