proof-usage

Reusable proof strategies for regret decomposition and self-normalization are found by searching indexed proof playbooks using task shape, assumptions, and desired moves. This delivers finalized proof entries with adaptation guidance instead of raw extraction notes.

Locating local lemmas for determinant-based epoch control and error-bound localization requires matching your task shape and assumptions against indexed proof patterns. This returns source-linked proof moves with clear failure modes and adaptation guidance.

Proof patterns are fully traceable back to original cited papers using stable material source IDs. This public-source traceability preserves attribution and provides deeper context when you need to verify the underlying theorem proving logic.

This proof search approach provides explicit adaptation guidance and failure modes for applying macro strategies to specific theorem goals. You receive cooked proof playbooks that explain how to apply the matching reusable move within your assumptions.

Use indexed proof lookup when a direct argument is messy, unstable, or too slow to develop from scratch. It quickly points to the matching reusable move and explains how to apply it for complex theorem proving tasks.