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

OCME · Bilingual mathematics & derivations

Wave6 Roots: Group Actions, Real Bounds, Topological Bases, Markov, Pigeonholes, Euler and Subsequences

On this page
  1. Finite group
  2. Function mapping
  3. Set
  4. Real number
  5. Usual order on the real numbers
  6. Quantifiers and explicit domains
  7. Topological space
  8. Open and closed sets
  9. Set operations
  10. Real random variables on finite sample spaces
  11. Expectation in finite models
  12. Probability on finite sample spaces
  13. Basic counting principles
  14. Cardinality comparison of sets
  15. Euler totient function
  16. Greatest common divisor and coprimality
  17. Natural-number congruence modulo a positive modulus
  18. Natural-number powers and principal square roots
  19. Sequence
  20. Injectivity and distinct inputs
  21. Finite group action
  22. Supremum and infimum
  23. Topological basis
  24. Markov inequality
  25. Pigeonhole principle
  26. Euler's theorem in number theory
  27. Subsequence

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

    Existing canonical prerequisite for the new objects in this pulse.

  2. Stage 1 · required

    Function mapping

    Existing canonical prerequisite for the new objects in this pulse.

  3. Stage 1 · required

    Set

    Existing canonical prerequisite for the new objects in this pulse.

  4. Stage 1 · required

    Real number

    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

    Quantifiers and explicit domains

    Existing canonical prerequisite for the new objects in this pulse.

  7. Stage 1 · required

    Topological space

    Existing canonical prerequisite for the new objects in this pulse.

  8. Stage 1 · required

    Open and closed sets

    Existing canonical prerequisite for the new objects in this pulse.

  9. Stage 1 · required

    Set operations

    Existing canonical prerequisite for the new objects in this pulse.

  10. Stage 1 · required

    Real random variables on finite sample spaces

    Existing canonical prerequisite for the new objects in this pulse.

  11. Stage 1 · required

    Expectation in finite models

    Existing canonical prerequisite for the new objects in this pulse.

  12. Stage 1 · required

    Probability on finite sample spaces

    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

    Euler totient function

    Existing canonical prerequisite for the new objects in this pulse.

  16. Stage 1 · required

    Greatest common divisor and coprimality

    Existing canonical prerequisite for the new objects in this pulse.

  17. Stage 1 · required

    Natural-number congruence modulo a positive modulus

    Existing canonical prerequisite for the new objects in this pulse.

  18. Stage 1 · required

    Natural-number powers and principal square roots

    Existing canonical prerequisite for the new objects in this pulse.

  19. Stage 1 · required

    Sequence

    Existing canonical prerequisite for the new objects in this pulse.

  20. Stage 1 · required

    Injectivity and distinct inputs

    Existing canonical prerequisite for the new objects in this pulse.

  21. Stage 2 · optional

    Finite group action

    An action of a finite group on a finite set is a total action table satisfying the identity and multiplication-compatibility laws.

  22. Stage 3 · optional

    Supremum and infimum

    For a nonempty appropriately bounded real set, the supremum is its least upper bound and the infimum its greatest lower bound; either need not belong to the set.

  23. Stage 4 · optional

    Topological basis

    A topological basis generates a topology through carrier coverage and pointwise local intersection refinement.

  24. Stage 5 · optional

    Markov inequality

    For a nonnegative random variable with finite expectation, its tail probability at a positive threshold is at most E[X] divided by that threshold.

  25. Stage 6 · optional

    Pigeonhole principle

    A total map from a larger finite domain into a smaller finite codomain sends two distinct source elements to the same value.

  26. Stage 7 · optional

    Euler's theorem in number theory

    For n≥2 and gcd(a,n)=1, a^phi(n) is congruent to1 modulo n.

  27. Stage 8 · optional

    Subsequence

    A subsequence selects terms by a strictly increasing natural-index map and preserves their original order.

Path source & status

path-pulse-foundations-20261107 · candidate

Original paths JSON