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

OCME · Bilingual mathematics & derivations

Wave6 Second Layer: Orbits, Monotone Limits, Subspace Topology, Chebyshev, Inclusion-Exclusion, Prime Factorization and Digraphs

On this page
  1. Finite group action
  2. Equivalence class
  3. Supremum and infimum
  4. Sequence limits and exact tail cutoffs
  5. Usual order on the real numbers
  6. Topological space
  7. Subset
  8. Topological basis
  9. Markov inequality
  10. Variance in finite probability models
  11. Absolute value
  12. Set operations
  13. Basic counting principles
  14. Cardinality comparison of sets
  15. Mathematical induction
  16. Prime natural number
  17. Natural-number divisibility
  18. Euclidean algorithm
  19. Greatest common divisor and coprimality
  20. Binary relations and set projections
  21. Set
  22. Orbit of a finite group action
  23. Monotone bounded sequence convergence theorem
  24. Subspace topology
  25. Chebyshev inequality
  26. Inclusion-exclusion principle
  27. Unique prime factorization of integers
  28. Finite directed graph

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

    Finite group action

    Existing canonical prerequisite for the new objects in this pulse.

  2. Stage 1 · required

    Equivalence class

    Existing canonical prerequisite for the new objects in this pulse.

  3. Stage 1 · required

    Supremum and infimum

    Existing canonical prerequisite for the new objects in this pulse.

  4. Stage 1 · required

    Sequence limits and exact tail cutoffs

    Existing canonical prerequisite for the new objects in this pulse.

  5. Stage 1 · required

    Usual order on the real numbers

    Existing canonical prerequisite for the new objects in this pulse.

  6. Stage 1 · required

    Topological space

    Existing canonical prerequisite for the new objects in this pulse.

  7. Stage 1 · required

    Subset

    Existing canonical prerequisite for the new objects in this pulse.

  8. Stage 1 · required

    Topological basis

    Existing canonical prerequisite for the new objects in this pulse.

  9. Stage 1 · required

    Markov inequality

    Existing canonical prerequisite for the new objects in this pulse.

  10. Stage 1 · required

    Variance in finite probability models

    Existing canonical prerequisite for the new objects in this pulse.

  11. Stage 1 · required

    Absolute value

    Existing canonical prerequisite for the new objects in this pulse.

  12. Stage 1 · required

    Set operations

    Existing canonical prerequisite for the new objects in this pulse.

  13. Stage 1 · required

    Basic counting principles

    Existing canonical prerequisite for the new objects in this pulse.

  14. Stage 1 · required

    Cardinality comparison of sets

    Existing canonical prerequisite for the new objects in this pulse.

  15. Stage 1 · required

    Mathematical induction

    Existing canonical prerequisite for the new objects in this pulse.

  16. Stage 1 · required

    Prime natural number

    Existing canonical prerequisite for the new objects in this pulse.

  17. Stage 1 · required

    Natural-number divisibility

    Existing canonical prerequisite for the new objects in this pulse.

  18. Stage 1 · required

    Euclidean algorithm

    Existing canonical prerequisite for the new objects in this pulse.

  19. Stage 1 · required

    Greatest common divisor and coprimality

    Existing canonical prerequisite for the new objects in this pulse.

  20. Stage 1 · required

    Binary relations and set projections

    Existing canonical prerequisite for the new objects in this pulse.

  21. Stage 1 · required

    Set

    Existing canonical prerequisite for the new objects in this pulse.

  22. Stage 2 · optional

    Orbit of a finite group action

    The images of one point under all group elements form its orbit; all orbits partition the point carrier.

  23. Stage 3 · optional

    Monotone bounded sequence convergence theorem

    A nondecreasing real sequence bounded above converges to the supremum of its terms; the nonincreasing bounded-below version converges to the infimum.

  24. Stage 4 · optional

    Subspace topology

    For Y⊆X, the relative topology consists of every intersection of an ambient open set with Y.

  25. Stage 5 · optional

    Chebyshev inequality

    For a variable with finite mean and variance, the probability of absolute deviation at least epsilon is at most variance/epsilon^2.

  26. Stage 6 · optional

    Inclusion-exclusion principle

    The union cardinality of a finite indexed set family is the alternating sum of intersection sizes over every nonempty index subset.

  27. Stage 7 · optional

    Unique prime factorization of integers

    Every positive integer n>1 has a prime factorization whose prime multiset is unique up to factor order.

  28. Stage 8 · optional

    Finite directed graph

    Under the loop-free simple convention, a finite digraph has a finite vertex carrier and an ordered-pair edge set without loops or duplicate same-direction edges.

Path source & status

path-pulse-foundations-20261108 · candidate

Original paths JSON