Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1111.0274

Mathematics of Knowledge Refinement: Probabilistic Arithmetic, with no unknowns and no infinity. Part I. Generalized Probabilistic Arithmetic. Basic definitions and properties

Mikhail Luboschinsky
View original source ↗Read source document ↗Export metadata ↓

Abstract

An approach to build Probabilistic Arithmetic in which initial values of all correlated random variables are known, but with varying degrees of accuracy. As a result of the proposed Probabilistic Arithmetic operations, variable values, degrees of their accuracy and correlations are refined. Probabilistic Generalized Addition (PGA) and Probabilistic Generalized Multiplication (PGM) operations on correlated random variables are defined and their basic properties identified and described: \bullet Proposed PGA and PGM operations possess inverse operations - subtraction and division. \bullet There is no difference between direct and inverse operations: addition and subtraction, multiplication and division (this is why these operations are called "Generalized"). \bullet Division by approximately zero is possible and the result never equals to \infty, making this approach promising in computational and computer mathematics. \bullet Unlike the usual hyperbola, which, when the argument is changing from + \infty to 0, has a gap at 0, the Generalized Probabilistic Hyperbola, under certain combination of initial accuracies, is continuous at 0. First, as the argument changes from +\infty to 0, it behaves like a typical hyperbola, monotonically increasing. However, after reaching certain maximum value, it starts to decrease to 0 monotonically. Last property gives a hope that the proposed approach might be promising in Quantum Physics, as it would allow a more adequate description of macro and micro physics, as well as of the transition from one to the other.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Mikhail Luboschinsky. 2011-11-01. Mathematics of Knowledge Refinement: Probabilistic Arithmetic, with no unknowns and no infinity. Part I. Generalized Probabilistic Arithmetic. Basic definitions and properties. https://arxiv.org/abs/1111.0274

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↗