Skip to content

Three Separate Answers Are All Decided Where Something Is Tangent ── The Legendre transform's contact point solves f'(x)=p, giving x=2.500000 and a conjugate of 6.250000 at p=5 ── the common tangent touches at v=+/-1 with slope 0.300000000, and between them the curve falls below it at 0 points ── [Paper 507]

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

A transform, a bound and a phase coexistence are taken to be separate tools. This paper shows that all three have their answers decided where something is tangent──the location of the contact point is the answer. No new theorem or law is claimed. Scope of this paper (scope note): No new theorem or law is claimed──the Legendre transform, the Chernoff bound and the common-tangent construction are all standard. No convex analysis is written──subdifferentials, duality and general convex sets are not entered; only the smooth one-dimensional case. The equal-area rule is not computed──Maxwell’s equal-area rule is a statement on the pressure-volume curve, while this paper treats only the common tangent on the free energy. No thermodynamics is built──coexistence, latent heat and real equations of state are not the subject; one double-well function is used. A fourth was not counted──Gibbs’s variational principle is said to have the same shape, but no numbers are given for it here. Three were counted. Relation to earlier papers: Paper 487 showed that a stationary point comes in three kinds──that classifies what one-point tangency touches; this counts how many points it touches. Paper 486 showed that optima in three fields are one vertex──likewise a case of separate-looking answers arising from one operation. Paper 300 showed that a shared root can be decided──one-point and two-point tangency are distinct roots. Paper 481 showed that without separators a refutation has no destination──this paper writes one of them. What is added is placing the three contact points in one table, confirming the conjugate and the double transform numerically, confirming that the Chernoff contact point is ln(a/(1-a)), matching the common tangent to its exact solution at 10^-6, and writing the convexification test as a count of points falling below. First, the Legendre transform’s contact point solves f'(x)=p, giving x=2.500000 and a conjugate of 6.250000 at p=5 (Section 2). Second, for a convex function two transforms return the original──9.000000000 against 9.000000000 (Section 2). Third, the Chernoff bound’s best exponent is 0.082282879, matching the Kullback-Leibler divergence (Section 3). Fourth, its contact point is lambda^*=ln(a/(1-a))=0.847298──move off it and the exponent falls (Section 3). Fifth, this is the core of the paper. The common tangent touches at v=+/-1 with slope 0.300000000, and between them the curve falls below it at 0 points (Section 4). Sixth, the separator is whether the tangency is at one point or two (Section 5). A transform, a bound and a phase coexistence are taken to be separate tools──a change of variables in thermodynamics, an inequality in probability, a phase diagram of matter. But all three take a maximum or a minimum, and the condition for an extremum is tangency. The Legendre transform: tangent at one point──the conjugate of f(x)=x^2 is 1.000000 at p=2.0 and 6.250000 at p=5.0, matching the closed form p^2/4. The contact point at p=5.0 is x=2.500000, where f'(2.500000)=5.000000: at the maximiser the slope equals p. Two transforms return 9.000000000 against 9.000000000, because the function is convex and the family of tangents reconstructs it. So the transform recounts the tangents, moving from a set of points to a set of tangent lines, and the answer is fixed by where they touch. The Chernoff bound: choosing the tangent exponent──for a fair coin at a=0.7, the best lambda is 0.847300 and the best exponent 0.082282879, matching the Kullback-Leibler divergence. The contact point matches ln(a/(1-a))=0.847298, differing only by the scan’s step of 10^-5. At lambda=0 the bound is 0.000000000000 and says nothing, the other side of the boundary. Away from the best lambda the exponent falls to 0.062460777 at half and 0.016145752 at double. The Legendre transform is at work here too: the conjugate of the cumulant generating function, whose contact point is the best lambda. The common tangent: tangent at two points──for g(v)=(v^2-1)^2+0.3v, numerical and exact agree on contact points v=+/-1, slope 0.300000000, residual 2.393x10^-10. Adding the line 0.3v does not move the contact points; only the slope becomes 0.3. The slopes agree at two points separated by 2.000000, so this is not one point of tangency but two. Between them the curve never falls below the tangent, at 0 points: a convexification, the interval where two phases coexist. Change the slope to 1.5 times and 3358 points fall below, the deepest at -0.300000, so the test responds to the slope. One thing separates them──is the tangency at one point, or at two. At one, the answer is a number, and moving the contact point moves the answer. At two, the answer is an interval, throughout which the same slope is shared. The two are distinct roots by the criterion of Paper 300: both are “decided where something is tangent”, but one returns a point and the other an interval. Paper 487 divided the one-point side into minimum, maximum and degenerate──that classifies what the tangency touches, while this counts how many points it touches, a two-level classification. It has the shape of Paper 486 too, where separate-looking answers arose from one operation. This is one of the separators of Paper 481: when an optimisation gives the wrong answer, whether the contact point was misidentified or one- and two-point tangency were confused sends the repair elsewhere. To be honest──three were counted, and the equal-area rule was not computed. Maxwell’s rule is a statement on the pressure-volume curve, and its correspondence with the common tangent on the free energy is known but not verified numerically here. Gibbs’s variational principle is said to have the same shape, and no numbers are given for it either. On the making of this work: The ideas and content of this work stem from the author's own considerations. Assistance from an AI (a large language model) was used for structuring, English translation, and checking the algebra. Any remaining errors or misinterpretations are solely the author's. Feedback and corrections are sincerely appreciated. Keywords: Legendre transform, Chernoff bound, common tangent construction, convex analysis, duality. ----- 変換と限界と相共存は、別々の道具だと思われている。本稿が示すのは、三つとも答が「接する」ところで決まっていることである──接点の位置が、そのまま答になる。新しい定理も法則も主張しない。 本稿の射程(射程注記):新しい定理も法則も主張しない──ルジャンドル変換、チャーノフ限界、共通接線構成は、いずれも標準的である。凸解析を書かない──劣微分、双対性、一般の凸集合には立ち入らない。滑らかな一変数の場合だけを見る。等面積則を計算していない──マクスウェルの等面積則は圧力体積曲線の側の言明であり、本稿は自由エネルギー側の共通接線だけを扱う。熱力学を作らない──相共存、潜熱、実在の状態方程式は主題ではない。二重井戸の関数を一つ置くだけである。四つ目を数えていない──ギブズの変分原理も同じ形だと言われるが、本稿は数を出していない。数えたのは三つである。既刊との関係:論文487 は停留点が最小・最大・縮退の三通りあると示した──あちらは一点で接する場合の分類、こちらは接する点の数そのものである。論文486 は三つの分野の最適点が同じ頂点だと示した──同じく、別々に見える答が一つの操作から出る場合である。論文300 は同根か別根かが判定できると示した──一点接触と二点接触は別根である。論文481 は分離子が無いと反証の行き先が決まらないと示した──本稿はその分離子を一本書く。加えたのは、三つの接点を同じ表に置いたこと、ルジャンドルの共役と二回変換を数で確かめたこと、チャーノフの接点が ln(a/(1-a)) だと確かめたこと、共通接線を厳密解と 10^-6 で突き合わせたこと、凸化の判定を「下に落ちる点の数」で書いたことである。 第一に、ルジャンドル変換の接点は f'(x)=p の解で、p=5 なら x=2.500000、共役は 6.250000 である(第2節)。 第二に、凸関数なら二回変換で戻る──9.000000000 対 9.000000000(第2節)。 第三に、チャーノフ限界の最良の指数は 0.082282879 で、KL ダイバージェンスに一致する(第3節)。 第四に、その接点は lambda^*=ln(a/(1-a))=0.847298 である──ずらすと指数が下がる(第3節)。 第五に、これが本稿の芯である。共通接線は v=+/-1、傾き 0.300000000 で、その間で曲線は接線より下に 0 点しか落ちない(第4節)。 第六に、分離子は「一点で接するか、二点で接するか」である(第5節)。 変換と限界と相共存は、別々の道具だと思われている──熱力学の変数変換、確率の不等式、物質の相図。分野も目的も違うという像である。だが三つとも最大か最小を取っており、最大の条件は接することである。ルジャンドル変換 ── 一点で接する──f(x)=x^2 の共役は p=2.0 で 1.000000、p=5.0 で 6.250000 となり、閉じた式 p^2/4 に一致する。接点は p=5.0 で x=2.500000、そこで f'(2.500000)=5.000000 となり、最大を取った点で傾きが p になっている。二回変換すると 9.000000000 対 9.000000000 で元に戻る。凸関数だからで、接線の族が関数を復元している。つまり変換は接線を数えなおす操作で、点の集まりから接線の集まりへ移り、答は接点の位置が決めている。チャーノフ限界 ── 接する指数を選ぶ──フェアコインで a=0.7 のとき、最良の lambda は 0.847300、最良の指数は 0.082282879 で、KL ダイバージェンス 0.082282879 に一致する。接点は閉じた式 ln(a/(1-a))=0.847298 に一致し、差は走査の刻み 10^-5 による。 lambda=0 では 0.000000000000 となって何も言っていない不等式になり、境目の反対側である。最良でない lambda では指数が下がり、半分で 0.062460777、2 倍で 0.016145752 と、どちらも下回る。ここでもルジャンドル変換が働いており、キュムラント母関数の共役の接点が最良の lambda である。共通接線 ── 二点で接する──g(v)=(v^2-1)^2+0.3v の共通接線は、数値でも厳密でも接点 v=+/-1、傾き 0.300000000、残差 2.393x10^-10 である。直線 0.3v を足しても接点は動かず、傾きだけが 0.3 になる。二点で傾きが一致しており、一点で接しているのではなく間隔 2.000000 の二点である。その間で曲線は接線より下に 0 点しか落ちず、凸化になっていて、二つの相が共存する区間である。傾きを 1.5 倍にすると 3358 個が下に落ち、最深 -0.300000──検査が傾きに反応している。分けているものは一つ──接するのが一点か、二点か。一点なら答は一つの数で、接点が動けば答も動く。二点なら答は一つの区間で、その間ではどこにいても同じ傾きを共有する。二つは論文300 の基準で別根であり、どちらも「接するところで決まる」が、一方は点を返し一方は区間を返す。返す物の型が違う。論文487 は一点接触の側を最小・最大・縮退の三つに分けた。あちらは接した先の形、こちらは接した点の数で、二段の分類になっている。論文486 とも同じ形で、三つの分野の最適点が同じ頂点だったように、別々に見える答が一つの操作から出る。これは論文481 でいう分離子の一本で、「最適化の答が合わない」という報告が来たとき、接点を取り違えたのか、一点接触と二点接触を混同したのかで直す先が違う。正直に言えば──数えたのは三つで、等面積則は計算していない。マクスウェルの等面積則は圧力体積曲線の側の言明で、自由エネルギー側の共通接線と対応することは知られているが、本稿はその対応を数で確かめていない。ギブズの変分原理も同じ形だと言われるが、これも数を出していない。 作成にあたって:本稿の着想と内容は、著者自身の考察に基づくものです。文章の構成整理や英訳、数式の確認には AI(大規模言語モデル)の助力を得ました。最終的な内容の解釈や誤りがあれば、それらはすべて著者の責に帰します。お気づきの点があれば、ご教示いただければ幸いです。 キーワード:ルジャンドル変換、チャーノフ限界、共通接線、凸解析、双対性。

