菲洛最短线段问题的对偶问题
The dual of Philo's shortest line segment problem
AI总结:
研究菲洛最短线段问题的对偶问题,提出基于多元微积分和初等几何的解决方案,探索与三角形角平分线的联系,推广至lₚ范数并分析特殊情况,指出部分中线/陪位中线非最优解并提出开放问题。
摘要:
我们研究菲洛最短线段问题的对偶问题,寻找经过两个给定点、具有公共端点且另一端点在给定直线上的最优线段。该问题在点线交换意义下与古希腊用于解决倍立方问题的著名问题对偶。所提供的解决方案采用多元微积分和初等几何方法,探索了与三角形角平分线的有趣联系。提出了使用lₚ(p≥1)范数的问题推广,并研究了p=∞的特殊情况。结果表明,在p=0和p=2的情况下,三角形的中线和陪位中线分别并不总是对应优化问题的解。p≠1的一般情况及相关问题被列为开放问题。
英文摘要:
We study the dual of Philo's shortest line segment problem and find the optimal line segments passing through two given points, with a common endpoint, and with the other endpoints on a given line. This problem is dual, in a point-and-line-exchanging sense, to a famous problem of antiquity used to solve the problem of duplicating the cube. The provided solution uses multivariable calculus and elementary geometry methods. Interesting connections with the angle bisector of the triangle are explored. A generalization of the problem using $l_p$ ($p\ge 1$) norm is proposed. The particular case $p=\infty$ is also studied. It is shown that in the cases $p=0$ and $p=2$ the median and the symedian, respectively, of a triangle do not always give a solution for the corresponding optimization problems. The general case $p\ne 1$ and related problems are proposed as open problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。