isNotSimplyConnectedCompactly
P179348
predicate
Indicates that the entity has a topological structure that is compact but not simply connected, meaning it is bounded and closed yet contains nontrivial loops that cannot be continuously contracted to a point.
All labels observed (1)
| Label | Occurrences |
|---|---|
| isNotSimplyConnectedCompactly canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: isNotSimplyConnectedCompactly
Generated description
Indicates that the entity has a topological structure that is compact but not simply connected, meaning it is bounded and closed yet contains nontrivial loops that cannot be continuously contracted to a point.
Sample triples (1)
| Subject | Object |
|---|---|
| S^2 × R geometry | compact quotients have infinite fundamental group ⓘ |