View source

Similar papers

#computer vision Open access Jun 2016

Software Development in Startup Companies: The Greenfield Startup Model

The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.

Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al. · 178 citations · ⚡14
#computer vision Open access Oct 2016

Software Startups - A Research Agenda

Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.

M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al. · 157 citations · ⚡17
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15
#computer vision Review Open access May 2015

A survey study on major technical barriers affecting the decision to adopt cloud services

The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.

Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al. · 111 citations · ⚡8
#computer vision Conference Open access Dec 2013

Affordable and Energy-Efficient Cloud Computing Clusters: The Bolzano Raspberry Pi Cloud Cluster Experiment

The ongoing work building a Raspberry Pi cluster consisting of 300 nodes is presented, with potential use cases being an inexpensive and green test bed for cloud computing research and a robust and mobile data center for operating in adverse environments.

P. Abrahamsson, S. Helmer, Nattakarn Phaphoom et al. · 110 citations · ⚡7
#computer vision Book Open access Mar 2017

On the Unhappiness of Software Developers

The results indicate that software developers are a slightly happy population, but the need for limiting the unhappiness of developers remains, and 219 factors representing causes of unhappiness while developing software are identified.

D. Graziotin, Fabian Fagerholm, Xiaofeng Wang et al. · 84 citations · ⚡6

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.