Skip to main content
skill CX Codex

sigma-algebras — Claude Code skill: measure theory algorithms

sigma-algebras — a skill for solving sigma-algebra problems in measure theory.

MIT ★ 3,951 updated 2026-01-26

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill sigma-algebras -a claude-code
Open on GitHub

What sigma-algebras does

The skill organizes problem-solving into four workflows. First, verify sigma-algebra axioms: the whole space is measurable, closure under complements, and closure under countable unions. Second, generate the smallest sigma-algebra containing a given collection using the Dynkin pi-lambda theorem. Third, check function measurability by verifying that preimages of open sets or intervals lie in the sigma-algebra. Fourth, construct product sigma-algebras and confirm that projections remain measurable.

Z3 commands prove axioms and the Dynkin theorem formally. SymPy simplifies expressions involving preimages and set operations. Both run via uv run python -m runtime.harness with the relevant script and formula. Needs Python and uv as a dependency manager.

What it helps with

  • verify sigma-algebra axioms for a collection of sets
  • find the smallest sigma-algebra containing a given family
  • check whether a function is measurable
  • construct a product of two sigma-algebras
  • apply Dynkin's theorem to establish uniqueness

Example prompts for the agent

  • Verify the trivial sigma-algebra {∅, S} satisfies all axioms: uv run python -m runtime.harness scripts/z3_solve.py prove "X_in_F and closed_under_complement and closed_under_countable_union"
  • Simplify a preimage formula: uv run python -m runtime.harness scripts/sympy_compute.py simplify "f_inv(A_union_B) == f_inv(A) | f_inv(B)"
  • Apply the Dynkin pi-lambda theorem: uv run python -m runtime.harness scripts/z3_solve.py prove "pi_system_subset_lambda implies sigma_equal"

How to install sigma-algebras

1Skills CLI (Vercel)

npx skills add parcadei/Continuous-Claude-v3 --skill sigma-algebras -a claude-code

2Manually: put the files in place

~/.claude/skills/sigma-algebras/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/sigma-algebras/

Step by step, with commands for each platform: How to install skills in Claude Code: five ways

Questions about sigma-algebras

How do I install sigma-algebras in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill sigma-algebras -a claude-code. Documentation is in ~/.claude/skills/sigma-algebras/SKILL.md.

What does the sigma-algebras skill do?

It provides methods to verify sigma-algebra axioms, generate the minimal sigma-algebra from a collection, check function measurability, and build product sigma-algebras.

Which tools does the skill include?

Z3 for formal proofs of properties (axioms, Dynkin theorem) and SymPy for symbolic computation with preimages and set operations.

Source text

SKILL.md · MIT
---
name: sigma-algebras
description: "Problem-solving strategies for sigma algebras in measure theory"
allowed-tools: [Bash, Read]
---

# Sigma Algebras

## When to Use

Use this skill when working on sigma-algebras problems in measure theory.

## Decision Tree


1. **Verify sigma-algebra axioms**
   - X in F (whole space is measurable)
   - A in F implies A^c in F (closed under complements)
   - A_n in F implies union(A_n) in F (closed under countable unions)
   - `z3_solve.py prove "sigma_algebra_axioms"`

2. **sigma-algebra generation**
   - Start with generating collection C
   - sigma(C) = smallest sigma-algebra containing C
   - Use Dynkin's pi-lambda theorem for uniqueness

3. **Measurability verification**
   - f is measurable if f^{-1}(B) in F for all Borel B
   - Sufficient: check for open sets or intervals
   - `sympy_compute.py simplify "preimage(f, interval)"`

4. **Product sigma-algebras**
   - F1 x F2 = sigma{A x B : A in F1, B in F2}
   - Projections are measurable


## Tool Commands

### Z3_Sigma_Axioms
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "X_in_F and closed_under_complement and closed_under_countable_union"
```

### Z3_Dynkin_Pi_Lambda
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "pi_system_subset_lambda implies sigma_equal"
```

### Sympy_Preimage
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "f_inv(A_union_B) == f_inv(A) | f_inv(B)"
```

## Key Techniques

*From indexed textbooks:*

- [Statistical Inference (George Casella... (Z-Library)] PROBABILITY THEORY Definition 1. A collection of subsets of S is called a sigma algebra (or Borel field), denoted by B, if it satisfies the following three properties: a. B (the empty set is an element of B).
- [Measure, Integration  Real Analysis (... (Z-Library)] S T is the smallest s-algebra containing the measurable rectangles). S T The technique outlined above should be used when possible. However, in some situations there seems to be no reasonable way to verify that the collection of sets with the desired property is a s-algebra.
- [Statistical Inference (George Casella... (Z-Library)] Thus, again by property (b), N2, A; € B. Associated with sample space § we can have many different sigma algebras. For example, the collection of the two sets {#, S} is a sigma algebra, usually called the trivial sigma algebra.
- [Real Analysis (Halsey L. Royden, Patr... (Z-Library)] Proposition 13 Let F be a collection of subsets of a set X. Then the intersection A of all σ-algebras of subsets of X that contain F is a σ-algebra that contains F. Moreover, it is the smallest σ-algebra of subsets of X that contains F, in the sense that any σ-algebra that contains F also contains A.
- [Real Analysis (Halsey L. Royden, Patr... (Z-Library)] Let M be the collection of subsets of X that are either countable or have a countable complement in X. For E ∈ M, dene µ(E) = 0 if E is countable and µ(E) = 1, if E has a countable complement. Is this measure space complete?

## Cognitive Tools Reference

See `.claude/skills/math-mode/SKILL.md` for full tool documentation.

© parcadei · MIT · parcadei/Continuous-Claude-v3

Similar skills

All skills for AI and ML →

From the same set161

The whole set →
opc-architecture opc-architecture provides Claude Code with an architectural overview of Orchestrated Parallel Claude, detailing hooks, child processes, and PostgreSQL state sharing. CX Codex +1 ★ 3,951repo stars modular-code The modular-code skill guides Python file splits around meaningful boundaries. Use it when a file mixes concerns or has become awkward to navigate and test. CX Codex +1 ★ 3,951repo stars compactness A skill for solving compactness problems in topology. Checks whether spaces are compact, applies the Heine-Borel and Tychonoff theorems, and computes consequences of compactness. CX Codex +1 ★ 3,951repo stars source-coding source-coding — a skill for information theory problems: optimal coding, Shannon entropy, Huffman codes, and data compression. Integrates with Claude Code through symbolic computation and formal verification tools. CX Codex +1 ★ 3,951repo stars validate-agent Subagent validates technical decisions in a plan against current best practices and past precedent. Run it before implementation to catch outdated approaches and risks. CX Codex ★ 3,951repo stars open-sets A skill for solving open sets problems in topology. Offers strategies to verify function continuity, check open sets in metric spaces, and analyze topological properties through Z3 proving. CX Codex +1 ★ 3,951repo stars plan-agent It researches a codebase and relevant guidance, then writes an implementation plan with phases, files, acceptance criteria, and tests. Use it to map out a feature before changing the project. CX Codex ★ 3,951repo stars sleuth sleuth — a subagent that systematically debugs issues by forming diagnostic questions, tracing code paths, analyzing logs, and documenting findings in a structured report. CX Codex ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open