본문으로 건너뛰기
cccskills
무료GitHub에 공개

sigma-algebras

Work through measure theory problems involving sigma algebras, collections of sets closed under complements and countable unions. The skill outlines approaches to checking axioms, generating these collections, testing measurability, and studying products, with supporting tool commands.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

원문원문 설명 보기

Problem-solving strategies for sigma algebras in measure theory

설치 방법 보기

이럴 때 유용합니다

  • Checking whether a collection satisfies sigma-algebra axioms
  • Finding the sigma algebra generated by a collection
  • Checking a function's measurability through preimages
  • Studying product sigma algebras and projections

포함된 파일(1)

  • SKILL.md3.1 KB

SKILL.md(원문)

설치하기 전에 에이전트에게 전달되는 지시 내용을 확인할 수 있습니다.

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

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

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

Sympy_Preimage

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.

리뷰

아직 리뷰가 없습니다. 사용해 본 소감을 남겨 주세요.

댓글

로그인 없이 쓸 수 있습니다. 사용 후기, 질문, 작동하지 않은 환경 등을 편하게 남겨 주세요.

아직 댓글이 없습니다. 첫 댓글을 남겨 보세요.

보내면 바로 공개됩니다. 이메일 주소나 전화번호 같은 개인 정보는 쓰지 마세요. URL은 2개까지입니다.

0 / 1,000자

이 양식은 reCAPTCHA로 보호되며 Google 개인정보처리방침 및 서비스 약관이 적용됩니다.

같은 저장소의 스킬

Coordinate background agents through saved files, keeping lengthy work transcripts out of the main conversation. It defines how to pass results between agents, monitor progress, and verify completed work with tests.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

  • Keeping long agent transcripts out of the main conversation
  • Passing research and plans between agents through files
  • Checking for stalled background agents
parcadei/Continuous-Claude-v33.9천2026년 1월 27일 업데이트

Delegate implementation, file reading, and testing to separate agents, then bring concise summaries back to the main conversation. The rules explain when delegation helps and when a small edit is better handled directly.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

  • Implementing a feature across multiple files
  • Completing a specific phase of an implementation plan
  • Delegating feature development and testing
parcadei/Continuous-Claude-v33.9천2026년 1월 27일 업데이트

Organize implementation work across research, planning, validation, implementation, and review agents. Each stage passes files to the next, while implementation starts with failing tests and the main conversation coordinates the workflow.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

  • Dividing implementation work among specialized agents
  • Checking a plan against research before implementation
  • Writing failing tests before implementing changes
parcadei/Continuous-Claude-v33.9천2026년 1월 27일 업데이트

Connect Agentica SDK agents to Claude Code CLI through a proxy, an intermediary server. Use setup and debugging guidance to address file permissions, streamed responses, result formatting, and agents reporting success without performing the requested operations.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

  • Connecting Agentica agents to Claude Code tools
  • Investigating file write and edit permission errors
  • Debugging streaming and REPL response formats
parcadei/Continuous-Claude-v33.9천2026년 1월 27일 업데이트

Consult Agentica APIs when building workflows where multiple AI agents cooperate. This reference covers eleven coordination patterns, agent tracking, shared state, handoffs, and ways to combine results, with pointers to detailed API specifications.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

  • Choose a coordination pattern for multiple agents
  • Check pattern constructors and methods
  • Implement custom coordination patterns
parcadei/Continuous-Claude-v33.9천2026년 1월 27일 업데이트

Write clearer instructions for Agentica and REPL agents by specifying roles, file operations, and output formats. Includes templates for dividing research, coordinating specialists, reviewing solutions, and passing results between agents through files.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

  • Clarifying instructions for reading and editing files
  • Dividing research among multiple agents
  • Passing findings and plans between agents
parcadei/Continuous-Claude-v33.9천2026년 1월 27일 업데이트

parcadei의 스킬 모두 보기

이 스킬의 문제 신고