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

OCME · Bilingual mathematics & derivations

Wave6 Twelfth Layer: CLT, SLLN, Confidence Coverage, Wilson, p-adic Valuations and Regular Languages

On this page
  1. Independent identically distributed sequence
  2. Convergence in distribution
  3. Expectation in finite models
  4. Variance in finite probability models
  5. Standard normal distribution
  6. Sigma-algebras and measure spaces
  7. Binomial theorem
  8. Almost-sure convergence
  9. Sampling distribution
  10. Statistical estimator
  11. Parametric statistical model
  12. Probability on finite sample spaces
  13. Usual order on the real numbers
  14. Prime natural number
  15. Natural-number congruence modulo a positive modulus
  16. Factorial
  17. Modular inverse
  18. Natural-number divisibility
  19. Unique prime factorization of integers
  20. Integer
  21. Absolute value
  22. Regular language
  23. Set
  24. Sequence
  25. Mathematical induction
  26. Deterministic finite automaton
  27. Mathematical proof
  28. Pigeonhole principle
  29. Quantifiers and explicit domains
  30. Central limit theorem for finite-variance IID sequences
  31. Strong law of large numbers for finite-valued IID sequences
  32. Confidence-interval coverage in a finite model
  33. Wilson theorem
  34. p-adic valuation of integers
  35. Regular expression
  36. Pumping lemma for regular languages

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

    Independent identically distributed sequence

    Existing canonical prerequisite for the new objects in this pulse.

  2. Stage 1 · required

    Convergence in distribution

    Existing canonical prerequisite for the new objects in this pulse.

  3. Stage 1 · required

    Expectation in finite models

    Existing canonical prerequisite for the new objects in this pulse.

  4. Stage 1 · required

    Variance in finite probability models

    Existing canonical prerequisite for the new objects in this pulse.

  5. Stage 1 · required

    Standard normal distribution

    Existing canonical prerequisite for the new objects in this pulse.

  6. Stage 1 · required

    Sigma-algebras and measure spaces

    Existing canonical prerequisite for the new objects in this pulse.

  7. Stage 1 · required

    Binomial theorem

    Existing canonical prerequisite for the new objects in this pulse.

  8. Stage 1 · required

    Almost-sure convergence

    Existing canonical prerequisite for the new objects in this pulse.

  9. Stage 1 · required

    Sampling distribution

    Existing canonical prerequisite for the new objects in this pulse.

  10. Stage 1 · required

    Statistical estimator

    Existing canonical prerequisite for the new objects in this pulse.

  11. Stage 1 · required

    Parametric statistical model

    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

    Usual order on the real numbers

    Existing canonical prerequisite for the new objects in this pulse.

  14. Stage 1 · required

    Prime natural number

    Existing canonical prerequisite for the new objects in this pulse.

  15. Stage 1 · required

    Natural-number congruence modulo a positive modulus

    Existing canonical prerequisite for the new objects in this pulse.

  16. Stage 1 · required

    Factorial

    Existing canonical prerequisite for the new objects in this pulse.

  17. Stage 1 · required

    Modular inverse

    Existing canonical prerequisite for the new objects in this pulse.

  18. Stage 1 · required

    Natural-number divisibility

    Existing canonical prerequisite for the new objects in this pulse.

  19. Stage 1 · required

    Unique prime factorization of integers

    Existing canonical prerequisite for the new objects in this pulse.

  20. Stage 1 · required

    Integer

    Existing canonical prerequisite for the new objects in this pulse.

  21. Stage 1 · required

    Absolute value

    Existing canonical prerequisite for the new objects in this pulse.

  22. Stage 1 · required

    Regular language

    Existing canonical prerequisite for the new objects in this pulse.

  23. Stage 1 · required

    Set

    Existing canonical prerequisite for the new objects in this pulse.

  24. Stage 1 · required

    Sequence

    Existing canonical prerequisite for the new objects in this pulse.

  25. Stage 1 · required

    Mathematical induction

    Existing canonical prerequisite for the new objects in this pulse.

  26. Stage 1 · required

    Deterministic finite automaton

    Existing canonical prerequisite for the new objects in this pulse.

  27. Stage 1 · required

    Mathematical proof

    Existing canonical prerequisite for the new objects in this pulse.

  28. Stage 1 · required

    Pigeonhole principle

    Existing canonical prerequisite for the new objects in this pulse.

  29. Stage 1 · required

    Quantifiers and explicit domains

    Existing canonical prerequisite for the new objects in this pulse.

  30. Stage 2 · optional

    Central limit theorem for finite-variance IID sequences

    An infinite IID sequence with common finite positive variance has centered sums scaled by sigma*sqrt(n) converging in distribution to the standard normal law.

  31. Stage 3 · optional

    Strong law of large numbers for finite-valued IID sequences

    The sample means of a finite-valued infinite IID sequence converge almost surely to the common expectation.

  32. Stage 4 · optional

    Confidence-interval coverage in a finite model

    Frequentist coverage is the repeated-sampling probability that a fixed interval-valued procedure covers each true parameter.

  33. Stage 5 · optional

    Wilson theorem

    An integer n>1 is prime exactly when (n−1)! is congruent to−1 modulo n.

  34. Stage 6 · optional

    p-adic valuation of integers

    For prime p and nonzero integer a, v_p(a) is the largest exponent of p dividing |a|; this node fixes v_p(0)=infinity.

  35. Stage 7 · optional

    Regular expression

    Regular expressions recursively build languages from the empty language, epsilon, alphabet symbols, union, concatenation and Kleene star.

  36. Stage 8 · optional

    Pumping lemma for regular languages

    Every regular language has a positive pumping length such that each sufficiently long member word has a split that remains in the language for every pump count.

Path source & status

path-pulse-foundations-20261118 · candidate

Original paths JSON