AutoSamplingTheory.ExampleCases.SampleWiki
6 named declarations scanned from AutoSamplingTheory/ExampleCases/SampleWiki.lean.
Declarations
structure AutoSamplingTheory.ExampleCases.SampleWiki.SourceIdentity Partial Not mapped
- Stable source identity attached to a SampleWiki case before mathematical formalization begins. The hashes are supplied by the source watcher rather than trusted as mathematical evidence by themselves.
structure SourceIdentity where
stableId : String
sourceUrl : String
pageSha256 : String
statementSha256 : String := ""
deriving Repr, DecidableEq
/-- Verification stages are intentionally finer than a Boolean `verified`
flag. In particular, successful Lean elaboration precedes semantic source
review and graph assimilation. -/
AutoSamplingTheory/ExampleCases/SampleWiki.lean:30published source at ed709a7f320d
inductive AutoSamplingTheory.ExampleCases.SampleWiki.VerificationStage Partial Not mapped
- Verification stages are intentionally finer than a Boolean `verified` flag. In particular, successful Lean elaboration precedes semantic source review and graph assimilation.
inductive VerificationStage where
| discovered
| sourcePinned
| normalized
| leanTarget
| compiled
| sourceReviewed
| assimilated
deriving Repr, DecidableEq
/-- Only a source-reviewed or already assimilated case is eligible to feed the
scientific theorem graph. A merely compiled theorem-shaped declaration is not
enough. -/
AutoSamplingTheory/ExampleCases/SampleWiki.lean:40published source at ed709a7f320d
def AutoSamplingTheory.ExampleCases.SampleWiki.admissibleForScientificGraph Partial Not mapped
- Only a source-reviewed or already assimilated case is eligible to feed the scientific theorem graph. A merely compiled theorem-shaped declaration is not enough.
def admissibleForScientificGraph : VerificationStage → Prop
| .sourceReviewed => True
| .assimilated => True
| _ => False
/-- An assimilated SampleWiki case satisfies the graph-admission contract. -/
AutoSamplingTheory/ExampleCases/SampleWiki.lean:53published source at ed709a7f320d
theorem AutoSamplingTheory.ExampleCases.SampleWiki.assimilated_admissible Partial Not mapped
- An assimilated SampleWiki case satisfies the graph-admission contract.
theorem assimilated_admissible :
admissibleForScientificGraph .assimilated := by
trivial
/-- Compilation alone does not discharge the source-review boundary. -/
AutoSamplingTheory/ExampleCases/SampleWiki.lean:59published source at ed709a7f320d
theorem AutoSamplingTheory.ExampleCases.SampleWiki.compiled_not_admissible Partial Not mapped
- Compilation alone does not discharge the source-review boundary.
theorem compiled_not_admissible :
¬ admissibleForScientificGraph .compiled := by
intro h
exact h
/-- Discovery alone is never treated as a formal mathematical certificate. -/
AutoSamplingTheory/ExampleCases/SampleWiki.lean:64published source at ed709a7f320d
theorem AutoSamplingTheory.ExampleCases.SampleWiki.discovered_not_admissible Partial Not mapped
- Discovery alone is never treated as a formal mathematical certificate.
theorem discovered_not_admissible :
¬ admissibleForScientificGraph .discovered := by
intro h
exact h
end SampleWiki
end ExampleCases
end AutoSamplingTheory
AutoSamplingTheory/ExampleCases/SampleWiki.lean:70published source at ed709a7f320d
Complete Lean source
AutoSamplingTheory/ExampleCases/SampleWiki.lean — full module with imports and context
import AutoSamplingTheory.ExampleCases.SampleWiki.Cases.IdealProximalChain
/-!
# SampleWiki example-case lane
This module owns the formal intake contract for mathematical cases discovered at
`https://samplewiki.morning-recipe-422a.workers.dev/`.
A source page is **not** a proved ASTIS result merely because it was crawled,
parsed, translated into a theorem-shaped statement, or compiled as a type. A
mathematical case enters the reusable ASTIS Lean graph only after its source
identity is pinned, its ASTIS restatement is reviewed against that source, its
Lean proof compiles, and the case has been explicitly assimilated into the
shared dependency DAG.
Individual mathematical cases live below
`AutoSamplingTheory.ExampleCases.SampleWiki.Cases`. A case module may contain a
fully verified source theorem or a precisely delimited proof segment. Partial
formalizations must expose their remaining analytic interface as hypotheses and
must not be marked `sourceReviewed` or `assimilated` prematurely.
-/
namespace AutoSamplingTheory
namespace ExampleCases
namespace SampleWiki
/-- Stable source identity attached to a SampleWiki case before mathematical
formalization begins. The hashes are supplied by the source watcher rather
than trusted as mathematical evidence by themselves. -/
structure SourceIdentity where
stableId : String
sourceUrl : String
pageSha256 : String
statementSha256 : String := ""
deriving Repr, DecidableEq
/-- Verification stages are intentionally finer than a Boolean `verified`
flag. In particular, successful Lean elaboration precedes semantic source
review and graph assimilation. -/
inductive VerificationStage where
| discovered
| sourcePinned
| normalized
| leanTarget
| compiled
| sourceReviewed
| assimilated
deriving Repr, DecidableEq
/-- Only a source-reviewed or already assimilated case is eligible to feed the
scientific theorem graph. A merely compiled theorem-shaped declaration is not
enough. -/
def admissibleForScientificGraph : VerificationStage → Prop
| .sourceReviewed => True
| .assimilated => True
| _ => False
/-- An assimilated SampleWiki case satisfies the graph-admission contract. -/
theorem assimilated_admissible :
admissibleForScientificGraph .assimilated := by
trivial
/-- Compilation alone does not discharge the source-review boundary. -/
theorem compiled_not_admissible :
¬ admissibleForScientificGraph .compiled := by
intro h
exact h
/-- Discovery alone is never treated as a formal mathematical certificate. -/
theorem discovered_not_admissible :
¬ admissibleForScientificGraph .discovered := by
intro h
exact h
end SampleWiki
end ExampleCases
end AutoSamplingTheory