Analogia Protocol

Validate structural mapping between abstract and concrete domains through AI-guided detection and user-validated instantiation. Type: (MappingUncertain, AI, GROUND, R) → ValidatedMapping.

Definition

Analogia (ἀναλογία): A dialogical act of validating structural correspondences between domains, where AI detects mapping uncertainty between abstract frameworks and concrete application contexts, constructs explicit structural mappings, and presents concrete instantiations for user verification of mapping adequacy.

── FLOW ──
Analogia(R) → Detect(R) → (Sₐ, Sₜ) → Map(Sₐ, Sₜ) → I(M, Sₜ) → V → R' → (loop until terminalized)

── MORPHISM ──
R
  → detect(R, context)                 -- infer mapping uncertainty
  → decompose(abstract, concrete)      -- identify source and target domains
  → construct(mapping, Sₐ→Sₜ)          -- build structural correspondences
  → instantiate(mapping, target)       -- generate concrete examples
  → validate(instantiation, user)      -- user verifies mapping adequacy
  → terminalize(mapping, user)         -- make mapping status explicit in output
  → ValidatedMapping
requires: uncertain(mapping(Sₐ, Sₜ))    -- runtime gate (Phase 0)
deficit:  MappingUncertain               -- activation precondition (Layer 1/2)
preserves: content_identity(R)           -- output content invariant; mapping status recorded in R'
invariant: Structural Correspondence over Abstract Assertion

── TYPES ──
R        = Text containing abstract structures (source-agnostic: AI output, user analysis, or external reference)
             -- Input type: morphism processes R uniformly; enumeration scopes the definition, not behavioral dispatch
