Proof Path TheoryReading edition

Claim types and logical boundaries

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Read and explore

Proofs and implementation

About this work

Other resources

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

2 Claim types and logical boundaries

A useful theory of proof paths must not turn every recorded object into a proof step. A notebook may contain a theorem, a conjecture, a failed analogy, a numerical experiment, and a historical interpretation on the same page. Their coexistence does not give them the same logical status.

Definition 2.1: Evidence kind

An evidence kind is a declared type attached to a record supporting a claim or justification. The core finite vocabulary used here is

\[ \begin{aligned} &\text{formal proof},\quad \text{assumption},\quad \text{exact computation},\\ &\text{numerical evidence},\quad \text{conjecture},\quad \text{external result},\\ &\text{counterexample},\quad \text{interpretation}. \end{aligned} \]

An evidence record also states its source, scope, and whether it certifies the justification to which it is attached.

The word “certifies” is deliberately separate from the evidence label. An exact computation may certify a finite identity while providing only numerical evidence for a general statement. An external result may certify a step only on the domain covered by its hypotheses. The scope field is therefore part of the mathematical object.

Warning 2.2: Evidence types are not one ranking

The evidence kinds do not form a universal total order. A formal proof of a weak statement and an exact computation of a stronger finite instance cannot be compared by one scalar without specifying the task. The ledger retains type and scope instead of replacing them with a single confidence number.

This separation will be used throughout. Candidate edges may remain in the discovery field, but only certified edges enter a proof certificate.

Source and conversion record

Source SHA-256: ce05e88b439e9fd55ef6eb04da708a63ce02e6627424e6daac0dca4177b8ab51

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Proof Path Theory

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index