Komorebi SpaceReading edition

Claim correspondence

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

Claim correspondence (table 11)
LocationTopicLean modules
1.3Limit universal propertyViewSections
1.4Functorial transportViewSections
1.5Terminal evaluationViewSections
2.1Strict section gluingSectionGluing
2.2Object-only cover failureViewBoundaryExamples
2.3Correspondence fibersViewCorrespondence
2.4Nonempty fibers without a sectionViewBoundaryExamples
3.1Additive view differentialSectionObstruction
3.2Additive extension criterionSectionObstruction
3.3Extension ambiguity torsorSectionExtensionFibers
Source passageParity seed exampleSectionExtensionExample
3.5Exactness at partial sectionsSectionExactSequence
Source passageExtension by stagesSectionExtensionStages
4.1Protected correctionCorrection
4.2Obstruction witnessCorrection
6.1Exact tower maps and realized pointsTowers Realization
6.2Tower differential compositionTowers TowerCorrection
6.3Cofinal point equivalenceCofinal
8.1Geometric operator repairRepairDynamics RepairProjection
8.2Constructed split tower correctionSplitTowerRepair
8.3Split semantic and residual coordinatesSplitTowerCoordinates SplitTowerSemantics
8.4Growing identity repairGrowingTower
Source passageA bounded residual without bounded primitiveIdentityTowerObstruction
Source passageDependence on target splittingSplittingDependence
Source passageLossless dyadic residual splitDyadicResidualSplit
10.1Cascade telescope and persistent partCascadeProjections CoarseningCascade
10.2Recovery by densityCascadeDensity
10.3Dyadic finite-coordinate recoveryDyadicInfiniteReconstruction
10.5Shift cascade and c0SequenceCascade
11.2Gauge groupoid and section transportGroupViewSystems CocycleGaugeGroupoid
11.3Nonabelian extension obstructionNonabelianExtension
11.4Nonabelian extension torsorNonabelianExtensionFibers
11.5S3 loop modelCocycleExamples
12.1Effective groupoid descentDescentEquivalence DescentComparison
13.1Composition topologyCompositionSite
13.2Standard stackhoodCompositionStack
14.1Equivalent view presentationsSectionViewEquivalence RelativeSections RelativeAmbiguity
14.3Identified-boundary realization groupoidMarkedRealization
14.4Marked transport across a squareMarkedTransport
17.1Transported path telescopeAmplifiedTransport
17.2Holonomy classificationAmplifiedHolonomy
18.1Orthogonal exact repairHilbertKernelProjection
18.2Closed range equivalenceHilbertKernelProjection
19.1Amplified holonomy gainAmplifiedRepair HilbertHolonomyRepair
Source passageFlat transport amplificationAmplifiedExamples
20.1Two-stage joint projectionQuantitativeDescent
20.2Joint closed rangeDescentClosedRange
21.1Two-sided projector motionMovingKernelBounds
21.2Derived perturbed certificateSplitKernelPerturbation
21.3Transport between moving kernelsSplitKernelPerturbation
21.4Exact moving-line exampleMovingKernelExamples
Source passageRank loss and radius endpointMovingKernelBounds MovingKernelExamples
Source passageMotion of quantitative descentMovingDescent
35.1Finite prefixes without a pointFinitePrefixBoundary
10.4Sharper dyadic support criterionDyadicSupport
18.3Nearest protected Hilbert repairProtectedHilbertRepair
35.3Finite positive and negative certificatesProtectedLinearCertificates
35.2Finite-fiber inverse-limit existenceFiniteRealizationExistence
5.1Obstructions under stronger prescriptionObstructionRestriction
5.2Prescribed choices and obstructed intermediate stepsExtensionChoiceExample
7.1Scheduled transports and eventual equalityReindexedTransports EventualCategory
7.2Faithfulness from observable finite stagesRealizationFaithfulness
7.3Finite observation characterizes realized transportFiniteObservation
7.4Cofinal transport equivalenceCofinalTransports
9.1Split repair coordinates and choice dependenceSplitDefectCharts
9.2Triangular representation change and repair mismatchResidualNaturality
9.3Residual sampling and repair across scalesResidualSampling SamplingRepair
15.1Why literal full framing is presentation dependentFramingBoundaryExamples
22.1Measured and uncertain residual certificatesResidualPerturbation
22.2Stable repair when the old exact space is preservedResidualPerturbation
24.1Exactification from summable movementExactification
24.2Variable-rate exactification and posterior boundsExactification
24.3Controlled approximation annihilates protected obstructionLinearExactification
24.4Path comparison and nonunique protected answersExactification RepairExamples
24.5What cofinal residual-profile sampling preservesProfiles
25.1Obstruction floors detect closure, not exact membershipObstructionFloor
25.2Persistent floors exclude all admissible repair sequencesObstructionFloor
23.1Independent transport costs and directed geometryWeightedGeometry
23.2Zero arrows can collapse object distanceWeightedGeometry
16.1An associative phase with no scalar flatteningProjectiveExample
Source and conversion record

Source SHA-256: a1028b1ccd6062d0fbff35bc4cfe52c6694f0d3e70aaac3a1af78e0cc0cb02ad

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 Komorebi Space

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