theory-counterexample

Identify a counterexample by testing the claim's explicit assumptions using degenerate cases, boundary conditions, and known pathological examples across domains like algebra and analysis to disprove or challenge the mathematical claim.

A minimal counterexample in proof analysis is the simplest specific case that demonstrates a mathematical claim fails by violating its stated assumptions, helping researchers identify exactly where the proof breaks down and suggests stronger conditions.

Test mathematical claims by applying boundary conditions and pathological examples across algebra, analysis, and logic. This process challenges the stated assumptions and verifies robustness for typical cases or isolates failures to refine the hypothesis.

Yes, you can critique theoretical computer science conjectures and logic proofs. The system constructs counterexamples to reveal weaknesses in assumptions, providing outputs that specify the violated condition and suggest stronger constraints or a formal proof.

You need to state the mathematical claim with explicit assumptions. The system then processes this input to output a clear minimal counterexample, the specific violated assumption, and suggestions for stronger conditions or a formal proof.

You should not rely solely on a counterexample when verification of robustness for typical cases is required without identifying specific assumption failures, as the system focuses on challenging claims and refining hypotheses rather than proving universal validity.