Triple

T13686344
Position Surface form Disambiguated ID Type / Status
Subject Pierre-Louis Lions E328137 entity
Predicate notableWork P4 FINISHED
Object concentration-compactness principle
The concentration-compactness principle is a fundamental method in nonlinear analysis that overcomes loss-of-compactness issues in variational problems, especially those involving critical exponents.
E1054397 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: concentration-compactness principle | Statement: [Pierre-Louis Lions, notableWork, concentration-compactness principle]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: concentration-compactness principle
Context triple: [Pierre-Louis Lions, notableWork, concentration-compactness principle]
  • A. Rellich–Kondrachov compactness theorem
    The Rellich–Kondrachov compactness theorem is a fundamental result in functional analysis and the theory of Sobolev spaces that guarantees the compactness of certain embedding operators, playing a key role in the study of partial differential equations.
  • B. Cheeger–Gromov compactness theorem
    The Cheeger–Gromov compactness theorem is a fundamental result in Riemannian geometry that gives conditions under which a sequence of Riemannian manifolds has a subsequence converging (in the Gromov–Hausdorff or smooth sense) to a limit space.
  • C. Poincaré inequality
    The Poincaré inequality is a fundamental result in functional analysis and partial differential equations that bounds the average oscillation of a function by the size of its gradient, playing a key role in Sobolev space theory and the study of elliptic problems.
  • D. Sobolev inequality
    The Sobolev inequality is a fundamental result in functional analysis and partial differential equations that bounds the size of a function in certain Lebesgue spaces by the size of its derivatives, enabling key embedding and regularity properties.
  • E. Morawetz inequalities
    Morawetz inequalities are fundamental energy and decay estimates in the study of partial differential equations, especially wave and dispersive equations, that provide control over the long-time behavior of solutions.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: concentration-compactness principle
Triple: [Pierre-Louis Lions, notableWork, concentration-compactness principle]
Generated description
The concentration-compactness principle is a fundamental method in nonlinear analysis that overcomes loss-of-compactness issues in variational problems, especially those involving critical exponents.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: concentration-compactness principle
Target entity description: The concentration-compactness principle is a fundamental method in nonlinear analysis that overcomes loss-of-compactness issues in variational problems, especially those involving critical exponents.
  • A. Rellich–Kondrachov compactness theorem
    The Rellich–Kondrachov compactness theorem is a fundamental result in functional analysis and the theory of Sobolev spaces that guarantees the compactness of certain embedding operators, playing a key role in the study of partial differential equations.
  • B. Cheeger–Gromov compactness theorem
    The Cheeger–Gromov compactness theorem is a fundamental result in Riemannian geometry that gives conditions under which a sequence of Riemannian manifolds has a subsequence converging (in the Gromov–Hausdorff or smooth sense) to a limit space.
  • C. Poincaré inequality
    The Poincaré inequality is a fundamental result in functional analysis and partial differential equations that bounds the average oscillation of a function by the size of its gradient, playing a key role in Sobolev space theory and the study of elliptic problems.
  • D. Sobolev inequality
    The Sobolev inequality is a fundamental result in functional analysis and partial differential equations that bounds the size of a function in certain Lebesgue spaces by the size of its derivatives, enabling key embedding and regularity properties.
  • E. Morawetz inequalities
    Morawetz inequalities are fundamental energy and decay estimates in the study of partial differential equations, especially wave and dispersive equations, that provide control over the long-time behavior of solutions.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69d8076f1fa8819094664a59b55010df completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbc670968881908e2b4fdf656c7285 completed April 12, 2026, 4:21 p.m.
NED1 Entity disambiguation (via context triple) batch_69f7944981ec8190be5ff39b7c2c70ab completed May 3, 2026, 6:30 p.m.
NEDg Description generation batch_69f795e361c48190b37060312e7df181 completed May 3, 2026, 6:37 p.m.
NED2 Entity disambiguation (via description) batch_69f796e5c60c8190a19389bc4cdbd658 completed May 3, 2026, 6:41 p.m.
Created at: April 9, 2026, 9:53 p.m.