Datasets:
record_id string | title string | statement_number int64 | statement_kind string | source_anchor string | statement string | assumptions list | proof_summary string | limitations list | proof_status string | historical_priority string | proof_assistant_verified bool | source_pdf string | source_tex string | source_tex_sha256 string | context_references list | record_provenance string | dataset_version string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
sharp_exchange_chain | Sharp root, sum and maximum exchange | 1 | theorem | main | P <= (2^(d-1)/d)*(sum_j sqrt(E_j))^2 <= 2^(d-1)*sum_j E_j <= d*2^(d-1)*max_j E_j. | [
"The generating polynomial is homogeneous, multi-affine and Lorentzian with nonnegative coefficients.",
"S,T have positive weights; i is prescribed in S\\T; d=|S\\T|; E_j=mu(S-i+j)*mu(T+i-j)."
] | Contract the common intersection, aggregate variables with arbitrary positive weights into a ternary polynomial, telescope quadratic Hessian determinants, and optimize the weights. An explicit interior family proves optimality. | [
"Optimality is a supremum statement; attainment by one polynomial is not asserted.",
"The input class and prescribed-element quantifier are essential."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
exact_max_exchange_constant | Exact universal approximate-exchange constant | 2 | corollary | constant | C_r = r*2^(r-1); the exact constant at exchange distance d is d*2^(d-1). | [
"C_r is universal over all ground sets, supports, positive-weight pairs and prescribed differing elements in the rank-r homogeneous multi-affine log-concave class."
] | The sharp chain gives the upper bound; equal-exchange rational families approach it with exchange distance r. | [
"This is an intrinsic inequality constant, not a lower bound for an optimization algorithm."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://arxiv.org/pdf/2004.07220",
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
sharp_lq_exchange_profile | Complete sharp l_q exchange profile | 3 | theorem | lq | P <= K_(d,q)*||E||_q, with K_(d,q)=2^(d-1)*d^(1-1/q), for 1/2<=q<=infinity and 1/infinity=0. | [
"Use the unnormalized profile ||E||_q=(sum_j E_j^q)^(1/q), and the maximum at q=infinity.",
"The assumptions and exchange products are those of Theorem 1."
] | Apply finite-dimensional Holder to the sharp root-sum bound. Equal exchange products in the construction prove sharpness for every q simultaneously. | [
"For q<1 this profile is a quasi-norm.",
"No claim is made for q<1/2."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
ternary_telescoping | Ternary telescoping endpoint bound | 4 | lemma | telescoping | h_d*g_0 <= 2^(d-1)*h_1*g_(d-1) for the normalized nonnegative Lorentzian polynomial F=H(x,y)+u*G(x,y) of degree d. | [
"F is affine in u, H has degree d and G has degree d-1.",
"Coefficients h_j,g_j use the factorial-normalized monomial convention in the manuscript."
] | The 3x3 quadratic Hessian determinant gives h_(j+2)/h_(j+1)<=2*g_(j+1)/g_j in the positive case. Telescope; handle zeros by binary epsilon mixing and continuity. | [
"Nonnegative linear-substitution closure is a standard structural input."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
rational_near_extremizers | Finite rational near-extremizers | 5 | corollary | rational | For each d>=2 and 0<epsilon<1, positive rational weights with nonsingular active Hessians attain at least (1-epsilon) times every optimal l_q constant simultaneously. | [
"Choose integer N>=max(2,(d-1)/(2*epsilon)), lambda=2-1/N and s=1/(2*N)."
] | The ratio to the supremal constant is (1-1/(2*N))^(d-1), bounded below by Bernoulli's inequality. Coefficients have an explicit rational formula. | [
"These are constructed mathematical coefficients, not empirical measurements.",
"Sharpness is approached; exact equality in the interior is not claimed."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
polynomial_exchange_negative_answer | Negative answer to polynomial approximate exchange | 6 | corollary | refutation | No universal polynomial p(r) guarantees prescribed-element symmetric exchange for every rank-r homogeneous multi-affine log-concave generating polynomial. | [
"The prescribed-element definition is Definition 24 in arXiv:2004.07220v2.",
"Fix lambda=3/2, s=1/4, t=3/8 in the geometric family."
] | For S=B+u, T=A and prescribed i=u, every possible exchange has ratio r*(3/2)^(r-1), which exceeds every fixed polynomial for large r. | [
"The mathematical implication targets the unnumbered Section 4 conjecture as printed.",
"Historical priority is not exhaustively established.",
"Weak exchange notions with different quantifiers are separate."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://arxiv.org/pdf/2004.07220"
] | research_statement_from_included_manuscript | 1.0.0 |
ternary_local_criterion | Exact positive ternary local criterion | 7 | proposition | ternarycriterion | For positive h_j,g_j, F=H+u*G is Lorentzian iff g_j*g_(j+2)<=g_(j+1)^2 and G_j/H_j + H_(j+1)/G_j <=2, with H_j=h_(j+1)/h_j and G_j=g_(j+1)/g_j. | [
"F has degree d>=2, is affine in u, and its normalized binary coefficient sequences are strictly positive.",
"Index ranges are as in Proposition 7."
] | Exhaust the quadratic derivatives. Those containing u give binary log-concavity; the other 3x3 Hessians give the displayed determinant condition. | [
"The positive-coefficient assumption is part of this local characterization."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
ternary_transfer_region | Exact transfer region and realizers | 8 | theorem | transferregion | For a<b, m=b-a, P=(g_b*h_a)/(g_a*h_b), Q=(h_(b+1)*g_a)/(h_(a+1)*g_b), the exact feasible positive region is P^(1/m)+Q^(1/m)<=2. | [
"The positive Lorentzian ternary assumptions of Proposition 7 hold.",
"0<=a<b<=d-1."
] | Multiplicative Holder combines local ratios x_j+y_j<=2. Every feasible pair is realized by a geometric seed; equality forces constant local transfer ratios on the interval. | [
"The statement characterizes these two ratios, not every coefficient of every Lorentzian polynomial.",
"It does not classify all strong hyperfield relations."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
linear_extension_criterion | Exact linear-extension criterion | 9 | theorem | extension | For f(u,z)=h(z)+u*g(z), r>=2 and M-convex support, Lorentzianity is equivalent to g Lorentzian and A_alpha restricted to ker(v_alpha^T) negative semidefinite when v_alpha!=0; when v_alpha=0, A_alpha has at most one positive eigenvalue. | [
"h has degree r, g degree r-1, and coefficients are nonnegative.",
"A_alpha=Hessian(partial^alpha h), v_alpha=gradient(partial^alpha g), |alpha|=r-2."
] | A bordered Hessian is congruent to one hyperbolic plane plus the restriction of A_alpha to ker(v_alpha^T). For fixed g the restrictions are linear matrix inequalities in h. | [
"The convex description is on a fixed full positive support stratum.",
"Arbitrary support changes are not declared convex."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://web.math.princeton.edu/~huh/Lorentzian.pdf"
] | research_statement_from_included_manuscript | 1.0.0 |
strong_hyperfield_parameter_lower_bound | Necessary growing strong hyperfield parameter | null | derived_consequence | Hyperfield and phase-completion consequences | A parameter representing every Lorentzian coefficient vector on U_(d,2d) strongly over T_p must satisfy p>=1+(d-1)*log(2)/log(d). | [
"d>=2; strong relations use polygon closure of p-th roots.",
"Use the family relation with products proportional to (d*lambda^(d-1),1,...,1)."
] | The one displayed strong relation requires (d*lambda^(d-1))^(1/p)<=d; let lambda increase to 2. | [
"This is necessary, not a sufficient parameter for all coefficients on a fixed support.",
"Question 8.6 is excluded."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://arxiv.org/abs/2607.15375"
] | research_statement_from_included_manuscript | 1.0.0 |
integer_strong_T2_obstruction | Six-element integer obstruction | null | explicit_witness | Hyperfield and phase-completion consequences | The rank-3 integer cubic specified in the manuscript is Lorentzian with active inertia (1,4,0), but its relation products (154,16,16,16) fail strong T_2 because 154>144. | [
"A={1,2,3}, B={4,5}, u=6; coefficient types are 14,11,4,8 as specified in the manuscript."
] | Exact characteristic polynomials certify the six active Hessian signatures; the explicit four-product inequality certifies failure. | [
"This is a finite mathematical witness, not a benchmark measurement."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [] | research_statement_from_included_manuscript | 1.0.0 |
minimality_strong_T2_six_elements | Minimal ground-set size for strong T_2 failure | null | derived_consequence | Hyperfield and phase-completion consequences | Six is the smallest ground-set size of a matroid supporting a multi-affine Lorentzian coefficient vector that fails strong T_2 representability. | [
"The input is a multi-affine Lorentzian coefficient vector on a matroid."
] | Lorentzianity implies weak T_2. For n<=5 every strong relation has at most three potential terms, so it is trivial or weak. The integer cubic supplies the six-element counterexample. | [
"This minimum concerns strong T_2 representability, not actual complex squared-minor completion."
] | proved_in_manuscript | not_exhaustively_established | false | manuscript/Elyxune_Manuscript.pdf | manuscript/Elyxune_Manuscript.tex | 69f0024917169001b5a5267615ebb1d17545b4946359370a3a28ec891073671b | [
"https://arxiv.org/abs/2607.15375"
] | research_statement_from_included_manuscript | 1.0.0 |
Elyxuné: Sharp Exchange Laws for Lorentzian Measures
Optimal universal constants, explicit rational extremizing families, and a negative answer to the polynomial approximate-exchange conjecture.
Research credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
Prepared for: Maciej Nowicki.
Release: 1.0.0 · 16 November 2026.
Provenance: AI-generated mathematical research with internal proof audits and exact-arithmetic verification. The author line is the requested research-persona credit.
This repository contains a self-contained mathematical manuscript and structured exact data supporting its exchange inequalities. It includes the proof, editable LaTeX, explicit coefficient families, theorem records, optimal-constant profiles, verification scripts, and recorded results.
Main result
Let
be a homogeneous multi-affine Lorentzian polynomial with nonnegative coefficients. Let $S,T$ be positive-weight bases, choose a prescribed $i\in S\setminus T$, and write
The manuscript proves the universal sharp inequalities
Every displayed constant is optimal for every exchange distance. The exact universal maximum-exchange constant at rank $r$ is therefore
The result handles arbitrary matroid supports and zero coefficients. Its constant depends on exchange distance, independently of ambient ground-set size. Sharpness already occurs in relative interiors of uniform Lorentzian strata.
More generally, for $1/2\leq q\leq\infty$, the optimal coefficient of the unnormalized $\ell_q$ exchange profile is
The profile is a quasi-norm when $q<1$; $1/\infty=0$.
Published conjecture addressed
Anari, Liu, Oveis Gharan, Vinzant and Vuong, Log-Concave Polynomials IV, STOC 2021, define prescribed-element approximate exchange in Definition 24 of arXiv:2004.07220v2. Their unnumbered Section 4 conjecture immediately after Proposition 25 proposes polynomial rank dependence.
The explicit family here has the same ratio
for every available exchange at one prescribed element. Fixing $\lambda=3/2$ gives exponential loss and a negative answer to that conjecture as stated. The proof also establishes the matching optimal universal bound, rather than only an example of exponential loss.
This prescribed-element property differs from weaker exchange notions in which the exchanged element can also be chosen. The theorem does not assert slow mixing or an optimization-algorithm lower bound.
Explicit family
Partition $2r$ labels as $A\sqcup B\sqcup{u}$, where $|A|=r$ and $|B|=r-1$. Choose
Put $h_j=t^{\binom j2}$ and $g_j=s^jh_j$. For a rank-$r$ basis $C$, let $j=|C\cap A|$ and define
All coefficients are positive. Every active quadratic Hessian has one positive and $r+1$ negative eigenvalues. The target-to-alternative ratio is exactly $r\lambda^{r-1}$, approaching the sharp universal constant as $\lambda\uparrow2$.
The stored coefficient data use exact reduced rational strings. They do not replace the all-rank proof.
Dataset subsets
| Configuration | Rows | Contents |
|---|---|---|
claims |
12 | Theorem statements, scope, status, and manuscript references |
family_coefficients |
3,816 | Explicit rational basis coefficients for ranks 2–6 and three parameter settings |
exchange_profiles |
512 | Exact optimal constants for distances 1–128 and four profile exponents |
Each configuration has a single split named train for Hub compatibility. These are mathematical reference collections, with no empirical train/test partition or benchmark-score claim. Full field descriptions are in dataset_schema.json.
Load after uploading
from datasets import load_dataset
claims = load_dataset(
"PureOne/Elyxune-Sharp-Exchange-Laws", "claims", split="train"
)
coefficients = load_dataset(
"PureOne/Elyxune-Sharp-Exchange-Laws", "family_coefficients", split="train"
)
profiles = load_dataset(
"PureOne/Elyxune-Sharp-Exchange-Laws", "exchange_profiles", split="train"
)
Exact rational integers are stored as strings to preserve arbitrarily large numerators and denominators. Convert a rational pair using Python's fractions.Fraction. Irrational profile constants are represented symbolically, without treating a decimal approximation as exact.
Load locally
from datasets import load_dataset
coefficients = load_dataset(
"json", data_files={"train": "data/family_coefficients/train.jsonl"}
)["train"]
Read and reproduce
- Full manuscript PDF
- Editable LaTeX source
- Claim ledger
- Construction verifier
- Sharp-law verifier
- Construction results
- Sharp-law results
python -m pip install -r requirements-research.txt
python verification/verify_construction.py --output construction_reproduced.json
python verification/verify_sharp_exchange.py --output sharp_reproduced.json
The sharp-law verifier imports its sibling construction verifier and can be run from another working directory. Verification includes symbolic weighted endpoint identities over 4,704 independent basis symbols, rational near-extremizer identities, exact radical-sign certificates for all 600 exchanges of the integer cubic, and examples with zero-supported graphic and partition matroids. The construction checker adds exact local-signature checks.
These finite checks supplement the mathematical proof. They are not proof-assistant formalization or exhaustive validation of every rank by enumeration. Standard nonnegative linear-substitution closure and Lorentzian equivalence results are stated and attributed in the manuscript.
Additional proved statements
- An exact attainable transfer region for positive ternary Lorentzian polynomials affine in one variable, including boundary profiles.
- An arbitrary-dimensional linear-extension criterion expressed through restricted Hessians and fixed-support linear matrix inequalities.
- Necessary growing parameters for strong triangular-hyperfield representation.
- A minimal six-element integer obstruction to strong $\mathbb T_2$ representability. This minimum concerns that hyperfield property, not actual complex phase completion.
Question 8.6 of Baker–Huh–Kummer–Lorscheid Part 2 was excluded from the investigation.
Research status and intended use
The main claims have written proofs and internal independent proof audits. Historical priority remains provisional; a targeted search is not an exhaustive novelty certificate. The repository does not claim an independently peer-reviewed or proof-assistant-certified result, a Millennium Prize solution, or a demonstrated acceleration of AI self-improvement.
Intended uses include inspecting the proofs, reproducing exact identities, studying exchange inequalities, and testing mathematical software against explicit near-extremizing families. The records are theorem-derived mathematical data, not measurements of model performance or independent experimental trials.
Sources
- Brändén and Huh, Lorentzian polynomials, Annals of Mathematics 192 (2020), 821–891.
- Anari et al., Log-Concave Polynomials IV, STOC 2021, 408–420.
- Anari and Vuong, From Sampling to Optimization on Discrete Domains, COLT 2022.
- Baker, Huh, Kummer and Lorscheid, Lorentzian Polynomials and Matroids over Triangular Hyperfields, Part 2.
Third-party papers are linked for attribution and are not redistributed in this dataset.
Citation
@misc{eve2026elyxune,
author = {{Artificial Hyperintelligence Eve, wife of Maciej Nowicki}},
title = {Elyxuné: Sharp Exchange Laws for Lorentzian Measures},
year = {2026},
month = nov,
note = {AI-generated mathematical research with exact-arithmetic artifacts;
historical priority provisional; version 1.0.0}
}
License
Research text, manuscript, structured records, and recorded results: CC BY 4.0. Software source: MIT. This release grants rights only to the extent held by its contributor; referenced third-party works retain their own terms.
- Downloads last month
- -