[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6NVDCDSTWV3V2A0DSHPHQRS":3,"skill-same:01M6NVDCDSTWV3V2A0DSHPHQRS":56},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":27,"linkOnly":28,"markdownContent":29,"markdownBody":30,"frontMatter":31,"refName":34,"commitSha":35,"skillDirectory":36,"forksCount":14,"repositoryHtmlUrl":37,"repositoryHomepageUrl":6,"ownerHtmlUrl":38,"ownerBlogUrl":39,"ownerDescription":40,"updatedAt":41,"install":42,"resources":55},"01M6NVDCDSTWV3V2A0DSHPHQRS","entropy",null,"Problem-solving strategies for entropy in information theory","rubicanjr\u002FFinCognis","rubicanjr","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F234912519?v=4","01M6NT156NND8J474G34SB3923","Rubi","01M6NT15B70RWXE1N3YV0BZY8A",0,"MIT","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Finformation-theory\u002Fentropy\u002FSKILL.md",[],[5,19,20,21,22,23,24,25,26],"Bash","read","problem-solving","strategies","information theory","problem","information","for","2026-11-10 10:12:30",false,"---\nname: entropy\ndescription: \"Problem-solving strategies for entropy in information theory\"\nallowed-tools: [Bash, Read]\n---\n\n# Entropy\n\n## When to Use\n\nUse this skill when working on entropy problems in information theory.\n\n## Decision Tree\n\n\n1. **Shannon Entropy**\n   - H(X) = -sum p(x) log2 p(x)\n   - Maximum for uniform distribution: H_max = log2(n)\n   - Minimum = 0 for deterministic (one outcome certain)\n   - `scipy.stats.entropy(p, base=2)` for discrete\n\n2. **Entropy Properties**\n   - Non-negative: H(X) >= 0\n   - Concave in p\n   - Chain rule: H(X,Y) = H(X) + H(Y|X)\n   - `z3_solve.py prove \"entropy_nonnegative\"`\n\n3. **Joint and Conditional Entropy**\n   - H(X,Y) = -sum sum p(x,y) log2 p(x,y)\n   - H(Y|X) = H(X,Y) - H(X)\n   - H(Y|X) \u003C= H(Y) with equality iff independent\n\n4. **Differential Entropy (Continuous)**\n   - h(X) = -integral f(x) log f(x) dx\n   - Can be negative!\n   - Gaussian: h(X) = 0.5 * log2(2*pi*e*sigma^2)\n   - `sympy_compute.py integrate \"-f(x)*log(f(x))\" --var x`\n\n5. **Maximum Entropy Principle**\n   - Given constraints, max entropy distribution is least biased\n   - Uniform for no constraints\n   - Exponential for E[X] = mu constraint\n   - Gaussian for E[X], Var[X] constraints\n\n\n## Tool Commands\n\n### Scipy_Entropy\n```bash\nuv run python -c \"from scipy.stats import entropy; p = [0.25, 0.25, 0.25, 0.25]; H = entropy(p, base=2); print('Entropy:', H, 'bits')\"\n```\n\n### Scipy_Kl_Div\n```bash\nuv run python -c \"from scipy.stats import entropy; p = [0.5, 0.5]; q = [0.9, 0.1]; kl = entropy(p, q); print('KL divergence:', kl)\"\n```\n\n### Sympy_Entropy\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"-p*log(p, 2) - (1-p)*log(1-p, 2)\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [Elements of Information Theory] Elements of Information Theory -- Thomas M_ Cover &amp; Joy A_ Thomas -- 2_, Auflage, New York, NY, 2012 -- Wiley-Interscience -- 9780470303153 -- 2fcfe3e8a16b3aeefeaf9429fcf9a513 -- Anna’s Archive. What is the channel capacity of this channel? This is the multiple\\-access channel solved by Liao and Ahlswede.\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n","# Entropy\n\n## When to Use\n\nUse this skill when working on entropy problems in information theory.\n\n## Decision Tree\n\n\n1. **Shannon Entropy**\n   - H(X) = -sum p(x) log2 p(x)\n   - Maximum for uniform distribution: H_max = log2(n)\n   - Minimum = 0 for deterministic (one outcome certain)\n   - `scipy.stats.entropy(p, base=2)` for discrete\n\n2. **Entropy Properties**\n   - Non-negative: H(X) >= 0\n   - Concave in p\n   - Chain rule: H(X,Y) = H(X) + H(Y|X)\n   - `z3_solve.py prove \"entropy_nonnegative\"`\n\n3. **Joint and Conditional Entropy**\n   - H(X,Y) = -sum sum p(x,y) log2 p(x,y)\n   - H(Y|X) = H(X,Y) - H(X)\n   - H(Y|X) \u003C= H(Y) with equality iff independent\n\n4. **Differential Entropy (Continuous)**\n   - h(X) = -integral f(x) log f(x) dx\n   - Can be negative!\n   - Gaussian: h(X) = 0.5 * log2(2*pi*e*sigma^2)\n   - `sympy_compute.py integrate \"-f(x)*log(f(x))\" --var x`\n\n5. **Maximum Entropy Principle**\n   - Given constraints, max entropy distribution is least biased\n   - Uniform for no constraints\n   - Exponential for E[X] = mu constraint\n   - Gaussian for E[X], Var[X] constraints\n\n\n## Tool Commands\n\n### Scipy_Entropy\n```bash\nuv run python -c \"from scipy.stats import entropy; p = [0.25, 0.25, 0.25, 0.25]; H = entropy(p, base=2); print('Entropy:', H, 'bits')\"\n```\n\n### Scipy_Kl_Div\n```bash\nuv run python -c \"from scipy.stats import entropy; p = [0.5, 0.5]; q = [0.9, 0.1]; kl = entropy(p, q); print('KL divergence:', kl)\"\n```\n\n### Sympy_Entropy\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"-p*log(p, 2) - (1-p)*log(1-p, 2)\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [Elements of Information Theory] Elements of Information Theory -- Thomas M_ Cover &amp; Joy A_ Thomas -- 2_, Auflage, New York, NY, 2012 -- Wiley-Interscience -- 9780470303153 -- 2fcfe3e8a16b3aeefeaf9429fcf9a513 -- Anna’s Archive. What is the channel capacity of this channel? This is the multiple\\-access channel solved by Liao and Ahlswede.\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n",{"name":5,"description":7,"allowed-tools":32},[19,33],"Read","main","70e1c350500ee750987420bbae48837afa906b7e","skills\u002Fmath\u002Finformation-theory\u002Fentropy","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis","https:\u002F\u002Fgithub.com\u002Frubicanjr","linktr.ee\u002Ffinanskodu","Industrial Engineer & CIO @FinansKodu. Architecting AI-driven financial agents and autonomous workflows. 🏗️ Building systems, not just prompts.","2026-06-09 13:50:15",{"source":8,"skillName":5,"commands":43,"prompt":53,"zipAvailable":54},[44,47,50],{"tool":45,"command":46},"npx","npx skills add rubicanjr\u002FFinCognis --skill entropy",{"tool":48,"command":49},"bunx","bunx skills add rubicanjr\u002FFinCognis --skill entropy",{"tool":51,"command":52},"pnpm","pnpm dlx skills add rubicanjr\u002FFinCognis --skill entropy","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Finformation-theory\u002Fentropy\u002FSKILL.md",true,[],[57,78,87,106,135,154],{"skillNo":58,"name":59,"nameZh":6,"description":60,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":61,"categories":62,"keywords":68,"publishedAt":27},"01M6NWS9DAXJTADT4T5MB49X8W","workflow-router","Goal-based workflow orchestration - routes tasks to specialist agents based on user goals","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fworkflow-router\u002FSKILL.md",[63],{"categoryNo":64,"categoryName":65,"taxonomyType":66,"taxonomyTypeDesc":67},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[69,70,71,72,73,74,75,76,77],"workflow router","workflow","router","orchestration","goals","goal","user","workflow orchestration","tasks",{"skillNo":79,"name":80,"nameZh":6,"description":81,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":82,"categories":83,"keywords":84,"publishedAt":27},"01M6NWS3RETSC0SHP16HP66E14","wiring","Wiring Verification","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwiring\u002FSKILL.md",[],[80,85,86],"verification","false",{"skillNo":88,"name":89,"nameZh":6,"description":90,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":91,"categories":92,"keywords":96,"publishedAt":27},"01M6NWS0XW9CVQZBDA1EGW0TWC","websocket-patterns","Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwebsocket-patterns\u002Fskill.md",[93],{"categoryNo":94,"categoryName":95,"taxonomyType":66,"taxonomyTypeDesc":67},"01JBSEEDCAT000000000000015","视觉设计",[97,98,99,100,101,102,103,22,104,105],"websocket","patterns","websocket patterns","design","protocol","management","message","binary","connection",{"skillNo":107,"name":108,"nameZh":6,"description":109,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":110,"categories":111,"keywords":116,"publishedAt":27},"01M6NWRDQDX9ZNETAWRRMQWV52","visual-verdict","Screenshot comparison QA for frontend development. Takes a screenshot of the current implementation, scores it across multiple visual dimensions, and returns a structured PASS\u002FREVISE\u002FFAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvisual-verdict\u002FSKILL.md",[112,115],{"categoryNo":113,"categoryName":114,"taxonomyType":66,"taxonomyTypeDesc":67},"01JBSEEDCAT000000000000009","前端开发",{"categoryNo":64,"categoryName":65,"taxonomyType":66,"taxonomyTypeDesc":67},[117,118,119,120,121,122,123,124,125,26,126,127,128,100,129,130,131,132,133,134],"visual","verdict","visual verdict","ui","across","revise","comparison","correctness","implementing","fixes","dimensions","frontend","development","qa","screenshot","returns","use","frontend development",{"skillNo":136,"name":137,"nameZh":6,"description":138,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":139,"categories":140,"keywords":141,"publishedAt":27},"01M6NWR8HSNRS7MNDK2J02QYMN","verification-loop","Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fverification-loop\u002FSKILL.md",[],[142,143,85,144,145,146,147,148,149,150,151,152,153],"verification loop","loop","lint","review","security","pr","system","diff","build","tests","diff review","types",{"skillNo":155,"name":156,"nameZh":6,"description":157,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":158,"categories":159,"keywords":160,"publishedAt":27},"01M6NWR4HHSFR0VR5EXFRWA747","vector-db-patterns","Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvector-db-patterns\u002Fskill.md",[],[161,162,163,164,98,165,166,167,168,22,169,170,171,172,173,26,174,175],"vector db patterns","vector db","db","vector","semantic search","search","embedding strategies","algorithms","chunking","semantic","retrieval","embedding","Hybrid Search","hybrid","rag"]