--- id: wiki-2026-0508-mutually-exclusive-and-collectiv title: Mutually Exclusive and Collectively Exhaustive (MECE) category: 10_Wiki/Topics status: needs_review canonical_id: self aliases: [] duplicate_of: none source_trust_level: A confidence_score: 0.92 tags: [uncategorized] raw_sources: [] last_reinforced: 2026-05-08 github_commit: pending inferred_by: Claude Opus 4.7 (auto-normalize 2026-05-08) --- # [[Mutually Exclusive and Collectively Exhaustive (MECE)|Mutually Exclusive and Collectively Exhaustive (MECE]] ## πŸ“Œ ν•œ 쀄 톡찰 (The Karpathy Summary) λ°μ΄ν„°λ‚˜ 문제λ₯Ό λ²”μ£Όν™”ν•  λ•Œ, ν•­λͺ© κ°„ **'μƒν˜Έ 배제(쀑볡 μ—†μŒ)'**와 **'전체 포괄(λˆ„λ½ μ—†μŒ)'**을 μΆ©μ‘±ν•˜λ„λ‘ λ‚˜λˆ„λŠ” 논리적 ν”„λ ˆμž„μ›Œν¬λ‘œ μ „λž΅ μ»¨μ„€νŒ…μ˜ 핡심 κΈ°μ΄ˆμž…λ‹ˆλ‹€. ## πŸ“– κ΅¬μ‘°ν™”λœ 지식 (Synthesized Content) - **μƒν˜Έ 배제 (Mutually Exclusive):** 각 μ •λ³΄λ‚˜ ν•˜μœ„ λ²”μ£Όκ°€ κ³ μœ ν•˜κ³  독립적이어야 ν•©λ‹ˆλ‹€. 즉, ν•˜λ‚˜μ˜ ν•­λͺ©μ΄ 두 개 μ΄μƒμ˜ 범주에 μ†ν•΄μ„œλŠ” μ•ˆ 되며, μ΄λŠ” 뢄석 μ‹œ 이쀑 계산(Double-counting)μ΄λ‚˜ ν˜Όλž€μ„ λ°©μ§€ν•©λ‹ˆλ‹€ [61-63]. - **전체 포괄 (Collectively Exhaustive):** μ„ νƒν•œ 범주듀을 λͺ¨λ‘ 합쳀을 λ•Œ 전체 λ¬Έμ œλ‚˜ 데이터 μ„ΈνŠΈλ₯Ό 100% 포괄해야 ν•©λ‹ˆλ‹€. λˆ„λ½λœ 뢀뢄이 있으면 μ€‘μš”ν•œ μ „λž΅μ  κΈ°νšŒλ‚˜ μœ„ν—˜μ„ 놓칠 수 μžˆμŠ΅λ‹ˆλ‹€ [62, 64, 65]. - **μ‹€μ „ ν™œμš©:** 이윀 ν•˜λ½ 문제λ₯Ό 뢄석할 λ•Œ 수읡(Price Γ— Volume)κ³Ό λΉ„μš©(Fixed Costs + Variable Costs)으둜 λ‚˜λˆ„λŠ” μˆ˜μ΅μ„± ν”„λ ˆμž„μ›Œν¬κ°€ κ°€μž₯ λŒ€ν‘œμ μΈ MECE 적용 μ‚¬λ‘€μž…λ‹ˆλ‹€ [66, 67]. - **함정 ν”Όν•˜κΈ°:** 고객을 'μ·¨λ―Έ'와 '관심사'둜 λ‚˜λˆ„λŠ” 것은 쀑볡이 λ°œμƒν•˜μ—¬ Non-MECE 방식이 되며 [63, 68], '기타(Other)'λΌλŠ” λͺ¨ν˜Έν•œ λ²”μ£Όλ₯Ό λ‚¨μš©ν•΄ μ–΅μ§€λ‘œ CE μš”κ±΄μ„ λ§žμΆ”λŠ” 것도 μ§€μ–‘ν•΄μ•Ό ν•©λ‹ˆλ‹€ [57]. ## πŸ”— 지식 μ—°κ²° (Graph) - **Related Topics:** [[McKinsey Problem Solving|McKinsey Problem Solving]], [[Minto Pyramid Principle|Minto Pyramid Principle]] - **Projects/Contexts:** [[Issue Tree|Issue Tree]] Development, Market Segmentation - **Contradictions/Notes:** ν˜„μ‹€ μ„Έκ³„μ˜ λ³΅μž‘ν•œ μ‹œμŠ€ν…œμ—μ„œλŠ” λ²”μ£Ό κ°„ μ™„μ „νžˆ λΆ„λ¦¬λ˜μ§€ μ•ŠλŠ” μƒν˜Έμ˜μ‘΄μ„±μ΄ μ‘΄μž¬ν•  수 μžˆμœΌλ―€λ‘œ, MECE만 κ³ μ§‘ν•  경우 문제의 유기적 λ³Έμ§ˆμ„ μ§€λ‚˜μΉ˜κ²Œ λ‹¨μˆœν™”(False completeness)ν•  μœ„ν—˜μ΄ μžˆμŠ΅λ‹ˆλ‹€ [10, 41, 69]. --- *Last updated: 2026-04-27* ## πŸ€– LLM ν™œμš© 힌트 (How to Use This Knowledge) **μ–Έμ œ 이 지식을 μ“°λŠ”κ°€:** - *(TODO)* **μ–Έμ œ μ“°λ©΄ μ•ˆ λ˜λŠ”κ°€:** - *(TODO)* ## πŸ§ͺ 검증 μƒνƒœ (Validation) - **정보 μƒνƒœ:** needs_review - **좜처 신뒰도:** A - **κ²€ν†  이유:** *(P-Reinforce Phase 1 μžλ™ μ •κ·œν™”. λ³Έλ¬Έ 검증 ν•„μš”.)* ## 🧬 쀑볡 검사 (Duplicate Check) - **κΈ°μ‘΄ μœ μ‚¬ λ¬Έμ„œ:** *(TODO: μΈλ±μ„œ ν΄λŸ¬μŠ€ν„° 리포트 μ°Έμ‘°)* - **처리 방식:** UPDATE (μžλ™ μ •κ·œν™”) - **처리 이유:** Phase 1 μ •κ·œν™” β€” μ˜› ν…œν”Œλ¦Ώ/λˆ„λ½ ν•„λ“œ 보강. ## ⚠️ λͺ¨μˆœ 및 μ—…λ°μ΄νŠΈ (Contradictions & Updates) - **κ³Όκ±° λ°μ΄ν„°μ™€μ˜ 좩돌:** μ—†μŒ - **μ •μ±… λ³€ν™”:** μ—†μŒ ## πŸ•“ λ³€κ²½ 이λ ₯ (Changelog) | λ‚ μ§œ | λ³€κ²½ λ‚΄μš© | 처리 방식 | 신뒰도 | |------|-----------|-----------|--------| | 2026-05-08 | P-Reinforce Phase 1 μ •κ·œν™” (frontmatter + 헀더 ν‘œμ€€ν™”) | UPDATE | A |