Jump to content

Talk:Classification theorem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 16:12, 30 January 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 2 deprecated parameters: field, historical.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Clarify; find reference

[edit]

complete set of invariants: invariants, e.g. a number, a cohomology group, a characteristic class, etc. can always tell objects apart, i.e. when two objects have different invariant the objects themselves are never in the same equivalence class, but in general not vice versa; a complete (set of) invariants are the ones that strengthens this condition to equivalence (from single-direction implication); e.g. "complete knot invariant", or more trivially just the objects themselves.

realizable: are they talking about https://ncatlab.org/nlab/show/realizability?

computable: they might be talking informally about "the invariants are easy to know", or in the sense of Computability theory. Fourier-Deligne Transgirl (talk) 03:01, 7 December 2023 (UTC)[reply]