# OCME · Knowledge & practice explorer

302 MKO / 1,441 families / 360 batches / 36,000 questions.

36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training.

1 results; page 1/1.

## Question 20550: A Lower Bound Still Needs Greatestness to Be the Infimum

- ID: `q-20261014-advance-20261107-r02-supremum-and-infimum-0075`; number: 20550
- Processing: second_context_reviewed
- MKO: [mko-supremum-and-infimum](/en/mko/mko-supremum-and-infimum/)
- Family: [qf-mod38-supinf-lower-bound-greatestness](/en/explore/?family=qf-mod38-supinf-lower-bound-greatestness)
- Batch: [batch-20261014-advance-20261107-r02-supremum-and-infimum-foundations](/en/explore/?batch=batch-20261014-advance-20261107-r02-supremum-and-infimum-foundations)
- [Derivation](/en/questions/q-20261014-advance-20261107-r02-supremum-and-infimum-0075/) / [Markdown](/en/questions/q-20261014-advance-20261107-r02-supremum-and-infimum-0075/index.md) / [JSON](/data/question-derivations/questions/q-20261014-advance-20261107-r02-supremum-and-infimum-0075.json)

