Triple

T736577
Position Surface form Disambiguated ID Type / Status
Subject Minkowski inequality E14946 entity
Predicate statement P4223 FINISHED
Object For sequences (x_k),(y_k) in ℓ^p, (∑|x_k + y_k|^p)^{1/p} ≤ (∑|x_k|^p)^{1/p} + (∑|y_k|^p)^{1/p} E14946 NE FINISHED

How this triple was built (2 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: For sequences (x_k),(y_k) in ℓ^p, (∑|x_k + y_k|^p)^{1/p} ≤ (∑|x_k|^p)^{1/p} + (∑|y_k|^p)^{1/p} | Statement: [Minkowski inequality, statement, For sequences (x_k),(y_k) in ℓ^p, (∑|x_k + y_k|^p)^{1/p} ≤ (∑|x_k|^p)^{1/p} + (∑|y_k|^p)^{1/p}]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: For sequences (x_k),(y_k) in ℓ^p, (∑|x_k + y_k|^p)^{1/p} ≤ (∑|x_k|^p)^{1/p} + (∑|y_k|^p)^{1/p}
Context triple: [Minkowski inequality, statement, For sequences (x_k),(y_k) in ℓ^p, (∑|x_k + y_k|^p)^{1/p} ≤ (∑|x_k|^p)^{1/p} + (∑|y_k|^p)^{1/p}]
  • A. Minkowski inequality chosen
    The Minkowski inequality is a fundamental result in functional analysis and measure theory that generalizes the triangle inequality to L^p spaces, providing a key tool for studying norms and integrable functions.
  • B. Berry–Esseen theorem
    The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
  • C. Riemann–Lebesgue lemma
    The Riemann–Lebesgue lemma is a fundamental result in Fourier analysis stating that the Fourier coefficients (or transform) of an integrable function vanish at infinity.
  • D. Minkowski functional
    The Minkowski functional is a mathematical tool in functional analysis that assigns a nonnegative real number to each vector in a vector space based on its position relative to a given convex, balanced, absorbing set, generalizing the notion of a norm.
  • E. Minkowski sum
    The Minkowski sum is a fundamental operation in geometry and convex analysis that combines two sets by adding every vector in one set to every vector in the other, widely used in areas such as optimization, robotics, and computational geometry.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69a4934d9930819099eed80096b0597d completed March 1, 2026, 7:28 p.m.
NER Named-entity recognition batch_69a4a5da30b88190afbd12ae6109cc1b completed March 1, 2026, 8:47 p.m.
NED1 Entity disambiguation (via context triple) batch_69a64a618c248190ab1bcecba04d3da8 completed March 3, 2026, 2:41 a.m.
Created at: March 1, 2026, 7:37 p.m.