Triple

T16474849
Position Surface form Disambiguated ID Type / Status
Subject Tychonoff theorem for products of compact spaces E400161 entity
Predicate relatedTo P37 FINISHED
Object Boolean prime ideal theorem
The Boolean prime ideal theorem is a set-theoretic principle weaker than the full axiom of choice that guarantees the existence of prime ideals in Boolean algebras and has important applications in topology, logic, and algebra.
E1215846 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: Boolean prime ideal theorem | Statement: [Tychonoff theorem for products of compact spaces, relatedTo, Boolean prime ideal theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Boolean prime ideal theorem
Context triple: [Tychonoff theorem for products of compact spaces, relatedTo, Boolean prime ideal theorem]
  • A. Krull’s principal ideal theorem
    Krull’s principal ideal theorem is a fundamental result in commutative algebra that relates the height of prime ideals containing a principal ideal to the Krull dimension of the ring.
  • B. Hilbert’s Nullstellensatz
    Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
  • C. Hausdorff maximal principle
    The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
  • D. Tychonoff theorem for products of compact spaces
    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.
  • E. Lasker–Noether theorem on primary decomposition
    The Lasker–Noether theorem on primary decomposition is a fundamental result in commutative algebra stating that every ideal in a Noetherian ring can be expressed as a finite intersection of primary ideals, generalizing the factorization of integers into prime powers.
  • 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: Boolean prime ideal theorem
Triple: [Tychonoff theorem for products of compact spaces, relatedTo, Boolean prime ideal theorem]
Generated description
The Boolean prime ideal theorem is a set-theoretic principle weaker than the full axiom of choice that guarantees the existence of prime ideals in Boolean algebras and has important applications in topology, logic, and algebra.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Boolean prime ideal theorem
Target entity description: The Boolean prime ideal theorem is a set-theoretic principle weaker than the full axiom of choice that guarantees the existence of prime ideals in Boolean algebras and has important applications in topology, logic, and algebra.
  • A. Krull’s principal ideal theorem
    Krull’s principal ideal theorem is a fundamental result in commutative algebra that relates the height of prime ideals containing a principal ideal to the Krull dimension of the ring.
  • B. Hilbert’s Nullstellensatz
    Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
  • C. Hausdorff maximal principle
    The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
  • D. Tychonoff theorem for products of compact spaces
    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.
  • E. Lasker–Noether theorem on primary decomposition
    The Lasker–Noether theorem on primary decomposition is a fundamental result in commutative algebra stating that every ideal in a Noetherian ring can be expressed as a finite intersection of primary ideals, generalizing the factorization of integers into prime powers.
  • 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_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_6a004f5f238881909b5f2fb41da3f932 completed May 10, 2026, 9:26 a.m.
NEDg Description generation batch_6a00509164cc8190a381ba0a1de95ed1 completed May 10, 2026, 9:32 a.m.
NED2 Entity disambiguation (via description) batch_6a005447f1948190a939c0051891e444 completed May 10, 2026, 9:47 a.m.
Created at: April 10, 2026, 5:13 a.m.