Khintchine inequality
id:
khintchine-inequality-14-41895
title:
Khintchine inequality
text:
In mathematics, the Khintchine inequality, named after Aleksandr Khinchin and spelled in multiple ways in the Latin alphabet, is a theorem from probability, and is also frequently used in analysis. Heuristically, it says that if we pick N complex numbers x 1 , … , x N ∈ C , and add them together each multiplied by a random sign ± 1 , then the expected value of the sum's modulus, or the modulus it will be closest to on average, will be not too far off from | x 1 | 2 + ⋯ + | x N | 2 .
brand slug:
wiki
category slug:
encyclopedia
description:
Theorem in probability
original url:
https://en.wikipedia.org/wiki/Khintchine_inequality
date created:
date modified:
2024-01-30T06:00:48Z
main entity:
{"identifier":"Q6401711","url":"https://www.wikidata.org/entity/Q6401711"}
image:
fields total:
13
integrity:
14