Grothendieck inequality

E254132

The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.

All labels observed (4)

How this entity was disambiguated

Statements (49)

Predicate Object
instanceOf mathematical inequality
result in functional analysis
theorem in analysis
appliedIn communication complexity
quantum information theory
centralTo local theory of Banach spaces
theory of operator spaces
characterizes boundedness of certain bilinear forms on product of Banach spaces
concerns bilinear forms
bounded linear operators
tensor norms
field Banach space theory
approximation algorithms
functional analysis
operator theory
theoretical computer science
hasApplication design of constant-factor approximation algorithms
hardness of approximation results
hasConsequence factorization results for operators
structural results in Banach space theory
hasOpenProblem exact value of the complex Grothendieck constant
exact value of the real Grothendieck constant
hasVariant complex Grothendieck inequality
noncommutative Grothendieck inequality
Grothendieck inequality self-linksurface differs
surface form: real Grothendieck inequality

vector-valued Grothendieck inequality
implies bounds on norms of bilinear forms
equivalence of certain tensor norms
introducedBy Alexander Grothendieck
introducedInContext study of tensor products of Banach spaces
involvesConstant Grothendieck inequality self-linksurface differs
surface form: Grothendieck constant

complex Grothendieck constant
real Grothendieck constant
namedAfter Alexander Grothendieck
relatedTo Khinchin–Kahane type inequalities
surface form: Khintchine inequality

Grothendieck inequality self-linksurface differs
surface form: Little Grothendieck theorem

Pisier’s factorization theorems
relatesTo Banach spaces
Hilbert spaces
operator ideals
tensor products of Banach spaces
studiedIn analysis of Boolean functions
metric embedding theory
timePeriod mid 20th century
type inequality comparing discrete and continuous optimization
usedIn approximation algorithms for combinatorial optimization
approximation of cut problems
approximation of quadratic forms over discrete domains
semidefinite programming based algorithms

How these facts were elicited

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

Alexander Grothendieck notableConcept Grothendieck inequality
Grothendieck inequality hasVariant Grothendieck inequality self-linksurface differs
this entity surface form: real Grothendieck inequality
Grothendieck inequality involvesConstant Grothendieck inequality self-linksurface differs
this entity surface form: Grothendieck constant
Grothendieck inequality relatedTo Grothendieck inequality self-linksurface differs
this entity surface form: Little Grothendieck theorem