Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1401.7545

Infinite Computations and the Generic Finite

Louis H. Kauffman
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces the concept of a generic finite set, and points out that a consistent and significant interpretation of the grossone notation of Yarolslav D. Sergeyev is that of a generic natural number. This means that the grossone is not itself a natural number, yet it can be treated as one and used in the generic expression of finite sets and finite formulas, giving a new power to algebra and algorithms that embody this usage. We further consider the concept of infinity in categories. An object A in a given category C is said to be infinite relative to that category if and only if there is a injection from A to A in C that is not a surjection. In the category of sets this recovers the usual notion of infinity. In other categories, an object may be non-infinite (whence finite) while its underlying set (if it has one) is infinite. The computational methodology due to Yarolslav D. Sergeyev for executing numerical calculations with infinities and infinitesimals is considered from this categorical point of view.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Louis H. Kauffman. 2014-04-22. Infinite Computations and the Generic Finite. https://arxiv.org/abs/1401.7545

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

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
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. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