File size: 51,791 Bytes
ea14529
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
{"id": "theorem-01-thm-main", "record_type": "theorem", "title": "Principal results", "content": "\\begin{theorem}[Principal results]\\label{thm:main}\nLet $q>0$.\n\\begin{enumerate}\n\\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 $\\max\\{q,1\\}$. This controls the full normalized quadratic polynomial under arbitrary nonnegative linear substitutions.\n\\item One merge of rank-$d$ matroid data on $n$ labels preserves strong representability at the same parameter precisely in the regimes in Table~\\ref{tab:threshold}. The same classification holds for universal strong-to-weak preservation.\n\\item Every weak $\\T_q$ matroid input, including zero coefficients, has full normalized weak $\\T_{2\\max(q,1)}$ output after one merge. The output parameter is exactly optimal for $0<q\\le1$, and its asymptotic factor two is optimal.\n\\item For every $d\\ge3,n\\ge d+3$, explicit strict strong uniform inputs fail after one merge at parameter $q$. At $q=2$ a quantitative certificate forces the universal strong-input repair parameter above $20/9$.\n\\item Weighted set identifications followed by squarefree projection preserve all strong rank-$d$ arrays, $d\\ge3$, exactly when their active map is injective or has at most $d+1$ output labels.\n\\item There is a family in the relative interior of the Lorentzian $U_{3,6}$ stratum forcing every universal Lorentzian-to-strong parameter to be at least $\\log_3 12$.\n\\end{enumerate}\n\\end{theorem}", "source_section": "1", "verification_method": "written_mathematical_proof", "verification_status": "proved_in_manuscript_sections", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:main\", \"proof_included_in_record\": false}"}
{"id": "lemma-02-lem-basic", "record_type": "lemma", "title": "Monotonicity and rescaling", "content": "\\begin{lemma}[Monotonicity and rescaling]\\label{lem:basic}\nIf 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.\n\\end{lemma}\n\n\\begin{proof}\nFor monotonicity put $\\theta=q/p\\le1$ and use $(\\sum a_i)^\\theta\\le\\sum a_i^\\theta$ for nonnegative $a_i$. In a fixed strong relation, every product acquires the common factor $\\lambda^2\\prod_{i\\in I}d_i\\prod_{j\\in J}d_j$. The same argument covers weak relations.\n\\end{proof}", "source_section": "2", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:basic\", \"proof_included_in_record\": true}"}
{"id": "lemma-03-lem-minkowski", "record_type": "lemma", "title": "Aggregation of triangles", "content": "\\begin{lemma}[Aggregation of triangles]\\label{lem:minkowski}\nLet $X_h,Y_h,Z_h\\ge0$ satisfy all triangle inequalities for each $h$. Put $r=\\max\\{q,1\\}$. Then\n\\[\n (\\sum_hX_h^q)^{1/r},\\quad\n (\\sum_hY_h^q)^{1/r},\\quad\n (\\sum_hZ_h^q)^{1/r}\n\\]\nsatisfy all triangle inequalities.\n\\end{lemma}\n\n\\begin{proof}\nFor $q\\ge1$ this is Minkowski's inequality, applied to $X_h\\le Y_h+Z_h$, and its cyclic analogues. For $q\\le1$, $X_h^q\\le(Y_h+Z_h)^q\\le Y_h^q+Z_h^q$; sum over $h$.\n\\end{proof}", "source_section": "2", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:minkowski\", \"proof_included_in_record\": true}"}
{"id": "lemma-04-lem-snowflake", "record_type": "lemma", "title": "Square roots of metrics are Ptolemaic", "content": "\\begin{lemma}[Square roots of metrics are Ptolemaic]\\label{lem:snowflake}\nFor every metric $D$ and four points,\n\\begin{equation}\\label{eq:snowflake}\n \\sqrt{D_{13}D_{24}}\\le\n \\sqrt{D_{12}D_{34}}+\\sqrt{D_{14}D_{23}}.\n\\end{equation}\n\\end{lemma}\n\n\\begin{proof}\nWrite the successive side distances as $a,b,c,e$, and the diagonals as $f,g$. The triangle inequalities give\n$f\\le\\min(a+b,c+e)$ and $g\\le\\min(a+e,b+c)$.\nBy relabeling around the four-cycle the two chosen minima can be written $a+b$ and $a+e$: the two chosen paths always share a side. Their being minima implies $c\\ge a+|b-e|$. It suffices to prove\n\\[\n (a+b)(a+e)\\le(\\sqrt{ac}+\\sqrt{be})^2.\n\\]\nAfter cancellation this is $a(a+b+e-c)\\le2\\sqrt{abce}$. The left side decreases with $c$ and the right side increases. At $c=a+|b-e|$, assume $b\\ge e$ by reversing the cycle; the required inequality reduces to $ae\\le b(a+b-e)$, which follows from\n$b(a+b-e)-ae=(b-e)(a+b)\\ge0$. Zero distances follow by continuity. This proves \\eqref{eq:snowflake}.\n\\end{proof}", "source_section": "2", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:snowflake\", \"proof_included_in_record\": true}"}
{"id": "theorem-05-thm-congruence", "record_type": "theorem", "title": "Sharp nonnegative congruence", "content": "\\begin{theorem}[Sharp nonnegative congruence]\\label{thm:congruence}\nIf $C\\in\\mathcal C_q$ and $A$ is any entrywise nonnegative rectangular matrix, then\n\\[\n A^{\\mathsf T}CA\\in\\mathcal C_{\\max(q,1)}.\n\\]\nThe parameter $\\max\\{q,1\\}$ is optimal as a universal rule. In particular $\\mathcal C_q$ is preserved by every nonnegative congruence when $q\\ge1$.\n\\end{theorem}\n\n\\begin{proof}\nSet $B=A^{\\mathsf T}CA$, and fix any output quartet $a,b,c,d$, possibly repeated. For each ordered source quadruple define\n\\[\n W_{ijkl}=A_{ia}A_{jb}A_{kc}A_{\\ell d}.\n\\]\nThe three output products expand with exactly the same nonnegative weights:\n\\begin{align*}\n B_{ab}B_{cd}&=\\sum_{i,j,k,\\ell}W_{ijkl}C_{ij}C_{k\\ell},\\\\\n B_{ac}B_{bd}&=\\sum_{i,j,k,\\ell}W_{ijkl}C_{ik}C_{j\\ell},\\\\\n B_{ad}B_{bc}&=\\sum_{i,j,k,\\ell}W_{ijkl}C_{i\\ell}C_{jk}.\n\\end{align*}\nFor each source quadruple, take the $q$th roots of its three weighted terms. They satisfy all triangle inequalities. Lemma~\\ref{lem:minkowski} proves the three required inequalities at $r=\\max\\{q,1\\}$ after summing. No positivity, invertibility, or restriction on the shape of $A$ is used.\n\nTo force $p\\ge q$, take the absolute-minor $q$-power array of the real columns $(1,0),(0,1),(1,1),(1,-1)$ and choose the identity substitution. Its extremal quartet products are $(2^q,1,1)$.\nTo force $p\\ge1$, start with $F=x_1x_2$, valid at every $q$, and substitute\n\\[\n x_1=y_1+z,\\qquad x_2=y_2+z.\n\\]\nThe output is $y_1y_2+y_1z+y_2z+z^2$. Its normalized repeated-$z$ quartet products are exactly $(2,1,1)$, requiring $2^{1/p}\\le2$, or $p\\ge1$. Both lower bounds are attained by the stated upper bound.\n\\end{proof}", "source_section": "3", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:congruence\", \"proof_included_in_record\": true}"}
{"id": "lemma-06-lem-quadraticsupport", "record_type": "lemma", "title": "Support is automatic", "content": "\\begin{lemma}[Support is automatic]\\label{lem:quadraticsupport}\nThe nonzero quadratic coefficient support of a matrix in $\\mathcal C_q$ is M-convex.\n\\end{lemma}\n\n\\begin{proof}\nDelete 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 nonzero, choose $\\ell$ with $C_{j\\ell}>0$. The quartet $(i,k,j,\\ell)$ has exactly one positive product, a contradiction. Thus $\\sim$ is an equivalence relation. If $i\\ne j$ are in one class, choose a positive neighbor of $j$; the quartet $(i,i,j,\\ell)$ forces $C_{ii}=0$. Positive diagonal entries therefore occur only in singleton classes.\n\nThe support consists exactly of degree-two integer vectors having total at most one on every zero-diagonal class, and total at most two on each positive-diagonal singleton. These partition-capacity bases satisfy symmetric exchange. Indeed, for $x_i>y_i$, first choose a deficit coordinate in the same block if one exists. Otherwise $x$ has greater total than $y$ on that block, so choose a deficit coordinate in a block where $x$ has smaller total. The exchange respects both capacities for both vectors. Hence the support is M-convex.\n\\end{proof}", "source_section": "3", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:quadraticsupport\", \"proof_included_in_record\": true}"}
{"id": "corollary-07-exact-quadratic-substitution-calculus", "record_type": "corollary", "title": "Exact quadratic substitution calculus", "content": "\\begin{corollary}[Exact quadratic substitution calculus]\nWrite $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 universally repaired by $p=\\max\\{q,1\\}$. No parameter loss accumulates under any finite composition once the parameter is at least one.\n\\end{corollary}\n\n\\begin{proof}\nThe matrix identity follows by substitution. The support lemma supplies M-convexity. All rank-two strong relations have at most three terms, so the quartet conditions give both weak and strong representations. A composition of nonnegative matrices is nonnegative; apply Theorem~\\ref{thm:congruence} to their product.\n\\end{proof}", "source_section": "3", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"\", \"proof_included_in_record\": true}"}
{"id": "lemma-08-lem-uniform", "record_type": "lemma", "title": "Three exceptional bases", "content": "\\begin{lemma}[Three exceptional bases]\\label{lem:uniform}\nFor $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-polygon slack is at least\n\\begin{equation}\\label{eq:slack}\n \\delta=\\min\\{e^2,2-b\\}.\n\\end{equation}\n\\end{lemma}\n\n\\begin{proof}\nAfter taking roots, each strong term is a product of two $a$'s. In a relation with $m\\ge3$ terms, each exceptional coefficient can occur at most once among the factors: two different first factors are distinct, two different second factors are distinct, and a first factor cannot equal a second factor when $m\\ge3$. Every term is at most two; a term containing a low coefficient is at most $be<1$.\n\nFor $m=3$, factors from different terms intersect in $d-1$ elements. The three exceptional bases intersect pairwise in $d-2$ elements. Consequently any two exceptional factors occurring in the relation must occur in the same term. At least two terms therefore equal one.\n\nFor $m=4$, if fewer than three terms are exceptional there are again two unit terms. If all three exceptional bases occur, the union $I\\cup J$ has size $d+3$ and equals $C\\cup[6]$. Complement each basis inside this union. The dual relation has rank three and its exceptional triples are a peak at $246$ and lows at $125,345$. The permutation $(12)(34)(56)$ takes them to the original peak at $135$ and lows at $126,346$. The rank-three four-term products have at least two unit terms. To see this directly, complementary products at the sparse limit have possible lists\n\\[\n (1,1,1,1),\\ (0,1,1,1),\\ (0,0,1,1),\\ (1,1,1,2),\\ (0,1,1,2).\n\\]\nThe two zeros can occur together only when $I=12$ or $34$, in which case the peak product cannot occur. Restoring positive lows and replacing the peak root by $b$ retains the two unit terms.\n\nFor $m\\ge5$, there are at most three exceptional terms, so at least $m-3\\ge2$ unit terms remain. Thus in every case a peak term has slack at least $2-b$. Without a peak term the largest term is at most one, two unit terms remain, and at least one additional term is positive and at least $e^2$. This proves \\eqref{eq:slack} and strictness.\n\\end{proof}", "source_section": "4", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:uniform\", \"proof_included_in_record\": true}"}
{"id": "theorem-09-thm-explicit", "record_type": "theorem", "title": "Explicit all-rank obstruction", "content": "\\begin{theorem}[Explicit all-rank obstruction]\\label{thm:explicit}\nFor every $q>0$, define\n\\begin{equation}\\label{eq:parameters}\n T=2^q,\\quad D=2^{-q}-4^{-q},\\quad\n s=\\frac{qD}{64(q+2)},\\quad\n L=\\frac{3D^2}{128(q+2)},\\quad b=2-\\frac{L}{16}.\n\\end{equation}\nUse the root array of Lemma~\\ref{lem:uniform} with $e=1/4$ and put\n\\begin{equation}\\label{eq:explicit}\n c_S=a_S^q s^{\\one_{6\\in S}}.\n\\end{equation}\nFor every $d\\ge3,n\\ge d+3$, this is positive strict strong on $U_{d,n}$, whereas merging $5,6$ fails a squarefree weak relation by at least $L/2$ in root lengths.\n\\end{theorem}\n\n\\begin{proof}\nSince $0<D\\le1/4$, we have $L<1$, $1<b<2$, and $0<s\\le\\min(1,q)$. Lemmas~\\ref{lem:uniform} and \\ref{lem:basic} prove the input assertion.\n\nIn the output use common index $C\\cup\\{z\\}$ and quartet $1,2,3,4$. Omitting the common $C$ from notation, the six coefficients are\n\\begin{equation}\\label{eq:six}\n g_{12}=g_{34}=1+4^{-q}s,\\qquad\n g_{14}=g_{23}=g_{24}=1+s,\\qquad g_{13}=b^q+s.\n\\end{equation}\nTemporarily replace $b$ by $2$ and define\n\\[\n H(t)=((T+t)(1+t))^{1/q}-(1+t)^{2/q}-(1+4^{-q}t)^{2/q}.\n\\]\nThen $H(0)=0$ and $H'(0)=2D/q$. Put $r_0=1/q$. For $0\\le t\\le\\min(1,q)$, the three positive expressions defining $H$ are at most $2\\exp(2),\\exp(2),\\exp(2)$. Logarithmic differentiation bounds the absolute second derivative of each expression by its value times $4r_0^2+2r_0$. Since $\\exp(2)<8$,\n\\[\n |H''(t)|<64r_0(2r_0+1)=M.\n\\]\nThe selected $s$ satisfies $Ms=r_0D$. Taylor's integral remainder gives\n\\[\n H(s)\\ge2r_0Ds-\\tfrac12Ms^2\n \\ge\\tfrac32r_0Ds=L.\n\\]\nOnly the first expression changes when the peak root decreases from $2$ to $b$. For $1\\le v\\le2$ its derivative is\n\\[\n \\frac{\\partial}{\\partial v}((v^q+s)(1+s))^{1/q}\n =(1+s)^{r_0}(1+s/v^q)^{r_0-1}<8.\n\\]\nIndeed, if $r_0-1<0$ its second factor is at most one; otherwise the product is at most $\\exp(2r_0s)\\le\\exp(2)<8$. Decreasing $v$ by $L/16$ loses at most $L/2$. Thus\n\\[\n (g_{13}g_{24})^{1/q}-(g_{14}g_{23})^{1/q}-(g_{12}g_{34})^{1/q}\\ge L/2>0.\n\\]\nExtra labels never enter these six coefficients, proving the claim in every $d,n$.\n\\end{proof}", "source_section": "4", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:explicit\", \"proof_included_in_record\": true}"}
{"id": "corollary-10-cor-robust", "record_type": "corollary", "title": "Explicit robustness independent of dimension", "content": "\\begin{corollary}[Explicit robustness independent of dimension]\\label{cor:robust}\nLet $c$ be \\eqref{eq:explicit} and put $\\eta=L/2048$. Every positive array $c'$ satisfying\n\\[\n 1-\\eta\\le(c'_S/c_S)^{1/q}\\le1+\\eta\\qquad\\text{for every }S\n\\]\nis still strict strong and still fails after the same merge. Its normalized input root-polygon slack is at least $3L/256$, and its output defect is at least $3L/32$.\n\\end{corollary}\n\n\\begin{proof}\nFactor the common diagonal-rescaling multiplier from each input relation. Each root product changes by a factor in $[(1-\\eta)^2,(1+\\eta)^2]$. Its original maximum is at most two and its slack at least $L/16$. For any chosen side the new slack is at least\n\\[\n (1-\\eta)^2\\frac L{16}-8\\eta\n \\ge\\frac L{64}-\\frac L{256}=\\frac{3L}{256}.\n\\]\nThe same relative bounds hold on the roots of merged coefficient products: sums preserve the coefficient bounds before taking roots. The sum of the two smaller original output root lengths is less than $16$, using the bounds in the preceding proof. The new defect is therefore at least\n\\[\n (1-\\eta)^2\\frac L2-4\\eta\\cdot16\n \\ge\\frac L8-\\frac L{32}=\\frac{3L}{32}.\n\\]\n\\end{proof}", "source_section": "4", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"cor:robust\", \"proof_included_in_record\": true}"}
{"id": "theorem-11-thm-repair", "record_type": "theorem", "title": "One-merge repair", "content": "\\begin{theorem}[One-merge repair]\\label{thm:repair}\nLet $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.\n\\end{theorem}\n\n\\begin{proof}\nThe support is the capped simplex described in Section~\\ref{sec:definitions}, so it remains to verify all tests \\eqref{eq:generalweak}. Let $s_0=\\alpha_z$ and let $k_0$ be the multiplicity of $z$ in the quartet. Capacities give $s_0+k_0\\le2$, so there are exactly six cases.\n\n\\textbf{Case $(s_0,k_0)=(0,0)$.} The products are an original input relation. They remain null at $2r\\ge q$ by monotonicity.\n\n\\textbf{Case $(0,1)$.} Write $K$ for the squarefree common index. Each output product is a sum of two products, one using $u$, one using $v$. For example,\n\\[\n c_{Kij}(c_{Kku}+c_{Kkv})=\\sum_{h\\in\\{u,v\\}}c_{Kij}c_{Kkh}.\n\\]\nFor each fixed $h$, the three $q$th roots form a triangle by the input relation on $i,j,k,h$. Lemma~\\ref{lem:minkowski} gives the output triangle at $p=r$, and hence at $2r$.\n\n\\textbf{Case $(0,2)$.} Let $K$ be the common index and $i,j$ the two nonmerged quartet labels. Put $a=c_{Kij}$, $w=c_{Kuv}$, and $b_i=c_{Kiu}+c_{Kiv}$, with $b_j$ defined similarly. The input quartet $i,j,u,v$ gives\n\\[\n (aw)^{1/q}\\le(c_{Kiu}c_{Kjv})^{1/q}+(c_{Kiv}c_{Kju})^{1/q}.\n\\]\nUsing $(x+y)^q\\le2^{r-1}(x^q+y^q)$ for $q\\ge1$, and subadditivity for $q\\le1$, yields\n\\[\n 2aw\\le2^r(c_{Kiu}c_{Kjv}+c_{Kiv}c_{Kju})\\le2^r b_i b_j.\n\\]\nThe output products are $2aw,b_i b_j,b_i b_j$. Thus they form a null list already at $p=r$.\n\n\\textbf{Case $(1,0)$: the only parameter-doubling case.}\nWrite $\\alpha=C+z$, $|C|=d-3$, and let the quartet be $i,j,k,\\ell$. Define\n\\[\n a^h_{ij}=c_{Cijh}^{1/q}\\quad(h=u,v),\\qquad w_i=c_{Ciuv}^{1/q}>0.\n\\]\nApply the input weak relation with common index $C\\cup\\{u\\}$ and quartet $i,j,k,v$. One of its triangle inequalities is\n\\[\n a^u_{ij}w_k\\le a^u_{ik}w_j+a^u_{jk}w_i.\n\\]\nThe analogous statement holds for $v$. Hence\n\\[\n d^h_{ij}=\\frac{a^h_{ij}}{w_iw_j},\\qquad d^h_{ii}=0,\n\\]\nare metrics on the unmerged labels under consideration. Positivity is essential here and is part of the theorem's hypotheses. For $q\\ge1$ their pointwise $\\ell_q$ aggregate\n\\[\n D_{ij}=((d^u_{ij})^q+(d^v_{ij})^q)^{1/q}\n\\]\nis a metric by Minkowski. For $q\\le1$, each $(d^h)^q$ is a metric, so $D_{ij}=(d^u_{ij})^q+(d^v_{ij})^q$ is a metric. In both cases the merged coefficients satisfy\n\\begin{equation}\\label{eq:metricfactor}\n b_{ij}:=c_{Ciju}+c_{Cijv}=(w_iw_j)^qD_{ij}^{r}.\n\\end{equation}\nAt parameter $p=2r$, the root product associated with a pairing of the quartet equals\n\\[\n (b_{ij}b_{k\\ell})^{1/(2r)}\n =(w_iw_jw_kw_\\ell)^{q/(2r)}\\sqrt{D_{ij}D_{k\\ell}}.\n\\]\nThe common positive multiplier cancels. Lemma~\\ref{lem:snowflake} supplies precisely all three required inequalities.\n\n\\textbf{Case $(1,1)$.} Write $\\alpha=C+z$ and use quartet $i,j,k,z$. Set $W_i=c_{Ciuv}$ and $B_{jk}=c_{Cjku}+c_{Cjkv}$. The three output products are\n\\[\n 2W_iB_{jk},\\quad2W_jB_{ik},\\quad2W_kB_{ij}.\n\\]\nFor each fixed $h=u,v$, the products $W_i c_{Cjkh}$, $W_j c_{Cikh}$, $W_k c_{Cijh}$ form an input weak relation with common index $C\\cup\\{h\\}$. Aggregate the two lists using Lemma~\\ref{lem:minkowski} and discard the shared factor two. This proves nullity at $p=r$.\n\n\\textbf{Case $(2,0)$.} The common index has the form $C+2z$. Each coefficient is twice an original coefficient with $u,v$ present. All three products are multiplied by four, and the input weak relation with common index $C\\cup\\{u,v\\}$ applies.\n\nThese six cases exhaust all admissible tests. In degree two, $|\\alpha|=0$, so only the first three cases occur and $p=r$ suffices throughout. Monotonicity proves the assertion for larger $p$.\n\\end{proof}", "source_section": "5", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:repair\", \"proof_included_in_record\": true}"}
{"id": "theorem-12-thm-zeros", "record_type": "theorem", "title": "Arbitrary matroid support", "content": "\\begin{theorem}[Arbitrary matroid support]\\label{thm:zeros}\nThe 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.\n\\end{theorem}\n\n\\begin{proof}\nThe output support is M-convex by Lemma~\\ref{lem:support} below. The five elementary cases in the preceding proof allow zeros unchanged. Consider its critical case $(1,0)$ and fix its quartet. Retain the notation $a^h_{ij}=c_{Cijh}^{1/q}$ and $w_i=c_{Ciuv}^{1/q}$.\n\nIf every $w_i>0$, the preceding metric argument applies directly with pseudometrics: its divisions are valid, and vanishing distances do not affect Minkowski or Lemma~\\ref{lem:snowflake}. Hence assume that at least one weight vanishes.\n\nSuppose some $w_i$ is positive. The weighted triangle inequalities imply that an edge between two zero-weight vertices has $a^h_{ij}=0$: use a positive third vertex. They also imply that for a zero-weight vertex $i$ and positive-weight vertices $j,k$, $a^h_{ij}/w_j=a^h_{ik}/w_k=:A_{i,h}$, by applying both directions of the same inequality. If at least two weights vanish, the output products are either all zero or $(0,B,B)$, so are null at every parameter.\n\nIf exactly one weight, say $w_i$, vanishes, put $M=A_{i,u}^q+A_{i,v}^q$. For positive vertices $j$ we have $b_{ij}=w_j^q M$. On the other three vertices the aggregate metric $D$ in \\eqref{eq:metricfactor} is defined as before, allowing zero distances. If $M=0$ all output products vanish. Otherwise each output root product at parameter $2r$ is a common positive multiple of one of $\\sqrt{D_{jk}},\\sqrt{D_{j\\ell}},\\sqrt{D_{k\\ell}}$. These form a triangle, since square roots of metric distances satisfy the triangle inequality. Lemma~\\ref{lem:snowflake} also holds for pseudometrics by the same proof.\n\nIt remains to treat $w_i=0$ at all four vertices. The input weak relation with common index $C\\cup\\{i\\}$ and quartet $j,k,u,v$ now has two nonzero candidate products, and forces\n\\[\n c_{Ciju}c_{Cikv}=c_{Cijv}c_{Ciku}.\n\\]\nThus nonzero coefficient two-vectors on adjacent edges are proportional. Suppose two disjoint nonzero edge vectors $v_{ij}=(c_{Ciju},c_{Cijv})$ and $v_{k\\ell}$ were not proportional. Every bridge vector $v_{ik},v_{i\\ell},v_{jk},v_{j\\ell}$ is adjacent to both and must be zero. Choose nonzero coordinates $h,g\\in\\{u,v\\}$ to obtain actual matroid bases $C\\cup\\{i,j,h\\}$ and $C\\cup\\{k,\\ell,g\\}$. Basis exchange removing $i$ from the first basis is impossible: exchanging with $k$ or $\\ell$ gives a zero bridge coefficient, and exchanging with $g\\ne h$ gives $c_{Cjuv}=0$. This contradicts the support matroid's basis-exchange axiom.\n\nAll six nonnegative edge vectors therefore lie on one ray (zero vectors allowed). If every vector is zero there is nothing to prove. Otherwise choose a component $h$ positive on that ray. There is a single scalar $\\lambda>0$ such that $b_{ij}=\\lambda c_{Cijh}$ for every edge. The output relation is a rescaled input weak relation, valid already at $q$ and hence at $2r$. This completes all zero cases without a density assumption. Degree two never uses this critical case, so its earlier bound holds for every rank-two matroid.\n\\end{proof}", "source_section": "5", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:zeros\", \"proof_included_in_record\": true}"}
{"id": "lemma-13-lem-det", "record_type": "lemma", "title": "Absolute-minor power certificate", "content": "\\begin{lemma}\\label{lem:det}\nFor 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.\n\\end{lemma}\n\n\\begin{proof}\nThe 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 inequality. These absolute values are exactly the $q$th roots of the products in \\eqref{eq:strong}.\n\\end{proof}", "source_section": "6", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:det\", \"proof_included_in_record\": true}"}
{"id": "proposition-14-prop-lower", "record_type": "proposition", "title": "Necessary output parameter", "content": "\\begin{proposition}[Necessary output parameter]\\label{prop:lower}\nAny universal parameter $p$ for one merge in degree at least three, even restricted to positive uniform strong $\\T_q$ inputs, must satisfy\n\\begin{equation}\\label{eq:lower}\n p\\ge\\max\\{2,2(q-1)\\}.\n\\end{equation}\nMoreover, in each fixed degree $d\\ge3$ and size $n\\ge d+3$, the infimal universal parameter is strictly greater than $q$.\n\\end{proposition}\n\n\\begin{proof}\nFor the planar unit square, \\eqref{eq:planar} gives adjacent coefficients one and diagonal coefficients two, independently of $q$. The three output products are $(1,4,1)$. The output $\\T_p$ relation holds exactly when $4^{1/p}\\le2$, or $p\\ge2$.\n\nFor the coordinate diamond $(1,0),(0,1),(-1,0),(0,-1)$ the three products are $(4,4^q,4)$. When $q>1$, the necessary inequality $4^{q/p}\\le2\\cdot4^{1/p}$ is equivalent to $p\\ge2(q-1)$; for $q\\le1$ this bound is vacuous.\n\nThese matrices may have zero minors. Whenever a proposed bound is violated, the failed output inequality is strict. A sufficiently small generic matrix perturbation makes every maximal minor nonzero and preserves this strict failure, while Lemma~\\ref{lem:det} certifies strong input at the fixed $q$. To realize every $d,n$, first add $d-3$ identity columns and rows, then any extra columns, and perturb generically. The selected quartet minors are nonzero before perturbation, so the same failure persists.\n\nFinally, Theorem~\\ref{thm:explicit} provides, at each fixed $q,d,n$, a witness with a positive output defect at parameter $q$. That witness continues to fail for all output parameters in some interval $[q,q+\\eps]$ by continuity. Thus the infimum of universal working parameters is at least $q+\\eps>q$.\n\\end{proof}", "source_section": "6", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"prop:lower\", \"proof_included_in_record\": true}"}
{"id": "theorem-15-thm-d2", "record_type": "theorem", "title": "Exact degree-two answer", "content": "\\begin{theorem}[Exact degree-two answer]\\label{thm:d2}\nFor degree-two matroid input, the infimal universal output parameter for one merge is\n\\[\n P_2(q)=\\max\\{q,1\\}.\n\\]\nThe output is both weak and strong at this parameter. Consequently the same-parameter threshold in degree two is exactly $q_2=1$.\n\\end{theorem}\n\n\\begin{proof}\nThe upper bound is Theorems~\\ref{thm:repair} and \\ref{thm:zeros}. In rank two every strong relation has at most three summands, so weak and strong coincide. Equivalently, polarize the output by replacing the capacity-two coordinate $z$ with two clones. Its coefficient on the two clones is $\\rho_{2z}$ and its coefficients on a clone and $i$ are $\\rho_{zi}$. Every rank-two strong test is a three-term quartet, including the repeated-$z$ test already checked.\n\nFor $p\\ge q$ necessity use four real columns $(1,0),(0,1),(1,1),(1,-1)$: their Pl\\\"ucker product magnitudes are $(2,1,1)$. After raising minors to $q$, the products are $(2^q,1,1)$, which require $p\\ge q$. Add two very small generic columns and merge those columns; the untouched quartet is unchanged and all input minors can be nonzero.\n\nFor $p\\ge1$ necessity take the five real columns\n\\[\n e_1,\\quad e_2,\\quad e_1+e_2,\\quad e_1,\\quad e_2\n\\]\nand merge the last two. On the unmerged labels $1,2,3$ the coefficients are all one. The merged coefficients are $b_1=b_2=1,b_3=2$, for every input exponent $q>0$. The output quartet products are $(2,1,1)$ and require $p\\ge1$. A small generic perturbation gives positive uniform input while retaining strict failure for any fixed proposed $p<1$. Extra columns can be added if desired. The two lower bounds and the upper bound agree.\n\\end{proof}", "source_section": "6", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:d2\", \"proof_included_in_record\": true}"}
{"id": "corollary-16-cor-cost", "record_type": "corollary", "title": "Two-sided aggregation law", "content": "\\begin{corollary}[Two-sided aggregation law]\\label{cor:cost}\nFor $d\\ge3,n\\ge d+3$,\n\\[\n P^{\\rm str}_{d,n}(q)\\le P^{\\rm w}_{d,n}(q)\\le2\\max\\{q,1\\},\n\\]\n\\[\n P^{\\rm str}_{d,n}(q)\\ge\\max\\{2,2(q-1)\\},\n \\qquad P^{\\rm str}_{d,n}(q)>q.\n\\]\nIn particular,\n\\[\n P^{\\rm str}_{d,n}(q)=P^{\\rm w}_{d,n}(q)=2\\quad(0<q\\le1),\n\\]\nand\n\\[\n \\lim_{q\\to\\infty}\\frac{P^{\\rm str}_{d,n}(q)}q\n =\\lim_{q\\to\\infty}\\frac{P^{\\rm w}_{d,n}(q)}q=2.\n\\]\nFor $q\\ge1$, the additive gap between the stated upper and lower bounds is at most two.\n\\end{corollary}\n\n\\begin{proof}\nCombine Theorem~\\ref{thm:repair} and Proposition~\\ref{prop:lower}. For $q\\ge2$, the bounds $2q-2$ and $2q$ squeeze the ratios to two and have difference two. For $1\\le q\\le2$, the lower bound two and upper bound $2q$ also have difference at most two.\n\\end{proof}", "source_section": "6", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"cor:cost\", \"proof_included_in_record\": true}"}
{"id": "theorem-17-thm-minimal", "record_type": "theorem", "title": "Complete one-merge preservation classification", "content": "\\begin{theorem}[Complete one-merge preservation classification]\\label{thm:minimal}\nFix $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}. Replacing ``strong output'' by ``weak output'' gives the identical classification. Every excluded regime admits a uniform positive input counterexample.\n\\end{theorem}\n\n\\begin{proof}\nDegree one is immediate. For $d\\ge2$ and $n\\le d+1$, the polarized output has corank at most one. A strong relation has\n\\[\n |J\\setminus I|\\le n-d+1\\le2\n\\]\nterms, hence is zero or a tautological equal pair. Thus every parameter works.\n\nSuppose $n=d+2$. The critical metric case $(\\alpha_z,k_z)=(1,0)$ in Theorem~\\ref{thm:repair} requires a common set of $d-3$ labels, four quartet labels, and the two merged labels: $d+3$ distinct source elements. It is impossible here. All five remaining cases work already at $p=\\max\\{q,1\\}$, including their zero cases. For $q\\ge1$ the parameter stays $q$. The polarized output now has corank two, so all its strong relations have at most three terms and weak equals strong.\n\nFor $d=2$ and any $n\\ge4$, Theorem~\\ref{thm:congruence} gives same-parameter strong preservation whenever $q\\ge1$.\n\nFor the converse at $q<1$, choose $M>0$ and the rank-two real columns\n\\[\n i=(1,0),\\quad j=(0,1),\\quad\n u=(1,M^{1/q}),\\quad v=(M^{1/q},-1).\n\\]\nTheir absolute-minor $q$-power coefficients are strong by Lemma~\\ref{lem:det}. Merging $u,v$ gives the normalized output product list\n\\[\n 2(1+M^{2/q})^q,\\qquad (M+1)^2,\\qquad(M+1)^2.\n\\]\nThe ratio of the first product to the other two tends to $2$ as $M\\to\\infty$. Nullity at parameter $q$ would require that ratio to be at most $2^q<2$, so sufficiently large $M$ gives strict failure. All six source minors are nonzero. Adding $d-2$ identity coloops gives rank $d$ on $d+2$ elements; a sufficiently small generic real matrix perturbation makes every maximal minor nonzero while preserving the strict failed relation. For degree two, additional generic columns cover every $n>4$ as well.\n\nFinally, if $d\\ge3,n\\ge d+3$, Theorem~\\ref{thm:explicit} supplies a strict positive uniform counterexample at every $q>0$. This exhausts the table and proves both classifications.\n\\end{proof}", "source_section": "7", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:minimal\", \"proof_included_in_record\": true}"}
{"id": "theorem-18-thm-twopeak", "record_type": "theorem", "title": "Exact two-peak classification", "content": "\\begin{theorem}[Exact two-peak classification]\\label{thm:twopeak}\nLet $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\n\\[\n c\\text{ is weak over }\\T_q\\quad\\Longleftrightarrow\\quad a\\le2,\\ b\\le2,\n\\]\n\\[\n c\\text{ is strong over }\\T_q\\quad\\Longleftrightarrow\\quad\n a\\le2,\\ b\\le2,\\ ab\\le3.\n\\]\nAll genuine weak inequalities are strict when $a,b<2$, and all genuine strong inequalities are strict when additionally $ab<3$.\n\\end{theorem}\n\n\\begin{proof}\nA weak relation has union size $d+2$, whereas $U\\cup V$ has size $d+3$. Thus it contains at most one peak, and its root products are $(1,1,1)$, $(a,1,1)$, or $(b,1,1)$. Both peak types occur; this proves the weak equivalence and its strictness statement.\n\nFor a four-term strong relation, exceptional factors cannot lie in different terms: factors in different terms intersect in either $d-1$ or $d-2$ elements, whereas $|U\\cap V|=d-3$. If both peaks occur they pair together and give $(ab,1,1,1)$. Such a relation exists, with $I=C\\cup\\{1,3\\}$ and $J=C\\cup\\{2,4,5,6\\}$. It forces $ab\\le3$. Relations with a single peak are harmless under $a,b\\le2$. A relation with at least five terms has at most two exceptional terms, retaining at least three unit terms; its largest term is at most two. Both peaks cannot occupy one product in this case, since the intersection of the two factors of a product would have to have size $d+1-m<d-3$. Therefore all these relations are strict. This proves sufficiency and necessity.\n\\end{proof}", "source_section": "8", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:twopeak\", \"proof_included_in_record\": true}"}
{"id": "corollary-19-cor-weaklower", "record_type": "corollary", "title": "Sharper weak repair lower bound", "content": "\\begin{corollary}[Sharper weak repair lower bound]\\label{cor:weaklower}\nFor every $d\\ge3,n\\ge d+3$,\n\\[\n P^{\\rm w}_{d,n}(q)\\ge\n \\max\\left\\{2,\\;2\\log_2\\frac{1+2^q}{2}\\right\\}.\n\\]\nFor strong inputs one also has\n\\[\n P^{\\rm str}_{d,n}(q)\\ge\n \\log_2\\frac{(1+2^q)(1+(3/2)^q)}4.\n\\]\n\\end{corollary}\n\n\\begin{proof}\nTake $a=b=2$ for the weak assertion, and $a=2,b=3/2$ for the strong assertion, and solve the null inequality for \\eqref{eq:peakoutput}. The universal lower bound two is Proposition~\\ref{prop:lower}. Lowering the peaks slightly makes the required input inequalities strict while preserving every strict output failure, so the bounds also hold when testing only strict inputs.\n\\end{proof}", "source_section": "8", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"cor:weaklower\", \"proof_included_in_record\": true}"}
{"id": "theorem-20-thm-twentyninths", "record_type": "theorem", "title": "A quantitative strong-input barrier at two", "content": "\\begin{theorem}[A quantitative strong-input barrier at two]\\label{thm:twentyninths}\nFor every $d\\ge3,n\\ge d+3$,\n\\[\n P^{\\rm str}_{d,n}(2)>\\frac{20}{9}.\n\\]\n\\end{theorem}\n\n\\begin{proof}\nUse the three exceptional bases $U=C\\cup135$, $Z_1=C\\cup126$, $Z_2=C\\cup346$. Assign\n\\[\n c_U=3999,\\quad c_{Z_1}=c_{Z_2}=1,\\quad\n c_S=5000\\ (6\\in S\\text{ otherwise}),\\quad\n c_S=1000\\ (6\\notin S\\text{ otherwise}).\n\\]\nThis is Lemma~\\ref{lem:uniform} at $q=2$, root peak $\\sqrt{3999/1000}<2$, root low $1/\\sqrt{5000}<1/2$, followed by scaling label six by five and globally by $1000$. Hence all genuine strong input inequalities are strict.\n\nThe merged coefficients are $g_{12}=g_{34}=1001$, $g_{14}=g_{23}=g_{24}=6000$, and $g_{13}=8999$. Divide their three products by $10^6$ to obtain\n\\[\n A=\\frac{26997}{500},\\qquad B=36,\\qquad D=\\frac{1002001}{1000000}.\n\\]\nExact integer-power comparisons give\n\\[\n A^9>\\left(\\frac{6019}{1000}\\right)^{20},\\quad\n 36^9<\\left(\\frac{5016}{1000}\\right)^{20},\\quad\n D^9<\\left(\\frac{1001}{1000}\\right)^{20}.\n\\]\nFor a short manual or executable check, multiply each inequality by its positive denominators. For example, the first is exactly\n$26997^9\\,1000^{20}>6019^{20}\\,500^9$; the other two are equally direct integer comparisons. They imply\n\\[\n A^{9/20}-B^{9/20}-D^{9/20}>\\frac{2}{1000}>0.\n\\]\nThus the fixed strict input fails at output parameter $20/9$. Continuity in the output parameter gives failure on a nonempty interval above $20/9$, proving the strict inequality for the infimal universal repair parameter. All selected relations are unchanged by extra ground labels.\n\\end{proof}", "source_section": "8", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:twentyninths\", \"proof_included_in_record\": true}"}
{"id": "theorem-21-thm-classification", "record_type": "theorem", "title": "Weighted set-map classification", "content": "\\begin{theorem}[Weighted set-map classification]\\label{thm:classification}\nThe following are equivalent:\n\\begin{enumerate}\n\\item For every strong $\\T_q$ rank-$d$ input, $A_{\\phi,w}$ is zero or strong over $\\T_q$.\n\\item For every strong $\\T_q$ rank-$d$ input, $A_{\\phi,w}$ is zero or weak over $\\T_q$.\n\\item Either $\\phi|_{E_+}$ is injective, or $m\\le d+1$.\n\\end{enumerate}\nWhen condition 3 fails, failure can be witnessed by a positive uniform input on the original ground set, with every genuine input inequality strict.\n\\end{theorem}\n\n\\begin{proof}\nCondition 1 implies 2. If the active map is injective, the operation is deletion, positive rescaling, and relabeling; strong representability is preserved, unless every rank-$d$ term is deleted. If $m\\le d+1$, any nonzero rank-$d$ array on these labels is strong: for $m=d$ it has at most one basis, and for $m=d+1$ every strong relation has only its two identical terms. Its support is a matroid, since complements of the possible bases are the nonloops of a rank-one matroid. For $m<d$ the squarefree output is zero. This proves 3 implies 1.\n\nSuppose instead that $\\phi$ has a collision and $m\\ge d+2$. Choose two active labels in one fiber and call them $5,6$. Choose four other distinct fibers and representatives $1,2,3,4$. Choose a further $d-3$ distinct fibers with representatives $C$. The total number of used output labels is $d+2$, so these choices are possible.\n\nApply Theorem~\\ref{thm:explicit} on the entire original ground set with this distinguished configuration. Rescale each active variable by $1/w_i$. Additionally rescale every active variable outside the chosen $d+3$ labels by a parameter $\\lambda>0$. Input positivity and strictness are preserved. In the limit $\\lambda\\to0$, the six output coefficients of the selected weak relation converge to \\eqref{eq:six}; contributions involving any additional element of the same output fibers vanish. Inactive variables contribute nothing. The limiting output relation fails by at least $L/2$, so it still fails for all sufficiently small positive $\\lambda$. This contradicts condition 2 and proves necessity. Every input coefficient remains positive for such $\\lambda$, as asserted.\n\\end{proof}", "source_section": "9", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:classification\", \"proof_included_in_record\": true}"}
{"id": "corollary-22-a-guaranteed-rule-for-repeated-squarefree-merging", "record_type": "corollary", "title": "A guaranteed rule for repeated squarefree merging", "content": "\\begin{corollary}[A guaranteed rule for repeated squarefree merging]\nStart 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\n\\[\n p=2^k\\max\\{q,1\\}.\n\\]\nFor $d=2$ the better parameter $\\max\\{q,1\\}$ suffices after any number of such steps.\n\\end{corollary}\n\n\\begin{proof}\nEach squarefree shadow remains positive on the new uniform support, and its weak tests are among the full output weak tests just proved. Iterate Theorem~\\ref{thm:repair}; in degree two iterate $r\\mapsto\\max\\{r,1\\}$ instead.\n\\end{proof}", "source_section": "9", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"\", \"proof_included_in_record\": true}"}
{"id": "theorem-23-thm-lorentz", "record_type": "theorem", "title": "Interior Lorentzian obstruction", "content": "\\begin{theorem}[Interior Lorentzian obstruction]\\label{thm:lorentz}\nPartition $[6]$ as $P=\\{1,3\\}$, $Q=\\{2,4,6\\}$, and $\\{s\\}=\\{5\\}$. For $t>1$ and $0<\\delta<1$, put\n\\[\n a=3-\\delta,\\qquad h=4-t^{-2}-\\delta.\n\\]\nAssign the twenty cubic coefficients by the following exhaustive composition classes:\n\\begin{center}\n\\begin{tabular}{lrrrrrr}\n\\toprule\nClass & $PPs$ & $QQQ$ & $PPQ$ & $sQQ$ & $PsQ$ & $PQQ$\\\\\nNumber & 1 & 1 & 3 & 3 & 6 & 6\\\\\nCoefficient & $a$ & $h$ & 1 & 1 & $t$ & $t$\\\\\\bottomrule\n\\end{tabular}\n\\end{center}\nEvery active derivative Hessian has signature $(1,4)$. The strong relation indexed by $I=P$ and $J=Q\\cup\\{s\\}$ has product list $(ah,1,1,1)$. Therefore any parameter $p$ containing all Lorentzian $U_{3,6}$ coefficient arrays among strong $\\T_p$ arrays must satisfy\n\\[\n p\\ge\\log_3 12.\n\\]\n\\end{theorem}\n\n\\begin{proof}\nAll coefficients are positive. Symmetry reduces the six active Hessians to three types; the quotient matrices below use orthonormal constant vectors on their symmetry blocks.\n\nFor differentiation in $s$, the quotient on $P,Q$ is\n\\[\n \\begin{pmatrix}a&\\sqrt6t\\\\\\sqrt6t&2\\end{pmatrix}.\n\\]\nIts determinant $2a-6t^2$ is negative, giving one positive and one negative eigenvalue. The other three modes have eigenvalues $-a,-1,-1$.\n\nFor differentiation in a member of $P$, the symmetry blocks have sizes $1,1,3$, and the quotient is\n\\[\n \\begin{pmatrix}\n 0&a&\\sqrt3\\\\ a&0&\\sqrt3t\\\\ \\sqrt3&\\sqrt3t&2t\n \\end{pmatrix}.\n\\]\nIts determinant is $2at\\delta>0$ and the sum of its principal two-by-two minors is $-a^2-3-3t^2<0$. Thus its three nonzero eigenvalues have one positive and two negative signs: their product is positive, while the all-positive possibility is excluded by the negative sum of pairwise products. The other two modes are $-t,-t$.\n\nFor differentiation in a member of $Q$, the symmetry blocks have sizes $2,2,1$, and the quotient is\n\\[\n \\begin{pmatrix}\n 1&2t&\\sqrt2t\\\\ 2t&h&\\sqrt2\\\\ \\sqrt2t&\\sqrt2&0\n \\end{pmatrix}.\n\\]\nIts determinant is $2t^2\\delta>0$ and the sum of its principal two-by-two minors is $h-6t^2-2<0$. Again it has one positive and two negative eigenvalues. The other two modes are $-1,-h$. This proves signature $(1,4)$ in every case.\n\nIn the specified strong relation, the $s$ term is $c_{PPs}c_{QQQ}=ah$; each of the other three terms is $c_{PPQ}c_{sQQ}=1$. Strong nullity requires $(ah)^{1/p}\\le3$, so $p\\ge\\log_3(ah)$. Let $\\delta\\downarrow0$ and $t\\to\\infty$ to obtain $p\\ge\\log_3 12$.\n\\end{proof}", "source_section": "10", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"thm:lorentz\", \"proof_included_in_record\": true}"}
{"id": "corollary-24-cor-lorentzbox", "record_type": "corollary", "title": "A robust four-level integer certificate", "content": "\\begin{corollary}[A robust four-level integer certificate]\\label{cor:lorentzbox}\nTake $t=2$, $\\delta=1/4$, and multiply every coefficient by four. The six coefficient classes become\n\\[\n 11,\\quad14,\\quad4,\\quad4,\\quad8,\\quad8.\n\\]\nThis Lorentzian array fails strong $\\T_2$; moreover every coefficient perturbation of absolute size at most $1/1000$ retains both properties within the multi-affine coefficient space.\n\\end{corollary}\n\n\\begin{proof}\nThe strong product list is $(154,16,16,16)$, and $154>144=(4+4+4)^2$ proves failure. Exact active-Hessian determinants, in variable order, are\n\\[\n 11264,\\ 7168,\\ 11264,\\ 7168,\\ 52096,\\ 7168.\n\\]\nEach maximum absolute row sum is at most $35$. All eigenvalues therefore have absolute value at most $35$, while the determinant product implies every absolute eigenvalue is at least $7168/35^4$. A perturbation of the twenty coefficients by at most $\\eps=1/1000$ changes each active Hessian by operator norm at most $4\\eps$, because each row has only four off-diagonal entries. The exact inequality\n$4/1000<7168/35^4$ prevents any eigenvalue from crossing zero, so the active signatures remain $(1,4)$.\n\nThe worst permitted strong-product comparison still has positive squared excess:\n\\[\n (11-\\eps)(14-\\eps)-9(4+\\eps)^2\n =10-97\\eps-8\\eps^2>0.\n\\]\nAll coefficients remain positive. This gives the stated explicit relative open box.\n\\end{proof}", "source_section": "10", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"cor:lorentzbox\", \"proof_included_in_record\": true}"}
{"id": "lemma-25-lem-support", "record_type": "lemma", "title": "M-convex support under merging", "content": "\\begin{lemma}\\label{lem:support}\nThe image of a matroid's basis indicators under one coordinate merge is M-convex.\n\\end{lemma}\n\n\\begin{proof}\nLet $\\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 integer vectors\n\\[\n x\\ge0,\\qquad x(H)=d,\\qquad x(A)\\le f(A)\\quad(A\\subseteq H).\n\\]\nNecessity is immediate. Conversely, every unmerged $x_i\\le1$. Let $S$ be the unmerged labels with $x_i=1$, and put $k=x_z\\le2$. The inequalities imply that $S$ is independent and $r_M(S\\cup\\{u,v\\})\\ge d$. Thus $S$ extends to a basis using exactly $k=d-|S|$ elements of $\\{u,v\\}$, as required.\n\nWe prove symmetric exchange for these vectors. Let $x_i>y_i$. Tight sets for $x$ are closed under unions and intersections by submodularity, as are tight sets for $y$. Let $U$ be the union of all $x$-tight sets avoiding $i$ (including the empty set), and $V$ the intersection of all $y$-tight sets containing $i$ (including $H$). Then $i\\in V\\setminus U$. An exchange $x-e_i+e_j$ preserves all upper inequalities if $j\\notin U$; $y+e_i-e_j$ does so if $j\\in V$. Integer slack makes every inequality that is not tight harmless.\n\nTightness and submodularity give\n\\[\n x(V\\setminus U)\\le f(U\\cup V)-f(U)\n \\le f(V)-f(U\\cap V)\\le y(V\\setminus U).\n\\]\nSince $x_i>y_i$, some $j\\in V\\setminus U$ has $x_j<y_j$. Both exchanged vectors are therefore feasible nonnegative integer vectors. This is M-convexity.\n\\end{proof}", "source_section": "A", "verification_method": "written_mathematical_proof", "verification_status": "proof_included", "artifact_paths": ["paper/Ilyoxune_Aggregation_Theorem.pdf", "paper/Ilyoxune_Aggregation_Theorem.tex"], "payload_json": "{\"content_format\": \"latex\", \"latex_label\": \"lem:support\", \"proof_included_in_record\": true}"}