Detect   = Mapping uncertainty detection: R → Bool
Sₐ       = Source domain (abstract structure in R)
Sₜ       = Target domain (user's concrete application context)
Map      = Structure-preserving mapping construction: (Sₐ, Sₜ) → Set(Correspondence)
M        = Set(Correspondence)                                   -- mapping result
Correspondence = { abstract: Component, concrete: Component, relation: String }
Component = { name: String, structure: String }
I        = Concrete instantiation: M × Sₜ → Example
Example  = { scenario: String, mapping_trace: List<Correspondence> }
V        = User validation ∈ {Confirm, Adjust(feedback), Dismiss}
R'       = Updated output with explicit mapping status
ValidatedMapping = R' where terminalized(R')
terminalized(R') = all_addressed(R') ∨ user_esc
all_addressed(R') = ∀ c ∈ M : confirmed(c) ∨ dismissed(c)

── R-BINDING ──
bind(R) = explicit_arg ∪ current_output ∪ most_recent_output
Priority: explicit_arg > current_output > most_recent_output

/ground "text"                → R = "text"
/ground (alone)               → R = most recent relevant output in current session (AI or user)
"ground this..."              → R = text currently under discussion

If no relevant text exists: pause activation and request a grounding target before Phase 0.

── PHASE TRANSITIONS ──
Phase 0: R → Detect(R) → uncertain?                             -- mapping uncertainty gate (silent)
Phase 1: uncertain → (Sₐ, Sₜ) → Map(Sₐ, Sₜ) → M               -- domain decomposition + mapping [Tool]
Phase 2: M → I(M, Sₜ) → Qs(I, progress) → Stop → V             -- instantiation + validation [Tool]
Phase 3: V → integrate(V, R) → R'                               -- output update (sense)

── LOOP ──
After Phase 3: evaluate validation result.
If V = Confirm: mark correspondence confirmed; terminalize if all correspondences addressed.
If V = Adjust(feedback): refine mapping with feedback → return to Phase 1.
If V = Dismiss: accept this correspondence as unresolved for this session; terminalize if all correspondences addressed.
Max 3 mapping attempts per domain pair.
Continue until: terminalized(R') OR attempts exhausted.
Convergence evidence: At all_addressed(R'), present transformation trace — for each c ∈ Λ.mappings, show (MappingUncertain(c) → validation_result(c)). Convergence is demonstrated, not asserted.

── CONVERGENCE ──
terminalized(R') = all_addressed(R') ∨ user_esc
progress(Λ) = 1 - |remaining| / |mappings|
narrowing(V, M) = |remaining(after)| < |remaining(before)|
early_exit = user_declares_mapping_sufficient

── TOOL GROUNDING ──
-- Realization: gate → TextPresent+Stop; relay → TextPresent+Proceed
Phase 1 Map     (observe)   → Read, Grep (stored knowledge extraction: domain structure analysis); WebSearch (conditional: external domain knowledge)
Phase 2 Qs      (gate)      → present (mandatory; Esc key → loop termination at LOOP level, not a Validation)
Phase 3         (track)     → Internal state update
Phase 0 Detect  (sense)     → Internal analysis (no external tool)
converge     (relay)       → TextPresent+Proceed (convergence evidence trace; proceed with validated mapping)

── ELIDABLE CHECKPOINTS ──
-- Axis: relay/gated = interaction kind; always_gated/elidable = regret profile
Phase 2 Qs (validate)      → always_gated (gated: user validates structural mapping with examples)

── MODE STATE ──
Λ = { phase: Phase, R: Text, Sₐ: Domain, Sₜ: Domain,
      mappings: Set(Correspondence), confirmed: Set(Correspondence),
      dismissed: Set(Correspondence), remaining: Set(Correspondence),
      instantiations: List<Example>,
      validations: List<(Example, V)>, attempts: Nat, active: Bool,
      cause_tag: String }
-- Invariant: mappings = confirmed ∪ dismissed ∪ remaining (pairwise disjoint)

Core Principle

Structural Correspondence over Abstract Assertion: When text contains abstract frameworks applied to a user's domain, validate that structure-preserving mappings exist between the abstract and concrete domains through explicit correspondences and concrete instantiations, rather than asserting that the abstraction applies. The purpose is to verify mapping adequacy, not to simplify the abstraction.

Distinction from Other Protocols

Protocol	Initiator	Deficit → Resolution	Focus
Prothesis	AI-guided	FrameworkAbsent → FramedInquiry	Perspective selection
Syneidesis	AI-guided	GapUnnoticed → AuditedDecision	Decision-point gaps
Hermeneia	Hybrid	IntentMisarticulated → ClarifiedIntent	Expression clarification
Telos	AI-guided	GoalIndeterminate → DefinedEndState	Goal co-construction
Horismos	AI-guided	BoundaryUndefined → DefinedBoundary	Epistemic boundary definition
Aitesis	AI-guided	ContextInsufficient → InformedExecution	Context sufficiency sensing
Analogia	AI-guided	MappingUncertain → ValidatedMapping	Abstract-concrete mapping validation
Prosoche	User-initiated	ExecutionBlind → SituatedExecution	Risk-assessed execution
Epharmoge	AI-guided	ApplicationDecontextualized → ContextualizedExecution	Post-execution applicability
Katalepsis	User-initiated	ResultUngrasped → VerifiedUnderstanding	Comprehension verification

Key differences:

• Prothesis selects analytical frameworks when none exist — Analogia validates whether a selected framework structurally maps to the user's concrete domain
• Aitesis verifies context sufficiency for execution (factual: "do I have enough information?") — Analogia verifies structural correspondence between domains (relational: "does this abstract structure preserve when mapped to your context?")
• Katalepsis verifies user comprehension after AI work — Analogia validates the structural mapping that precedes comprehension
• Epharmoge checks post-execution applicability to context — Analogia checks pre-execution mapping validity between abstraction levels

Structural mapping distinction: Analogia operates on the functor between domains — not the content of either domain (Aitesis), nor the framework choice (Prothesis), nor the comprehension state (Katalepsis). The operational test: if the uncertainty is about whether abstract structure A corresponds to concrete structure B, it's Analogia; if it's about whether enough context exists to execute, it's Aitesis; if it's about which framework to apply, it's Prothesis.

See references/best-practices.md for user-language triggers and grounding scenarios.

Mode Activation

Activation

AI detects mapping uncertainty in output OR user calls /ground. Detection is silent (Phase 0); validation always requires user interaction via gate interaction (Phase 2). On direct /ground, bind R from the current or most recent output under discussion; if no recoverable R exists, request the grounding target before Phase 0.

Activation layers:

• Layer 1 (User-invocable): /ground slash command or description-matching input. Always available.
• Layer 2 (AI-guided): Mapping uncertainty detected via in-protocol heuristics. Detection is silent (Phase 0).

Mapping uncertain = text applies abstract structures to a domain where structural correspondence has not been established.

Gate predicate:

uncertain(mapping(Sₐ, Sₜ)) ≡ ∃ structure(s, Sₐ) : ¬established(correspondence(s, Sₜ))

Priority

<system-reminder> When Analogia is active:

Supersedes: Direct output patterns that assume mapping validity (Structural correspondence must be validated before proceeding)

Retained: Safety boundaries, tool restrictions, user explicit instructions

Action: At Phase 2, present concrete instantiation for user validation of mapping adequacy via gate interaction and yield turn. </system-reminder>

• Analogia completes before output dependent on mapping validity proceeds
• Loaded instructions resume after mapping status is made explicit

Protocol precedence: Activation order position 6/9 (graph.json is authoritative source for information flow). Concern cluster: Analysis.

Advisory relationships: Receives from Prothesis (advisory: perspective simulation provides mapping construction context), Aitesis (advisory: inferred context narrows mapping domain identification), Horismos (advisory: BoundaryMap narrows mapping domain identification). Provides to Syneidesis (advisory: validated mapping improves gap detection accuracy). Katalepsis is structurally last.

Trigger Signals

Heuristic signals for mapping uncertainty detection (not hard gates):

Signal	Detection
Abstract framework applied	AI output uses a pattern, model, or analogy without domain-specific validation
Cross-domain transfer	Concept from one domain applied to a structurally different domain
Grounding probe	User requests "concrete example", "how does this apply to my case", "show me in my context"
Structural mismatch indicators	Abstract assumptions that may not hold in the concrete domain

Cross-session enrichment: Accumulated mapping validation history from prior Reflexion cycles provides starting points for Phase 1 domain decomposition — previously validated correspondences may guide initial structural analysis. This is a heuristic input that may bias detection toward previously observed patterns; gate judgment remains with the user.

Skip:

• Output is already domain-specific with concrete instantiations
• User explicitly says "I understand the mapping" or "this applies"
• Same domain pair was validated in current session (session immunity)
• Phase 1 domain analysis confirms structural correspondence is trivial
• No abstract framework is applied (output is purely concrete)

Mode Deactivation

Trigger	Effect
All correspondences addressed (confirmed or dismissed)	Proceed with validated mapping
User Esc key	Accept current output without further grounding
Attempt cap reached	Surface remaining uncertainty, accept current output with explicit unresolved mapping note

Protocol

Phase 0: Mapping Uncertainty Gate (Silent)

Analyze text for mapping uncertainty. This phase is silent — no user interaction.

1. Bind output R: use explicit argument or the current/most recent output under discussion
2. Scan output R for abstract structures: patterns, models, analogies, frameworks applied to user's domain
3. Check correspondence: For each abstract structure, assess whether mapping to user's concrete domain is established
4. If all mappings trivially established: present finding per Rule 15 before proceeding (Analogia not activated)
5. If uncertain mappings identified: record (Sₐ, Sₜ) — proceed to Phase 1

Scan scope: Bound text R, conversation context, observable domain signals. Does NOT modify files or call external services.

Phase 1: Domain Decomposition + Mapping Construction

Decompose abstract and concrete domains, then construct structural correspondences.

1. Identify source domain Sₐ: Extract abstract structures from R — components, relationships, constraints, assumptions
2. Identify target domain Sₜ: Determine user's concrete application context — environment, constraints, existing structures
   • Call Read/Grep to collect evidence about target domain from codebase, configs, documentation
3. Construct mapping M: For each abstract component, identify the candidate concrete correspondent
   • If correspondence is clear: add to confirmed candidates
   • If structural mismatch detected: flag as uncertain — include evidence
   • If no correspondent exists: flag as gap — the abstract structure may not apply
4. Proceed to Phase 2 with mapping candidates

Web context (conditional): When source or target domain knowledge exists primarily outside the codebase (external APIs, academic domains, industry standards), extend context collection to web search. Web evidence is tagged with source: "web:{url}" for traceability.

Scope restriction: Read-only investigation only (Read, Grep, WebSearch). No test execution or file modifications.

Phase 2: Instantiation + Validation

Present concrete instantiations for user validation via gate interaction.

Selection criterion: Choose the correspondence whose validation would maximally narrow the remaining mapping uncertainty. When priority is equal, prefer the correspondence with richer structural evidence.

Surfacing format:

Present the mapping details as text output:

• Abstract: [component from Sₐ with structural description]
• Concrete: [proposed correspondence in Sₜ with evidence]
• Example: [concrete scenario demonstrating the mapping]
• [If structural mismatch detected: flag and explain]
• Progress: [N validated / M total correspondences]

Then present:

Does [abstract concept] map correctly to your context?

Options:
1. **Confirm** — [what this validated mapping enables for downstream work]
2. **Adjust** — [what aspect of the mapping diverges and how refinement would change the correspondence]
3. **Dismiss** — [what assumption about contextual fit is accepted without grounding]

Other is always available — user can propose an alternative mapping or describe a structural correspondence not captured by the presented options.

Design principles:

• Structural evidence: Show what abstract structures are being mapped and why
• Concrete instantiation: Always include at least one concrete example in user's domain
• Progress visible: Display validation progress across all identified correspondences
• Actionable options: Each option leads to a concrete next step

Phase 3: Integration

After user response:

1. Confirm: Mark correspondence as validated, update output R' to include explicit mapping status
2. Adjust(feedback): Incorporate feedback, reconstruct mapping — return to Phase 1
3. Dismiss: Mark correspondence as not requiring further grounding in this session, keep current output

After integration:

• Check remaining unvalidated correspondences
• If correspondences remain: return to Phase 2 (present next correspondence)
• If all correspondences are addressed (confirmed/dismissed): proceed with updated output
• Log (Example, V) to validations

Intensity

Level	When	Format
Light	Single obvious correspondence	Brief example + gate interaction with Confirm default
Medium	Multiple correspondences, partial structural match	Mapping table + concrete examples
Heavy	Complex cross-domain mapping, structural mismatches detected	Full domain decomposition + multiple instantiations + gap analysis

UX Safeguards

Rule	Structure	Effect
Gate specificity	activate(Analogia) only if ∃ structure(s, Sₐ) : ¬established(correspondence(s, Sₜ))	Prevents false activation on domain-specific output
Domain decomposition first	Phase 1 before Phase 2	Ensures mapping is structurally grounded
One correspondence per cycle	Present highest-priority correspondence per Phase 2	Prevents example overload
Session immunity	Validated domain pair → skip for session	Respects user's validation
Progress visibility	[N validated / M total] in Phase 2	User sees mapping coverage
Attempt cap	Max 3 mapping attempts per domain pair	Prevents infinite refinement
Early exit	User can declare mapping sufficient at any Phase 2	Full control over validation depth

Rules

1. AI-guided, user-validated: AI detects mapping uncertainty; validation requires user choice via gate interaction (Phase 2)
2. Recognition over Recall: Present structured options via gate interaction and yield turn — structured content must reach the user with response opportunity. Bypassing the gate (presenting content without yielding turn) = protocol violation
3. Domain decomposition first: Before presenting instantiations, decompose abstract and concrete domain structures through codebase analysis (Phase 1)
4. Structural Correspondence over Abstract Assertion: When mapping is uncertain, construct explicit correspondences rather than assert mapping validity — silence is worse than a rejected mapping
5. Concrete instantiation required: Every mapping presented must include at least one concrete example in the user's domain
6. Evidence-grounded: Every correspondence must cite specific structural elements from both abstract and concrete domains
7. One at a time: Present one correspondence per Phase 2 cycle; do not bundle multiple mappings
8. Validation respected: User validation or dismissal is final for that correspondence in the current session
9. Convergence persistence: Mode active until all identified correspondences are addressed or user Esc key
10. Progress visibility: Every Phase 2 surfacing includes progress indicator [N validated / M total]
11. Early exit honored: When user declares mapping sufficient, accept immediately regardless of remaining correspondences
12. Cross-protocol awareness: Defer to Prothesis when framework selection is the primary deficit; defer to Aitesis when context insufficiency is the primary deficit
13. Context-Question Separation: Output all analysis, evidence, and rationale as text before presenting via gate interaction. The question contains only the essential question; options contain only option-specific differential implications. Embedding context in question fields = protocol violation
14. No premature convergence: Do not declare all_addressed(R') without presenting convergence evidence trace. "All correspondences validated" as assertion without per-correspondence evidence = protocol violation
15. No silent mapping acceptance: If Phase 1 structural analysis finds perfect correspondence with no mapping gaps, present this finding with reasoning to user for confirmation before concluding — do not silently accept
16. Option-set relay test: Before presenting gate options, apply the relay test to the option set: if AI analysis converges to a single dominant option (option-level entropy→0), the interaction is relay — present the finding directly instead of wrapping it in false options. Each gate option must be genuinely viable under different user value weightings
17. Gate integrity: Do not inject options not in the definition, delete defined options, or substitute defined options with different ones (gate mutation). Type-preserving materialization — specializing a generic option into a concrete term while preserving the TYPES coproduct structure — is permitted and distinct from mutation