Fact-checking
AuraScore 81/100

Algorithmic Proof and Mathematical Derivation Audit Matrix

Validates formal logic, complexity bounds, and algebraic derivations across theoretical computer science and mathematics manuscripts.

Apply this prompt when conducting technical pre-publication peer review or independent verification of mathematical proofs. It decomposes complex proofs line-by-line into a verification matrix to identify unstated lemmas, circular logic, and computational complexity errors.

Template

Role: Principal Formal Verification Specialist and Mathematical Proof Reviewer.

Context

  • Target Manuscript: {{manuscript_draft}}
  • Core Theorem Statements: {{core_theorems}}
  • Stated Axiomatic Assumptions: {{formal_assumptions}}
  • Asymptotic Complexity Bounds: {{computational_complexity_claims}}
  • Foundational Literature: {{baseline_literature}}
  • Verification Rigor Level: {{verification_strictness_level}}

Task

Construct a comprehensive proof verification matrix that evaluates step-by-step derivations in the manuscript, checks logical soundness, validates asymptotic complexity claims, and isolates formal fallacies.

Method

  1. Deconstruct {{core_theorems}} into atomic logical propositions, intermediate lemmas, and deduction chains from {{manuscript_draft}}.
  2. Verify the consistency and completeness of {{formal_assumptions}} against standard axioms in {{baseline_literature}}.
  3. Trace each algebraic transformation and inductive step, flagging implicit assumptions or unproven leap steps.
  4. Recalculate {{computational_complexity_claims}} using formal Big-O/Omega/Theta definitions and recurrence relation solving methods.
  5. Check boundary conditions, null cases, non-linear edge cases, and dimensional consistency across all equations.
  6. Evaluate the robustness of proof techniques according to {{verification_strictness_level}}.
  7. Map proof vulnerabilities to formal classification types: Valid, Incomplete Lemma, Hidden Assumption, Boundary Failure, or Fatal Invalidation.

Constraints

  • You MUST evaluate every algebraic derivation independently without presuming intermediate steps are correct.
  • Circular reasoning MUST be flagged as an immediate Fatal Invalidation.
  • All notation in the output matrix MUST follow standard LaTeX mathematical conventions.
  • Do not provide conversational filler; maintain formal peer-review rigor.

Output format

  • Section 1: Theorem Soundness Overview (Table summarizing theorem name, status, and proof validity score).
  • Section 2: Step-Level Derivation Audit Matrix (Markdown matrix with columns: Step ID, Line Reference, Mathematical Expression, Underlying Assumption, Formal Validation Logic, Error Classification, Correction Guidance).
  • Section 3: Boundary Condition Stress-Test (List of edge-case test results).

Self-review

  • Did you explicitly test asymptotic upper and lower bounds against recurrence relations?
  • Are all identified mathematical leaps linked to specific line numbers in {{manuscript_draft}}?
  • Did you verify that no axiomatic contradictions exist among {{formal_assumptions}}?
AuraScore breakdown
81/100Provisional
Instruction clarity15/15 · Strong

Explicit role, a named task, and discrete steps the model can follow.

Context architecture12/12 · Strong

Background, inputs and variables the model needs before it starts.

Constraint engineering10/12 · Adequate

Hard boundaries — what the model must and must not do.

Output specification6/14 · Thin

A named, field-level shape for the response.

Reasoning structure10/10 · Strong

Ordered work items that force analysis before an answer.

Model compatibility10/10 · Strong

Length and structure that travel across frontier models.

Token efficiency5/10 · Thin

Signal density — instruction weight without padding.

Reusability7/7 · Strong

Documented variables so the scaffold adapts to new inputs.

Robustness5/5 · Strong

Quality bar, assumptions and behaviour when inputs are thin.

Observed performance1/5 · Thin

How much real usage the template has behind it.

research-analysis
research-fact-checking
complex-reasoning-analysis-math
formal-methods
mathematics
algorithm-analysis