Start here
Realization Calculus and Komorebi Space · Komorebi P.
Komorebi studies how mathematical structure behaves when its description changes. Decomposing an object, changing coordinates, or forming an abstraction can make a problem easier to approach. The question is whether that description retains enough information for the task, and how to account for what is lost.
Realization Calculus develops decomposition, transfer, refinement, and reconstruction through packets, seeds, coordinates, and explicit residuals. Komorebi Space provides a setting for comparing realizations, their compatibility conditions, and the obstructions to moving between them.
The collection develops these questions across algebra, analysis, arithmetic, signals, computation, and models of interacting systems. The project map shows how the subjects connect. Browse by work to reach a particular paper or monograph and its source files.
What the project is trying to contribute
The aim is a reusable mathematical language for resolving objects into parts, transferring operations, comparing descriptions, and exposing failures of compatibility. Recording the conditions for reconstruction and the residuals of a failed transfer makes those conditions part of the construction itself.
Each work's contribution is expressed in its definitions, results, constructions, and proofs. A connection between subjects requires an argument showing that the relevant structures and hypotheses survive the transfer. The scope of that argument determines where the result applies.
For the introductory calculations, sources and contributions identify the classical inputs and the role of the Euler, wavelet, and seed-generation walkthroughs.
Start with an extended case study
Follow one problem through several representations, including the operations and information retained at each step. A suggested route begins with Euler numbers, continues through signals, and then compares quantum measurement.
| Route | Begin here | What to follow |
|---|---|---|
| Arithmetic and coordinates | Euler numbers, then factorial lanes | Reciprocal series, changes of basis, prime-adic bounds, refinement, and residual repair. |
| Signals and operations | Wavelets and polyphase transfer | Four Haar levels, filter transport, finite stability, and the exact error from omitted interactions. |
| Quantum information | Quantum phase and measurement | Recoverable measurements, discarded coherence, reversible records, and finite recovery. |
The extended case-study index includes further counting and polynomial derivations. Each study provides hand calculations, failure controls, and exact executable checks. Special Functions offers a route into function constructions and their analytic questions.
Choose a reading route
Start with the subject or kind of work that interests you. Each route leads to the relevant manuscripts, sources, and recorded evidence.
For papers and books with a complete online manuscript and visual guide, choose a guided reading path: begin with the visual introduction, study the work, or inspect its supporting evidence.
| Goal | Begin with |
|---|---|
| Understand the common language | Realization Calculus and Komorebi Space |
| Study the individual developments | Papers I–XII |
| Understand limits of representation | Realization Boundaries |
| Follow a complete calculation | Extended case studies, beginning with Euler numbers |
| Follow an application | Monographs and companion volumes |
| Explore an open mathematical program | Research programs and their scope |
| Work with executable mathematics | Software guide and experimental laboratories |
| Study method and review | Proof Path Theory and Komorebi Methodology |
Where the work stands
The collection contains written mathematics, formal developments, conditional results, software, and experiments at different stages of completion and review. The completion and confidence guide explains the status labels. The status catalogue and dated records give the assessments for individual works and revisions.
The finalization queue lists the remaining work. Selected source connections are documented in the project map; a complete theorem dependency audit remains open. A finished reading edition may still contain open questions, and a conditional result retains its assumptions.
Four questions to carry through the collection
- What is the object? State the space, coefficient system, and admissible inputs.
- How is it resolved? Identify the packets, coordinates, or other components used to represent it.
- How does the operation transfer? Determine the blocks or compatibility laws relating representations.
- What is reconstructed? State the recovered object and any residual or obstruction.
Worked calculations
The demonstrations offer optional introductions through hand calculations and exact programs. Choose one if you want to see how the terminology is used before following a longer development.
| Start from this question | Follow this route | Background |
|---|---|---|
| Can smaller operations reconstruct the whole operation? | Reconstruct an operator from packet blocks | Small matrix products |
| What does a finer description preserve, and what does deletion lose? | Refine a signal and account for a missing packet | List indexing and sums |
| Can a summary answer the question being asked? | Test recovery from a summary | Addition and functions |
Each route includes a worked calculation, expected program output, and links to the relevant mathematical sources. You can read the calculations without installing software. The program uses Python's standard library.
Research preview: Euler numbers
Euler numbers through packets, polynomials, and residuals follows one extended derivation through reciprocal series, polynomial coordinates, exact transfer matrices, and residual correction. The page includes hand calculations, failure controls, source references, and downloadable results.
Read the derivation on the website, or run the exact checker from the collection root:
python -B examples/euler_packets.py
Python 3.10 or later is sufficient; the checker uses only the standard library. A successful run ends with PASS: Euler packets, polynomials and residuals. You can also download the standalone checker or the complete source and results bundle.
The example records its sources and tested ranges. The workflow guide explains the collection's verification commands.
Interpret the evidence
| Evidence | What to inspect |
|---|---|
| Written theorem | Exact conclusion, assumptions, and argument. |
| Lean declaration | Formal statement, imports, axioms, environment, and compilation record. |
| Exact finite calculation | Inputs, arithmetic model, computed property, and the argument connecting it to a broader result. |
| Numerical experiment | Precision, tested range, reference calculation, error criteria, and retained outcomes. |
| Software test | Exercised behavior, platform, dependencies, and source revision. |
| File-integrity record | The exact bytes and source snapshot it identifies. |
A proved implication remains a result when an application premise is open. Applying it requires that premise. Paper XI's Conjecture 66 and the remaining Physics and machine-model obligations retain that distinction.
All software is beta and work in progress. Follow the citation guidance for the specific work and revision you use.
The public project and authorship statement explains the pseudonym, AI assistance, and publication circumstances. For installation and check commands, use the verification guide.
Notation index · Papers · Written proofs · Lean · Code · Complete component index · Collection