Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.15529

Lemniscate of Leaf Function

Kazunori Shinohara
View original source ↗Read source document ↗Export metadata ↓

Abstract

A lemniscate is a curve defined by two foci, F1 and F2. If the distance between the focal points of F1 - F2 is 2a (a: constant), then any point P on the lemniscate curve satisfy the equation PF1 PF2 = a^2. Jacob Bernoulli first described the lemniscate in 1694. The Fagnano discovered the double angle formula of the lemniscate(1718). The Euler extended the Fagnano's formula to a more general addition theorem(1751). The lemniscate function was subsequently proposed by Gauss around the year 1800. These insights are summarized by Jacobi as the theory of elliptic functions. A leaf function is an extended lemniscate function. Some formulas of leaf functions have been presented in previous papers; these included the addition theorem of this function and its application to nonlinear equations. In this paper, the geometrical properties of leaf functions at n = 2 and the geometric relation between the angle theta and lemniscate arc length l are presented using the lemniscate curve. The relationship between the leaf functions sleaf2(l) and cleaf2(l) is derived using the geometrical properties of the lemniscate, similarity of triangles, and the Pythagorean theorem. In the literature, the relation equation for sleaf2(l) and cleaf2(l) (or the lemniscate functions, sl(l) and cl(l)) has been derived analytically; however, it is not derived geometrically.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kazunori Shinohara. 2021-01-05. Lemniscate of Leaf Function. https://doi.org/10.32604/cmes.2021.012383

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. Liu proposed the conjecture \[ \sum_{\text{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \ge 2+\left(\frac{2r}{R}\right)^k,\qquad k>1, \] with the reverse inequality for $k<1$. We prove this conjecture by reducing it to an algebraic inequality for three positive variables with prescribed sum and product. We also determine the equality cases.

math.GM↗
arXiv2026

A quadratic critical-value conjecture for the fifth Bessel moment

We conjecture an explicit evaluation of the pure fifth Bessel moment $\int_0^\infty K_0(t)^5\,dt$ as a quadratic expression in the critical value $L(f,2)$ of the weight-three, level-60 newform $f$ (LMFDB orbit 60.3.b.a) identified in the twisted fifth-moment modularity theorem of Lim, Tu and Yu, with coefficients in $\mathbb{Q}(\sqrt{5})$ and the square taken before the real and imaginary parts. Directed interval computations, using no stored Bessel or $L$-values, bound the absolute discrepancy by $10^{-358}$. We prove three exact modular identities for $f$: the Petersson-norm formula $\langle f,f\rangle_{60} = \frac{3(5-\sqrt{5})}{2π^4}|L(f,2)|^2$, the coefficient-conjugation relation $L(f^σ,2) = κL(f,2)$ with explicit $κ\in \mathbb{Q}(\sqrt{5},i)$, and the twisted symmetric-square evaluation $L(χ_{-4}\mathrm{Sym}^2 f,2) = \sqrt{15}\,π^2 \langle f,f\rangle_{60}$, together with $L(χ_{-4}\mathrm{Sym}^2 f,3) = π^4\langle f,f\rangle_{60}/8$, in the full Euler-factor normalization of Lim, Tu and Yu. The last identity shows that the companion norm conjecture $D_{5,\mathrm{odd}} = \frac{3\sqrt{15}(5-\sqrt{5})}{2}|L(f,2)|^2$ is equivalent to the symmetric-square conjecture $D_{5,\mathrm{odd}} = π^2 L(χ_{-4}\mathrm{Sym}^2 f,2)$ of Lim, Tu and Yu, while the exact relation $D_{5,\mathrm{even}} = π^2 D_{5,\mathrm{odd}}/(2\sqrt{15})$ follows from Chuang's period formulas. Every Bessel-to-modular equality, including the individual-period formula, remains conjectural. Complete proofs, exact rational certificates and verification programs are included as ancillary files.

math.GM↗