Skip to main content
OCMEBilingual mathematics & derivations繁體中文

OCME · Bilingual mathematics & derivations

First Extended Atlas Slice: Topology, Number Theory, Decision Problems, and Formal Statements

On this page
  1. Set
  2. Set operations
  3. Natural number
  4. Arithmetic operations
  5. Proposition
  6. Function mapping
  7. Topological space
  8. Natural-number divisibility
  9. Greatest common divisor and coprimality
  10. Prime natural number
  11. Natural-number congruence modulo a positive modulus
  12. Decision problem
  13. Formal statements in a proof assistant

Complete seven traceable knowledge objects in dependency order on the existing number-system and function foundations.

This is a suggested learning sequence, not a universal logical dependency or a formal proof.

  1. Stage 1 · required

    Set

    Existing canonical prerequisite for the new objects in this pulse.

  2. Stage 1 · required

    Set operations

    Existing canonical prerequisite for the new objects in this pulse.

  3. Stage 1 · required

    Natural number

    Existing canonical prerequisite for the new objects in this pulse.

  4. Stage 1 · required

    Arithmetic operations

    Existing canonical prerequisite for the new objects in this pulse.

  5. Stage 1 · required

    Proposition

    Existing canonical prerequisite for the new objects in this pulse.

  6. Stage 1 · required

    Function mapping

    Existing canonical prerequisite for the new objects in this pulse.

  7. Stage 2 · optional

    Topological space

    A topological space consists of an underlying set and a family of open sets containing the empty set and whole space and closed under arbitrary unions and finite intersections.

  8. Stage 3 · optional

    Natural-number divisibility

    A natural number a divides b when a natural multiplier k satisfies b=a·k; the two roles of zero must be distinguished.

  9. Stage 4 · optional

    Greatest common divisor and coprimality

    The natural number gcd(a,b) divides both a and b and is divisible by every common divisor; the inputs are coprime when their gcd is 1.

  10. Stage 5 · optional

    Prime natural number

    A prime natural number is at least 2 and has no positive divisors other than 1 and itself.

  11. Stage 6 · optional

    Natural-number congruence modulo a positive modulus

    For a fixed positive modulus n, two natural numbers a and b are congruent modulo n when they have the same remainder on division by n.

  12. Stage 7 · optional

    Decision problem

    A decision problem specifies an input set X and a yes-instance subset Y⊆X; a decider must terminate on every legal input and return the correct Boolean answer.

  13. Stage 8 · optional

    Formal statements in a proof assistant

    A formal statement is a core term of type Prop obtained by successful elaboration in a fixed version, import environment and local context.

Path source & status

path-pulse-foundations-20261018 · candidate

Original paths JSON