arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2608.30571math.OC

关于两个二次(不)等式系统不可解性的最后两块拼图

Last two pieces of the puzzle for unsolvability of a system of two quadratic (in)equalities

Min-Chi Wang, Ruey-Lin Sheu, Huu-Quang Nguyen

首次发表
浏览论文内容

中文总结 AI 辅助

本文针对两个二次(不)等式系统不可解性的两个开放情形——非齐次Calabi定理与非齐次(严格)Finsler引理,通过定理和算法给出了解答。

中文摘要 AI 辅助

给定两个二次函数 \\( f(x) = x^T Ax + 2a^T x + a_0 \\) 和 \\( g(x) = x^T Bx + 2b^T x + b_0 \\),每个函数分别对应严格不等式(\\(<0\\))、非严格不等式(\\(\leq 0\\))或等式(\\(=0\\)),研究该联合系统是否存在解是一个基本问题。对于齐次二次系统(\\(a=b=0,~a_0=b_0=0\\)),从1936年的Finsler引理到1990年的Yuan择一定理,所有满足 \\(\star \\) 和 \\(\\#\\) 属于 \\(\{<,\leq,=\}\\) 的组合,其 \\(\{x\in \mathbb{R} ^n\mid x^T Ax \mathbin{\star } 0\}\cap \{x\in \mathbb{R} ^n\mid x^T Bx \mathbin{\\#} 0\}\subset \{0\}\\) 不可解性,均已证明存在 \\(A\\) 和 \\(B\\) 的正定或正半定矩阵束。对于非齐次二次系统 \\(\{x\in \mathbb{R} ^n\mid f(x) \mathbin{\star } 0\}\cap \{x\in \mathbb{R} ^n\mid g(x) \mathbin{\\#} 0\}=\emptyset \\),已有部分情形得到推广。仍有两个具有挑战性的开放情形:确定 \\(\{f(x)=0\}\cap \{g(x)=0\}=\emptyset \\) 的非齐次Calabi定理;以及判断 \\(\{f(x)\leq 0\}\cap \{g(x)=0\}=\emptyset \\) 的非齐次(严格)Finsler引理。本文通过定理和算法给出了这两个问题的解答。

英文摘要

Given two quadratic functions \( f(x) = x^T Ax + 2a^T x + a_0 \) and \( g(x) = x^T Bx + 2b^T x + b_0 ,\) each associated with either the strict inequality ($<0$); non-strict inequality ($\leq 0$); or the equality ($=0$), it is a fundamental question to ask whether or not the joint system has a solution. For homogeneous quadratic systems ($a=b=0,~a_0=b_0=0$), starting from Finsler's lemma in 1936 until Yuan's alternative lemma in 1990, all combinations of the unsolvability for $\{x\in \mathbb{R} ^n\mid x^T Ax \mathbin{\star } 0\}\cap \{x\in \mathbb{R} ^n\mid x^T Bx \mathbin{\#} 0\}\subset \{0\}$, where $\star $ and $\#$ can be any of $\{<,\leq ,=\}$, have been shown to possess either a positive definite or a positive semi-definite matrix pencil of $A$ and $B.$ Extensions to nonhomogeneous quadratic systems $\{x\in \mathbb{R} ^n\mid f(x) \mathbin{\star } 0\}\cap \{x\in \mathbb{R} ^n\mid g(x) \mathbin{\#} 0\}=\emptyset $ have been done for several cases already. Two challenging cases remain open: the nonhomogeneous Calabi Theorem which determines when $\{f(x)=0\}\cap \{g(x)=0\}=\emptyset $; and the nonhomogeneous (strict) Finsler lemma to determine whether $\{f(x)\leq 0\}\cap \{g(x)=0\}=\emptyset .$ The paper provides the answers to both, in theorems and algorithms.

发表机构

  • National Cheng Kung University(国立成功大学)
  • Vinh University(荣市大学)

机构由 AI 辅助整理,请以论文原文为准。

↑