Pith. sign in
module module moderate

IndisputableMonolith.Foundation.PrimitiveRecognitionCalculus.FiniteCertificateTransfer

show as:
view Lean formalization →

Module for transferring finite distinction certificates across the discrete-to-continuum completion. It packages typed finite certificates, legitimacy of certificate maps, and sound-faithful covers, then proves that conservative completion preserves certificates and that uncountable witness sets block faithful covers. Downstream delta-native and quantized-proof modules import it to keep continuum claims pinned to finite data.

claimA typed finite distinction certificate is finite data plus a regime tag. A certificate map sends continuum statements to such certificates. Legitimate maps and conservative completion transfer certificates and descend obstructions. A sound faithful cover injects continuum witnesses into countable certified data; uncountable witness sets admit no such cover.

background

Primitive Recognition Calculus treats continuum claims as legitimate only when they arise by conservative completion of finite distinction data. The upstream module CompletionConservativity supplies the conservativity interface: continuum extensions must not invent distinctions absent from the discrete skeleton.

This module introduces the certificate layer. A typed finite distinction pairs finite combinatorial data with a tag naming the distinction regime that produced it. Certificate maps assign such packages to continuum statements. Legitimacy means the map only certifies statements already forced by the finite side. Sound faithful covers require that every continuum witness injects into a countable family of certificates, so continuum identity is recoverable from finite tags.

The setting is foundation-level bookkeeping before mass ladders or forcing T5–T8: ensure continuum language cannot smuggle uncountable free parameters past the recognition calculus.

proof idea

Definitions first: TypedFiniteDistinction, CertificateMap, LegitimateContinuumStatement, SoundFaithfulCover. Lemmas then chain: certificateMap_legitimate and conservative_completion_transfers move certificates across completion; obstruction_descends pushes failures back to the finite side; finite_certificate_transfer packages the transfer theorem. Cover lemmas show soundFaithfulCover_injects and that covers yield only countable witnesses; everything_certified_not_faithful and no_soundFaithfulCover_of_uncountable_witnesses give the negative direction when the witness set is uncountable.

why it matters in Recognition Science

Delta-native analysis and strong closure import this module so continuum delta statements remain certificate-backed rather than free analytic inventions. QuantizedProofMethod uses the same transfer to keep quantized arguments finite-first. In the Recognition framework this is scaffolding for the discrete-to-continuum bridge: continuum claims stay subordinate to finite distinction data, consistent with the forcing chain's demand that structure (octave, dimension, costs) be forced rather than postulated. Without transfer and cover control, continuum language could bypass the finite certificate discipline that later pins constants and mass rungs.

scope and limits

used by (3)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (14)