Triple

T16474843
Position Surface form Disambiguated ID Type / Status
Subject Tychonoff theorem for products of compact spaces E400161 entity
Predicate equivalentTo P6530 FINISHED
Object full Tychonoff theorem E400161 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: full Tychonoff theorem | Statement: [Tychonoff theorem for products of compact spaces, equivalentTo, full Tychonoff theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: full Tychonoff theorem
Context triple: [Tychonoff theorem for products of compact spaces, equivalentTo, full Tychonoff theorem]
  • A. Tychonoff theorem for products of compact spaces chosen
    The Tychonoff theorem for products of compact spaces is a fundamental result in topology stating that any product of compact topological spaces is compact, a statement that is equivalent in strength to the axiom of choice.
  • B. Tychonoff space
    A Tychonoff space is a topological space that is both completely regular and Hausdorff, forming a central class in general topology with strong separation and embedding properties.
  • C. Alexandrov–Hausdorff theorem
    The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
  • D. Ultrafilter lemma
    The ultrafilter lemma is a set-theoretic principle weaker than the full Axiom of Choice that guarantees every filter can be extended to an ultrafilter and underlies several key results in topology and analysis.
  • E. Stone–Čech compactification
    The Stone–Čech compactification is a construction in topology that associates to any topological space a universal, maximally extensive compact Hausdorff space into which it densely embeds.
  • 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_69d883813098819084f5409539723b59 completed April 10, 2026, 4:58 a.m.
NER Named-entity recognition batch_69e32dd32e048190a9eadd32d6b9374c completed April 18, 2026, 7:08 a.m.
NED1 Entity disambiguation (via context triple) batch_6a00581c24508190b4888357828fed80 completed May 10, 2026, 10:04 a.m.
Created at: April 10, 2026, 5:13 a.m.