Plectis
Docs
Research
Glossary
This page
☷ Copy text
↓ Download JSON
No terms match that search. Clear the search
Start here
0–9
2-kernel General or domain usage The 2-kernel of a sequence is the family of all subsequences 𝑛 ↦ 𝑎 ( 2 𝑒 𝑛 + 𝑟 ) n ↦ a ( 2 e n + r ) , with 𝑒 ≥ 0 e ≥ 0 and 0 ≤ 𝑟 < 2 𝑒 0 ≤ r < 2 e .
Other names, related terms and sources
Also shown as two-kernel, dyadic kernel
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 175 (mathematical_source) sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex (mathematical_source)
two_kernel · mathematical concept Generated from the governed public vocabulary for Plectis.
2-regular sequence General or domain usage An integer -valued sequence is 2-regular when its dyadic subsequences generate a finitely generated module over the integers .
Other names, related terms and sources
Also shown as 2-regular, two-regular sequence, k-regular sequence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex (mathematical_source)
two_regular_sequence · mathematical concept Generated from the governed public vocabulary for Plectis.
A
a microcosm General or domain usage A microcosm is a small example that reflects features of a larger system or situation.
Calling a local case a microcosm suggests that it makes a wider pattern easier to see. The comparison is useful only to the extent that the relevant relationships are actually shared.
This ordinary sense is distinct from Microcosm, the project's earlier name. When a component illustrates a general mechanism , its evidence still applies first to the particular case that was built and checked .
Example A single public problem page with failed routes and remaining obligations can be a microcosm of how the whole project wants to be read.
Meaning scope General or domain usage. This row is the ordinary representative-case sense. The capital-M compatibility name of the old public identity is a different row, Microcosm.
Scope Ordinary representative-case usage on the why paragraph. Not the legacy product name.
Not this A .microcosm/ folder or microcosm-substrate package id is the compatibility name, not this sense.
Reader rule A representative example does not automatically establish every claim about the larger whole.
Other names, related terms and sources
Also shown as microcosm of, a microcosm of
Search handles microcosmic
microcosm_instance · public projection Generated from the governed public vocabulary for Plectis.
above and beyond System-local specialization In Plectis, “above and beyond” means doing the useful follow-through that makes a completed task easy to find, check , and continue.
close the durable loop
Finishing a change can leave a broken link, an outdated instruction, or a lesson that exists only in the conversation. This term asks the agent to fix the directly related loose ends while the context is still available.
For example, a new feature may need its existing guide updated and its check recorded so the next person can use it.
Example The Agent Completion Faithfulness Audit is a concrete instance: it is the check that compares what a pass claims it finished against what it actually closed, which is the boundary that above and beyond stays inside. See it live: Agent Completion Faithfulness Audit open the audit that checks whether a pass honestly closed its loop
Meaning scope System-local specialization. Inside ai_workflow this means bounded durable follow-through, not overwork, speculative expansion, or permission to exceed the user's scope .
Scope The term covers how a unit of work is judged complete across the system, and it appears wherever a pass reports what it finished and what it deliberately left for later, most directly on the surfaces that audit whether a pass closed its loop honestly.
Not this Above and beyond is not speculative scope expansion or doing more than was asked for its own sake. It is bounded follow-through that makes one result durable and then stops at a named boundary.
Reader rule The extra work needs a clear stopping point and must fit the user's authorised scope .
Other names, related terms and sources
Also shown as go above and beyond, going above and beyond
Search handles above-and-beyond, beyond the ask, extra mile, go further, overdeliver
Source refs doctrine skill local_to_general_propagation (skill) doctrine skill navigation_seed (skill) doctrine module agent_entry_surfaces (paper_module) governed vocabulary term_registry (vocabulary)
above_and_beyond · judgment trait Generated from the governed public vocabulary for Plectis.
absolute convergence General or domain usage A series converges absolutely if the sum of the absolute values of its terms is finite .
For a real or complex series ∑ 𝑎 𝑛 ∑ a n , this means ∑ | 𝑎 𝑛 | ∑ | a n | converges . It implies convergence of the original series and permits rearranging its terms without changing the sum .
For nonnegative terms, the two conditions coincide. Absolute convergence is useful in the papers when expanding denominators , regrouping contributions , or bounding an omitted tail by the sum of its magnitudes.
Other names, related terms and sources
Also shown as absolutely convergent, converges absolutely
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 107 (mathematical_source)
absolute_convergence · mathematical concept Generated from the governed public vocabulary for Plectis.
absolute value General or domain usage A number's nonnegative size, ignoring sign; for complex numbers it is distance from zero.
Absolute value measures size without sign. Thus | − 3 | = 3 | − 3 | = 3 , while for the complex number 𝑧 = 3 + 4 𝑖 z = 3 + 4 i , | 𝑧 | = 5 | z | = 5 because the point ( 3 , 4 ) ( 3 , 4 ) lies five units from the origin. It is zero only at zero.
In these papers absolute values measure approximation errors, bound nonzero integer expressions from below, and define polynomial regions such as { | 𝑓 ( 𝑧 ) | < 1 } { | f ( z ) | < 1 } . For vectors or functions , the related size concept usually needs a separately specified norm .
Other names, related terms and sources
Also shown as absolute values, complex modulus
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 258 (mathematical_source)
absolute_value · mathematical concept Generated from the governed public vocabulary for Plectis.
accessibility General or domain usage Accessibility is the extent to which people, including disabled people, can perceive, understand, navigate, and use information or a system.
Accessible design removes barriers such as controls that require a mouse, text with insufficient contrast, or images without useful alternatives. Different people need different ways to access the same content; a clear visual layout alone does not make a page accessible.
Accessibility concerns whether disabled people can perceive, understand, navigate, and operate a product or document. A feature can help one group while creating a barrier for another, so testing should cover concrete tasks and assistive technologies . Plectis uses keyboard controls, focus management , semantic HTML, and preserved mathematical accessibility data. Accessibility does not imply that specialist subject matter has become simple.
Example A glossary tooltip can be opened by keyboard and dismissed with Escape while retaining focus.
Meaning scope General or domain usage. Design and implementation that let people with disabilities perceive, operate, and understand a system; general availability or speed alone is insufficient.
Scope Assess accessibility against specific readers , tasks, technologies, and recognised criteria rather than treating it as a general claim of ease.
Not this Calling a page accessible because it loads quickly does not establish disability access.
Other names, related terms and sources
Also shown as accessible design, digital accessibility
Source refs sites/microcosm/lean/experience/papers/open-source-mathematics-strategy.html (reading_context)
accessibility · public projection Generated from the governed public vocabulary for Plectis.
accountability layer System-local specialization The accountability layer is the evidence and source links that let someone check what the system says it did.
records that bound claims
A visible result should lead to the run that produced it, the inputs used, and the claim that was tested. Plectis groups those connections under this name so a reader can inspect the work behind a summary.
Keeping the record and its limits together helps expose a claim that has grown broader than the work supporting it.
Example A result record that names its command, evidence class , source file , and scope limit participates in the accountability layer.
Meaning scope System-local specialization. Here, accountability layer names the records and routes around a mechanism that make one claim inspectable. It is not the only accepted use of the phrase, and it does not imply that the wider system is public or independently verified .
Scope The term covers the public records and routes that make one mechanism or claim traceable. It does not mean that every part of the larger system is public or independently verified .
Not this A confident summary with no source or result record is not an accountability layer.
Reader rule An evidence record supports the particular action or property it captures.
Other names, related terms and sources
Also shown as evidence accountability layer, claim accountability layer
Source refs tool microcosm_public_narratives (public_narrative_owner) tool build_microcosm_public_site (public_projection_builder)
accountability_layer · public projection Generated from the governed public vocabulary for Plectis.
achievement set General or domain usage An achievement set consists of all values obtained by selecting terms of a series and summing them, whenever those selected sums converge.
For nonnegative weights 𝑤 𝑛 w n with finite sum , it is { ∑ 𝑛 𝜀 𝑛 𝑤 𝑛 : 𝜀 𝑛 ∈ { 0 , 1 } } { ∑ n ε n w n : ε n ∈ { 0 , 1 } } . It includes the empty selection, finite selections, and infinite selections.
For the #257 Mersenne weights 𝑤 𝑛 = 1 / ( 2 𝑛 − 1 ) w n = 1 / ( 2 n − 1 ) , every weight exceeds the sum of its successors. At the first differing selection digit, later terms cannot cancel the difference, so each achieved value determines a unique selection. This does not itself decide which rational targets are achieved by infinite selections.
Scope Different selections can give the same value unless additional conditions ensure uniqueness. Its possible shapes include intervals and Cantor sets.
Other names, related terms and sources
Also shown as subsum set, set of subsums
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
achievement_set · mathematical concept Generated from the governed public vocabulary for Plectis.
actor axes System-coined term Actor axes are separate descriptions of an agent 's access, abilities, tools, and role in a task.
actor classification axes
Plectis uses several axes because one ranking would mix different things. Type A and Type B describe access to the working system; capability describes what the actor can do; its role describes how it participates in the work.
The same model can have different authority in two sessions, depending on the tools and material available to it.
Example A coding agent running with live access to the repository is an actor that sits at the Type A end of the substrate -authority axis, with a high capability tier and a delegated topology role, all distinguished at once by the axes. See it live: With a coding agent see a Type A actor, a coding agent with live repository access, in use
Meaning scope System-coined term. These are local actor-classification axes. They are not personality types, intelligence rankings, capability tiers, or a universal taxonomy of agents .
Scope Actor axes appear wherever the system labels who or what is acting, including handoffs between a Type B service and a Type A agent , prompt and route descriptions, and the documentation for working through a coding agent .
Not this Actor axes are not a single ranking of actors from least to most powerful, and substrate authority is not the same as intelligence or cost. An actor can be highly capable or expensive yet still sit on the Type B side because it lacks direct access to the system's real files and tools.
Reader rule A model 's reasoning ability does not determine its file permissions or access to evidence .
Other names, related terms and sources
Also shown as actor_axes, Type A/B actor axes
Search handles con_016::actor_axes, substrate authority axes, type a type b concept
Source refs standard std_agent_entry_surface (entry_standard)
actor_axes · actor Generated from the governed public vocabulary for Plectis.
admissible prime tuple General or domain usage An admissible prime tuple is a finite set of distinct integer shifts that leaves at least one residue class unoccupied modulo every prime .
For 𝐻 = { ℎ 1 , … , ℎ 𝑘 } H = { h 1 , … , h k } , admissibility means 𝜈 𝐻 ( 𝑝 ) < 𝑝 ν H ( p ) < p for every prime 𝑝 p , where 𝜈 𝐻 ( 𝑝 ) ν H ( p ) counts occupied residue classes . The pair { 0 , 2 } { 0 , 2 } is admissible; { 0 , 1 } { 0 , 1 } occupies both classes modulo 2.
#251 discusses a uniform conditional counting statement for admissible tuples whose length and shift range grow with the counting parameter. Admissibility is one hypothesis ; the quantitative prime -counting estimate is a separate, stronger assumption .
Other names, related terms and sources
Also shown as admissible tuple of shifts, admissible prime pattern
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::lines 487–497 (mathematical_source)
admissible_prime_tuple · mathematical concept Generated from the governed public vocabulary for Plectis.
admitted proof step General or domain usage An admitted proof step fills a gap with an unproved assertion so unfinished formal work can continue.
Lean 's sorry placeholder marks a step whose proof has not been supplied. Surrounding development can proceed with a warning, but declarations depending on that step inherit the gap.
A stated hypothesis describes a conditional theorem ; an admission supplies missing justification inside its development. Removing sorry is necessary for a finished result, while checking other axiom dependencies remains a separate audit task.
Example A Lean theorem completed with sorry contains an admitted proof step even though the file can still compile with a warning.
Reader rule Audit the target declaration 's dependencies , not just visible placeholders in its source . A gap can arrive through an imported lemma .
Other names, related terms and sources
Also shown as admitted step
Search handles sorry
admitted_proof_step · public projection Generated from the governed public vocabulary for Plectis.
affine function General or domain usage A linear function followed by a translation, such as 𝑥 ↦ 𝑎 𝑥 + 𝑏 x ↦ a x + b .
The function 3 𝑥 + 2 3 x + 2 is affine. In linear algebra it is not linear, because a linear map must send zero to zero. Elementary algebra sometimes uses “linear” more broadly for equations whose graphs are straight lines.
Prime -producing affine forms and affine tail recurrences organize arithmetic constraints throughout the papers .
Meaning scope General or domain usage. Algebra and geometry. Some elementary texts loosely call affine functions linear.
Scope In several variables an affine map has form 𝐴 𝑥 + 𝑏 A x + b ; differences of outputs still transform linearly.
Other names, related terms and sources
Also shown as affine map, affine form
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 126 (mathematical_source)
affine_function · mathematical concept Generated from the governed public vocabulary for Plectis.
affordance row System-coined term An affordance row is a navigation entry that explains what an item is and what opening it lets you do.
standard-owned decision handle
Meaning scope System-coined term. Here, an affordance row is a navigation record for one selectable artifact , not a database row, spreadsheet row, or visual layout primitive.
Scope Affordance rows underlie the system's browse and navigation surfaces, where each artifact kind , components , paper modules , doctrine cards and others, is listed as rows at varying depths. They appear wherever the public pages or internal tools present a menu of things to open rather than a raw file listing.
Not this An affordance row is not a row in a spreadsheet or database table, and not a styling choice for laying text out in lines. It is a structured navigation entry that bundles one option's identity, cost, evidence , edges, and state.
Reader rule The row should help a reader choose before loading the underlying files.
Other names, related terms and sources
Also shown as cognitive asset row, standard-owned affordance row
Search handles navigation row, option row, choice row
Source refs doctrine module navigation_hologram_theory (paper_module) doctrine module holographic_navigation_compression (paper_module) doctrine module unified_navigation_layer (paper_module)
affordance_row · artifact Generated from the governed public vocabulary for Plectis.
agent General or domain usage An AI agent is software that uses a model and tools to carry out steps towards a task.
An agent may read files, run commands, or propose changes, depending on its tools and permissions . In Plectis, its work is expected to leave inspectable results that another person or check can assess.
Type A and Type B describe its access to the working system. They do not rank the model 's intelligence or guarantee that its work is correct.
Example The coding-agents page tells a local agent to clone the repository and run one component .
Reader rule The agent's written account and the evidence of its actions are separate things.
Other names, related terms and sources
Also shown as AI agent
Search handles agents
agent · public projection Generated from the governed public vocabulary for Plectis.
agent reliability and safety General or domain usage Agent reliability is how consistently an AI agent completes its intended task under the conditions in which it is used.
Plectis studies specific parts of this question, including whether an agent 's report matches its actions and whether it respects the limits it was given. Tests deliberately introduce misleading notes or missing work to see whether a check detects them.
Safety also concerns harmful actions and permission boundaries. Neither reliability nor safety follows merely from a fluent answer or one passing example.
Example Reading an agent 's close-out note against the commits and test runs it cites.
Reader rule A successful test supports the behaviour and conditions that the test actually covers.
Other names, related terms and sources
Also shown as agent reliability
Search handles reliability and safety
agent_reliability · public projection Generated from the governed public vocabulary for Plectis.
agent seed System-coined term An agent seed is a saved record of an agent 's observations and interpretations, with its author and sources identified.
agent authored durable synthesis
Plectis keeps this material separate from raw seed , which preserves the operator's own words. That separation lets useful agent analysis survive a session without being mistaken for something the operator said or intended.
For example, an agent can record a recurring failure and the evidence behind its proposed explanation while preserving the original instruction unchanged.
Example The Voice To Doctrine Self Improvement Loop is the component that carries agent-authored seed material onward, taking what an agent recorded and folding it into the system's standing doctrine while preserving who wrote it. See it live: Voice To Doctrine Self Improvement Loop see where agent-authored seed material feeds back into doctrine
Meaning scope System-coined term. Agent seed is the local agent -authored synthesis substrate ; it is not operator voice, a random seed, training data, or a public research seed by default.
Scope Agent seed names the attributed AI-authored layer of the system's substrate , sitting alongside the operator-voice raw seed . A reader meets it on the pages about agent reliability and about how agent observations feed back into the system's doctrine .
Not this An agent seed is not the operator's own voice and not source authority on intent. It is also not the agent 's private working memory: it is durable, attributed material meant to be kept, distinct from the raw seed that records the operator directly.
Reader rule An agent seed is material to assess and reuse, with authority appropriate to its sources .
Other names, related terms and sources
Also shown as agent_seed, agent_seed.md, agent-authored seed
Search handles agent voice
Related terms distinct_from raw_seed Agent seed is attributed agent voice, not operator voice. supports up_propagate Agent learning can be routed upward through the right lane.
Source refs doctrine module agent_seed_substrate (paper_module) standard std_agent_seed (standard)
agent_seed · substrate Generated from the governed public vocabulary for Plectis.
agent trace General or domain usage An agent trace is a recorded sequence of events from an agent session, such as tool calls, outputs, and file operations.
The trace provides evidence against which to compare the agent 's summary. It can show which command was invoked, what result returned, and what happened next, within the events the recording system captures.
An unrecorded event cannot automatically be treated as an event that never happened. Plectis audits should make that coverage boundary clear when they use traces as evidence .
Example The closeout faithfulness audit compares what a session reported against what its trace shows it did.
Meaning scope General or domain usage. In Plectis, an agent trace is captured session-event evidence used to audit an agent ’s report; it is not the report itself, a complete record beyond the capture surface, or a verdict that the work was correct.
Scope An agent trace establishes the events captured by the named tracing surface during one session. It does not by itself establish completeness, intent, correctness, or the absence of unrecorded activity.
Reader rule A trace is only as complete as its instrumentation and retention.
Other names, related terms and sources
Also shown as agent traces
Source refs doctrine module agent_trace_ontology (source_authority) standard std_agent_execution_trace (source_authority)
agent_trace · public projection Generated from the governed public vocabulary for Plectis.
AI-native General or domain usage AI-native describes a system designed from the outset for AI to take part in its normal operation.
designed around AI agents
In Plectis, agents read structured context, use tools, make bounded changes, and leave records that later work can inspect . The files, interfaces , and checks are arranged to support that participation.
Human direction, permissions , and independent checks still matter. A workflow can be built around AI and still need substantial supervision or correction.
Example A workflow in which an agent reads a source route, claims a file, performs a bounded change, runs a validator , and leaves a result record is AI-native.
Meaning scope General or domain usage. The glossary uses AI-native in a broad architectural sense and does not certify one universal definition. The label does not establish model quality, autonomy, safety, or correctness.
Scope The term covers workflow architecture built around agent execution . It does not establish model quality, autonomy, safety, or correctness.
Not this Adding a chat box to an otherwise unchanged application does not by itself make the application AI-native.
Reader rule The term describes a design choice, not a measured level of intelligence or reliability .
Other names, related terms and sources
Also shown as AI-native workflow, AI-native system
Search handles AI native, agent-native workflow
Source refs tool microcosm_public_narratives (public_narrative_owner) doctrine module system_constitution_seed (system_theory)
ai_native · public projection Generated from the governed public vocabulary for Plectis.
algebraic field General or domain usage An algebraic field supports addition, subtraction, multiplication, and division by nonzero elements under the usual commutative arithmetic laws.
Meaning scope General or domain usage. Abstract algebra and number theory . Distinct from data fields and vector fields.
Scope Zero and one must be distinct; every nonzero element has a multiplicative inverse, and multiplication distributes over addition. A data field and a vector field are different concepts .
Other names, related terms and sources
Also shown as field of scalars, coefficient field
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 54 (mathematical_source)
mathematical_field · mathematical concept Generated from the governed public vocabulary for Plectis.
algebraic integer General or domain usage An algebraic integer is a complex algebraic number satisfying a monic polynomial with integer coefficients .
For example, √ 2 2 satisfies 𝑇 2 − 2 T 2 − 2 and is an algebraic integer. A rational number is an algebraic integer exactly when it is an ordinary integer ; 1 / 2 1 / 2 is not one.
The #243 reasoning surface compares its square obstruction with the general case of a nonsquare algebraic integer in a number field . Its actual cubic proof also excludes finitely many primes to handle denominators before reducing algebraic quantities. Those exclusions should not be replaced by an unsupported claim that every displayed element is integral.
Scope Being algebraic over ℚ Q alone is weaker. A nonmonic integer polynomial may show algebraicity without showing integrality.
Other names, related terms and sources
Also shown as algebraic integers
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 409 (mathematical_source)
algebraic_integer · mathematical concept Generated from the governed public vocabulary for Plectis.
algebraic number General or domain usage A complex number satisfying some nonzero polynomial equation with integer coefficients .
Every rational number is algebraic because 𝑝 / 𝑞 p / q solves 𝑞 𝑥 − 𝑝 = 0 q x − p = 0 . The irrational number √ 2 2 is algebraic because it solves 𝑥 2 − 2 = 0 x 2 − 2 = 0 .
The totient discussion explains that a digit-complexity theorem applying to algebraic irrationals cannot be used until algebraicity of the target sum is independently known.
Other names, related terms and sources
Also shown as algebraic numbers
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 6295 (mathematical_source)
algebraic_number · mathematical concept Generated from the governed public vocabulary for Plectis.
algorithm General or domain usage An algorithm is an explicit procedure for turning permitted inputs into outputs or decisions.
Algorithms range from sorting recipes to search and learning procedures. A description should identify valid inputs, steps, stopping conditions, and outputs. Correctness concerns whether the procedure meets its specification ; efficiency concerns resources such as time and memory. An algorithm is the method, while one execution is a particular run on particular inputs.
An algorithm is an abstract procedure, independent of any particular programming language or machine. To assess one, specify its admissible inputs, output relation, sequence of steps, stopping behavior, and resource costs. Correctness asks whether every permitted execution meets the specification ; complexity studies how time or space grows with input size. Randomized algorithms also expose a probability model . An implementation can mistranslate a sound algorithm, and a sound method can still be unsuitable for biased data, hostile inputs, or operational constraints.
Example A resolver can use a longest-match algorithm to choose one glossary phrase without overlapping links.
Scope An algorithm covers the declared input domain , steps, and output contract .
Not this A vague strategy such as “try likely options” is not an algorithm until its steps and stopping condition are specified.
Reader rule A named algorithm does not establish that its implementation is correct, efficient, unbiased, or suitable for the present data.
Other names, related terms and sources
Also shown as computational procedure
Search handles algorithms
algorithm · public projection Generated from the governed public vocabulary for Plectis.
almost surely General or domain usage A property holds almost surely when the set of outcomes where it fails has probability zero.
The phrase allows exceptional outcomes; it does not mean the property holds everywhere. On a continuous probability space , even a nonempty or infinite set of outcomes can have probability zero.
The #257 note's limiting profinite observable is infinite almost surely, although its values at positive integer inputs are finite . Those exceptional inputs do not contradict the measure-theoretic statement or justify a finite integral.
Meaning scope General or domain usage. The probability-one meaning is intended, equivalent to almost everywhere for a probability measure . It differs from high probability, eventual occurrence on every trajectory, and a universal assertion.
Scope Specify the measure and the property, including any quantifiers. Probability one for each separate event is not automatically a simultaneous assertion over an uncountable family.
Other names, related terms and sources
Also shown as almost-sure, with probability one, probability one
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
almost_surely · mathematical concept Generated from the governed public vocabulary for Plectis.
analytic continuation General or domain usage Analytic continuation extends a holomorphic function beyond its initial domain while agreeing with the original function wherever both are defined.
The geometric series 1 + 𝑧 + 𝑧 2 + … 1 + z + z 2 + … defines 1 / ( 1 − 𝑧 ) 1 / ( 1 − z ) only for | 𝑧 | < 1 | z | < 1 , but the rational function supplies an analytic continuation to every complex z except 1. Agreement on an overlap makes the extension unique on a connected domain.
Here an inverse branch is continued across a larger disc. The proof must rule out critical or branch points and escape to infinity; merely writing the same formula outside the starting neighbourhood would not justify continuation.
Example The geometric series 1 + 𝑧 + 𝑧 2 + … 1 + z + z 2 + … defines 1 / ( 1 − 𝑧 ) 1 / ( 1 − z ) only for | 𝑧 | < 1 | z | < 1 , but the rational function supplies an analytic continuation to every complex z except 1.
Meaning scope General or domain usage. Continuation preserves complex analyticity. Different paths can produce different branches, even when continuation is locally unique.
Scope Continuation may proceed along paths and can fail at singularities. Different paths can lead to different branches unless a monodromy condition removes the ambiguity. It is more restrictive than any smooth extension because it must remain complex analytic .
Other names, related terms and sources
Also shown as holomorphic continuation
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1080 (mathematical_source)
analytic_continuation · mathematical concept Generated from the governed public vocabulary for Plectis.
analytic function General or domain usage A function that near every point is represented by a convergent power series ; over the complex numbers this is equivalent to being holomorphic .
Meaning scope General or domain usage. The adjective analytic can also mean reasoning-based rather than computational; this entry is only the mathematical regularity property.
Scope Specify whether the variables are real or complex: complex analytic means holomorphic , while real analytic is stronger than merely smooth.
Not this The real function e x p ( − 1 / 𝑥 2 ) exp ( − 1 / x 2 ) for x not equal to zero, extended by zero at 𝑥 = 0 x = 0 , is smooth but not analytic at zero.
Other names, related terms and sources
Also shown as real-analytic function, complex-analytic function
analytic_function · mathematical concept Generated from the governed public vocabulary for Plectis.
annex System-local specialization An annex is Plectis's source -linked account of ideas or techniques drawn from an outside project.
curated external substrate
It records what an external framework, repository , or document offers and how a useful pattern might apply locally. The aim is to make prior work available before an agent invents another implementation .
Adapting a technique requires a separate local decision and check ; an annex does not establish that the technique has already been integrated or works here.
Example The Pattern Binding Contract is a concrete instance: a component that governs how a borrowed external pattern is bound into the system's own form before it is allowed to take effect. See it live: Pattern Binding Contract open the component that binds a borrowed pattern into local form
Meaning scope System-local specialization. Here annex means curated external prior art adapted into the local doctrine graph , not merely an appendix attached to a document.
Scope Annex covers the layer of curated external references the system draws on for design patterns and prior art . A reader meets it in the import and drift -control area and wherever a component records that its shape was informed by outside work.
Not this An annex is not a dependency , a fork, or imported source code that the system runs. It is a pattern-level note about outside work, kept separate from the system's own authority .
Reader rule The original source remains the authority on what the outside project actually does.
Other names, related terms and sources
Also shown as annex note, annex substrate
Search handles curated external, adapted substrate, annex family, pattern fuel, annex prior art, annex prior-art pressure, prior art pressure field
Source refs doctrine module codex_annex_substrate (paper_module) doctrine skill annex_pattern_transfer (skill) standard std_annex_notes (standard)
annex · substrate Generated from the governed public vocabulary for Plectis.
annihilator of a subspace General or domain usage The linear functionals that vanish on every vector of a specified subspace.
For a linear subspace U of V, its annihilator 𝑈 0 U 0 is { ℓ ∈ 𝑉 ∗ : ℓ ( 𝑢 ) = 0 f o r e v e r y 𝑢 ∈ 𝑈 } { ℓ ∈ V ∗ : ℓ ( u ) = 0 for every u ∈ U } . It belongs to the dual space of linear functionals. In finite dimensions , d i m 𝑈 0 = d i m 𝑉 − d i m 𝑈 dim U 0 = dim V − dim U .
The #269 torus proof studies the rational annihilator of the velocity-containing subspace. If two coordinate forms were dependent there, a rationally defined relation supported on those coordinates would yield an integer relation and contradict the irrational ratio of the corresponding logarithms .
Meaning scope General or domain usage. This is the dual-space linear-algebra annihilator, not an ideal-theoretic annihilator; rationality of a relation requires a separate rational -structure argument.
Scope No inner product is needed. An orthogonal complement lives in the original space after choosing an inner product ; identifying it with the annihilator requires that additional identification. Both the ambient space and scalar field must be specified.
Other names, related terms and sources
Also shown as subspace annihilator
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::line 809 (mathematical_source)
annihilator_subspace · mathematical concept Generated from the governed public vocabulary for Plectis.
annulus General or domain usage An annulus is the region between two concentric circles, usually written { 𝑧 : 𝑟 < | 𝑧 − 𝑎 | < 𝑅 } { z : r < | z − a | < R } with 0 ≤ 𝑟 < 𝑅 0 ≤ r < R .
The set 1 < | 𝑧 | < 2 1 < | z | < 2 is an open annulus. Unlike a disc, it has a hole: a loop going once around the origin cannot be shrunk to a point while remaining in the annulus.
The displayed inequality defines an open circular annulus; including one or both boundary circles gives a closed or partly closed version. When 𝑟 = 0 r = 0 , the centre is still excluded, producing a punctured disc. The word is also used for regions with the same topology. In the paper , cutting an annulus along an arc joining its boundaries changes its topology and can remove the closed loops that carry winding information.
Example The set 1 < | 𝑧 | < 2 1 < | z | < 2 is an open annulus.
Meaning scope General or domain usage. Open and closed annuli differ in whether their boundary circles are included. A topological annulus need not have circular boundaries.
Scope Open or closed boundary conventions must be stated. In complex analysis, “annulus” often means the open region 𝑟 < | 𝑧 − 𝑎 | < 𝑅 r < | z − a | < R ; a topological annulus may mean any space homeomorphic to such a region.
Other names, related terms and sources
Also shown as annular region
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 752 (mathematical_source)
annulus · mathematical concept Generated from the governed public vocabulary for Plectis.
anti-principle System-local specialization An anti-principle names a recurring shortcut or failure pattern that the system is meant to avoid.
named refuse shortcut
Where a principle describes a desired way of working, an anti-principle makes a specific bad practice recognisable. It connects the refusal to the requirement it protects, so the rule can be applied to real cases.
For example, treating a plausible summary as evidence of a completed action would defeat a requirement to check the actual execution record .
Example AP-9 names the shortcut of writing a live value into durable prose as if it were fixed; AX-10 is the axiom that requires the value, as-of time, basis , and refresh route instead. See it live: What doctrine refuses open the anti-principle cards on the doctrine page
Meaning scope System-local specialization. An anti-principle is a named shortcut this system refuses. It is not a moral prohibition, a legal ban, or a claim that the named pattern is always wrong outside this lattice .
Scope Anti-principles appear as their own kind on the doctrine page and as numbered AP cards in the doctrine reference .
Not this A vague warning such as "be careful" is not an anti-principle. The shortcut and the skipped obligation have to be named.
Reader rule The useful question is which concrete behaviour would violate the rule.
Other names, related terms and sources
Also shown as anti-principles
Search handles named shortcut to refuse
Source refs tool microcosm_public_narratives (public_projection) doctrine module system_constitution_seed (paper_module)
anti_principle · doctrine Generated from the governed public vocabulary for Plectis.
Apache-2.0 Externally anchored Apache-2.0 is an open-source licence allowing use, modification, and redistribution, including commercial use, subject to its conditions.
Redistribution requires a copy of the licence, retention of applicable notices, and prominent notices of changed files. An included NOTICE file can add attribution requirements. The licence also contains a patent grant and its conditions.
Apache-2.0 does not grant general trademark rights and provides the work without warranties. The linked licence text controls the exact terms.
Example The public repositories are released under Apache-2.0.
Scope Apache-2.0 is published by the Apache Software Foundation; its text is the authority , not this gloss.
Reader rule The licence attached to the particular repository or file determines what is covered.
Other names, related terms and sources
Also shown as Apache License 2.0
apache_2_0 · public projection Generated from the governed public vocabulary for Plectis.
API General or domain usage An API is a defined interface through which software requests operations or data from another software component .
An API specifies available operations, input forms, returned values, and errors so separately built programs can cooperate. It may be a local library interface , an operating-system call, or a remote service.
An API can expose functions inside one process, communication between local processes, hardware services, or requests to a remote server . Its documentation describes the public contract rather than the provider ’s internal implementation . Versions may change accepted inputs or response fields. Authorization , quotas, latency , availability, pricing, and data retention are separate operational conditions. A successful API response proves that the interface returned that result under one request; interpreting or trusting the result still depends on provenance , semantics, validation , and error handling.
Scope The API contract determines how callers interact with an implementation ; transport over a network is common but not required.
Other names, related terms and sources
Also shown as application programming interface, APIs, application-programming interface
Source refs sites/microcosm/docs/components.html (reading_context) sites/microcosm/docs/paper-module-batch12-prediction-market-board-capsule.html (reading_context)
api · public projection Generated from the governed public vocabulary for Plectis.
appeal lifecycle System-coined term An appeal lifecycle is the process for challenging a system decision and recording how the challenge was resolved.
judgment challenge lifecycle
A disputed label or result is examined, its cause is identified, and responsibility for any repair is assigned. The outcome records the reasoning and supporting evidence so later work can tell whether the decision still stands.
Plectis uses the record to distinguish a faulty implementation from a faulty expectation: sometimes the check needs repair, and sometimes the rule being checked needs revision.
Example The operator-court appeal ledger is a concrete appeal lifecycle in use: entries record judgments that operators have challenged, the classified cause, and the rationale that closes each one, fed by the Cognitive Operator Registry that holds the operator contract . See it live: Cognitive Operator Registry open the component that records and validates operator-raised challenges
Meaning scope System-coined term. An appeal lifecycle is the system’s internal path for contesting and repairing a recorded judgment; it is not a legal appeal process or an informal objection left in chat.
Scope The term covers governance over contested judgments across the system, including challenges raised by operator review, route judgment, and projection checks . A reader meets it wherever a label or decision can be formally disputed and tracked to resolution.
Not this An appeal lifecycle is not a legal court process and not a record of a row that errored and was discarded. It is the tracked path a deliberately contested judgment follows from challenge to recorded resolution.
Reader rule An appeal can confirm a decision, correct it, or reopen the question.
Other names, related terms and sources
Also shown as appeal_lifecycle, operator court appeal
Search handles appeal row, appeal review
Source refs doctrine module workingness_instrument (paper_module)
appeal_lifecycle · governance Generated from the governed public vocabulary for Plectis.
apply System-local specialization In Plectis, apply is the step that makes a specified change to a file or record .
execute verified changes
It follows observation or a proposal by naming the target and performing the permitted operation. The operation should check the conditions for the change and validate the resulting state.
Recording the operation, target, and result makes later inspection possible. Where an operation is reversible, its record can also explain how to undo it without disturbing unrelated work.
Example The doctrine card "Blind irreversible mutation" (AP-8) is a concrete instance: it marks an apply that changes source state without a clear target, validation , or way to undo it, which is exactly what the apply lane is built to prevent. See it live: Blind irreversible mutation see the failure the apply lane guards against, named as a doctrine card
Meaning scope System-local specialization. Apply names the governed mutation lane when used as an ai_workflow noun; it does not redefine the ordinary verb 'apply'.
Scope The term covers the mutation lane of the system, the part that writes changes rather than merely reading or proposing them. A reader meets it on the architecture map , in the component that authorises governed mutation, and in the doctrine cards that mark what an unsafe apply looks like.
Not this An apply is not the gathering or proposing of candidate changes, and it is not any edit made freely without a stated target, validation , or rollback . Those are observations or unsafe mutations, not a governed apply.
Reader rule A proposed change has not taken effect until the apply step succeeds.
Other names, related terms and sources
Also shown as apply lane, apply plan, mutation
Search handles patch
Source refs doctrine skill apply (skill) standard std_apply (standard)
apply · runtime Generated from the governed public vocabulary for Plectis.
architecture General or domain usage Architecture is the high-level arrangement of a system’s parts, responsibilities, boundaries, constraints, and connections.
An architecture explains how information, control, authority , and failure move among components and why major responsibilities are separated. Software architecture is one domain use; buildings and organizations also have architecture, but this glossary emphasizes designed technical systems.
Architecture sits between purpose and implementation . It narrows which implementations fit while leaving local choices open. Useful views may show runtime communication, data ownership, deployment , security boundaries, or source -generation relationships; no single diagram necessarily captures them all. Boxes and arrows become architectural evidence only when they correspond to maintained objects and defined relations. The documented architecture can also drift from the running system, so source maps, tests , and operational observations are needed to verify that the intended structure remains real.
Example Separating source authority from generated projection is an architectural boundary.
Scope The term covers the documented structural design of software , evidence , and publication systems.
Not this A visual arrangement of boxes without defined responsibilities is not an architecture.
Reader rule Read an architectural claim by locating the real components , interfaces , ownership boundaries, flows, and constraints that the description says should exist.
Other names, related terms and sources
Also shown as architectures, system architecture, software architecture
architecture · public projection Generated from the governed public vocabulary for Plectis.
argument principle General or domain usage The change in argument of a meromorphic function around a boundary counts its zeros minus its poles inside.
If f is meromorphic on a neighbourhood of a positively oriented, piecewise smooth simple closed contour and its enclosed region, with no zero or pole on the contour, 1 2 𝜋 𝑖 ∮ ( 𝑓 ′ / 𝑓 ) 𝑑 𝑧 1 2 π i ∮ ( f ′ / f ) d z equals the number of zeros minus the number of poles, each counted with multiplicity.
At regular lemniscate levels, #1041 uses the total argument change around a component to identify its root count. Combined with a coarea calculation and Cauchy–Schwarz , this supplies one input to the area-based connector estimate.
Meaning scope General or domain usage. The contour statement assumes meromorphicity near the enclosed region and absence of boundary zeros or poles.
Scope Boundary zeros or poles invalidate this formula without a separate limiting or indentation argument. The counted quantity is a winding number , so it records multiplicity and orientation rather than geometric length.
Other names, related terms and sources
Also shown as principle of the argument
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 972 (mathematical_source)
argument_principle · mathematical concept Generated from the governed public vocabulary for Plectis.
arithmetic progression General or domain usage A sequence obtained by repeatedly adding one fixed difference.
The numbers 2,7,12,17,… form an arithmetic progression with first term 2 and common difference 5; its nth term is 2 + 5 𝑛 2 + 5 n under zero-based indexing.
Dirichlet's theorem supplies primes in suitable arithmetic progressions, letting the totient argument engineer prescribed congruence and fresh-prime behavior.
Scope For a nonzero integer common difference d, extending the progression over all integer indices gives one residue class modulo | 𝑑 | | d | . A geometric progression instead repeatedly multiplies by a fixed ratio.
Other names, related terms and sources
Also shown as arithmetic sequence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 1698 (mathematical_source)
arithmetic_progression · mathematical concept Generated from the governed public vocabulary for Plectis.
artifact General or domain usage An artifact is a stored item that someone can inspect or use, such as a file, report, dataset , or generated page.
Plectis uses the term for the concrete objects its work produces and maintains. An artifact has an identity and a role; it may be original source material , a record of an action, or a view generated from other data.
A report about a test and the test's source code are both artifacts, but they provide different kinds of evidence .
Example A JSON result record , a glossary page, and a Lean source file are all artifacts with different authority roles.
Scope Artifact covers durable, independently identifiable objects in the repository and public projection .
Not this An artifact is not automatically authoritative , current, or public merely because it exists on disk.
Reader rule Its role determines how it should be read and changed.
Other names, related terms and sources
Also shown as work artifact
Search handles generated artifact, source artifact
artifact · public projection Generated from the governed public vocabulary for Plectis.
artifact kind System-coined term An artifact kind is a category of stored object, such as a standard , paper module , component , or result record .
artifact class
The category helps Plectis choose the right schema, editing rules, and navigation view for an item. A reader can start with a collection of one kind before choosing an individual object.
For example, a component implements a check , a standard states its requirements, and a result record describes one execution of it.
Example "Components " is an artifact kind: the class of self-contained units of working machinery, with every such unit listed together on the components page. See it live: All components browse every item of one kind on a single page
Meaning scope System-coined term. Artifact kind is the registry category used to choose a browse surface, such as component , paper module , or standard ; it is not a filename extension or MIME type.
Scope Artifact kinds organise the browsable surface of the system. A reader meets them as the top-level groupings on the public pages, such as the components page, the paper modules page, and the doctrine page, each of which holds the items of one kind.
Not this An artifact kind is not a single file, component , or page on its own. It is the category that groups many such items, the type they share rather than any one instance.
Reader rule Two artifacts can concern the same subject while belonging to different kinds.
Other names, related terms and sources
Also shown as artifact_kind, kind
Search handles kind id, kind atlas kind, atlas kind, artifact class
Source refs runtime module kind_atlas (code) standard std_kind_atlas (standard) runtime module standard_option_surface (code)
artifact_kind · artifact Generated from the governed public vocabulary for Plectis.
assimilation System-coined term Assimilation is the process of incorporating a useful result into the system so later work can use it.
Meaning scope System-coined term. On the architecture page, assimilation is the last spine step after explanation: feeding a checked result into the next pass. It is not a synonym for understanding.
Scope Public spine and the pattern-assimilation component .
Not this A fluent summary of a run is not assimilation until a record exists that a later pass can open.
Reader rule A note left only in a conversation has not completed that process.
Other names, related terms and sources
Also shown as assimilation loop
assimilation · public projection Generated from the governed public vocabulary for Plectis.
assistive technology General or domain usage Assistive technology is hardware or software that helps a disabled person perceive, operate, understand, or communicate with a system.
Examples include screen readers , screen magnifiers, speech input, switch controls, alternative keyboards, and refreshable braille displays. People use them in varied combinations with browsers and operating systems.
Assistive technology often relies on semantic structure, names, roles, states, focus order, and text alternatives exposed by an application. Visual appearance alone may not supply this information. Plectis preserves accessible mathematical markup and uses focus and description relationships for glossary help. Compatibility can vary across browser and technology combinations, so standards and representative testing both matter.
Example A screen reader announces a focused glossary term and the definition linked through aria-describedby.
Meaning scope General or domain usage. Technology used by a person with a disability to access or operate content or systems; an accessibility -related visual setting is not itself necessarily assistive technology.
Scope An interface should expose meaningful names, roles, states, and reading order so the reader ’s chosen technology can use it.
Not this Changing a site’s colour theme does not by itself provide a screen reader or another assistive device, although the chosen colours can affect accessibility .
Other names, related terms and sources
Also shown as assistive technologies
Source refs sites/microcosm/lean/experience/papers/open-source-mathematics-strategy.html (prerequisite_context)
assistive_technology · public projection Generated from the governed public vocabulary for Plectis.
asymptotic bound General or domain usage An asymptotic bound compares the sizes of functions once their input is sufficiently large or approaches a specified limit .
For example, 𝑓 ( 𝑛 ) = 𝑂 ( 𝑔 ( 𝑛 ) ) f ( n ) = O ( g ( n ) ) as n tends to infinity means | 𝑓 ( 𝑛 ) | ≤ 𝐶 | 𝑔 ( 𝑛 ) | | f ( n ) | ≤ C | g ( n ) | for some fixed C and all sufficiently large n. The notation hides that constant and initial threshold .
The papers use such comparisons to constrain potential counterexamples . Constants and parameter dependence must be recovered when an argument needs an explicit finite range.
Scope It is a bound on growth, not an exact formula or necessarily an estimate valid at small inputs.
Other names, related terms and sources
Also shown as big-O bound, order bound
Source refs sites/microcosm/maths/problems/erdos_243.html::line 132 (mathematical_source)
asymptotic_bound · mathematical concept Generated from the governed public vocabulary for Plectis.
asymptotic density General or domain usage Asymptotic density is the limiting proportion of positive integers up to N that belong to a set.
The even integers have density 1 / 2 1 / 2 ; the squares have density zero despite being infinite . Form | 𝐴 ∩ { 1 , … , 𝑁 } | / 𝑁 | A ∩ { 1 , … , N } | / N and let N grow.
Frequency is different from summability or independence. A density-zero support can have a divergent reciprocal sum , and long dense islands can coexist with ordinary density zero. The #251 theorem uses upper Banach density zero , which rules out a positive proportion in arbitrarily long intervals uniformly over their starting point.
Other names, related terms and sources
Also shown as natural density, density of integers
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 697 (mathematical_source) sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex (mathematical_source)
asymptotic_density · mathematical concept Generated from the governed public vocabulary for Plectis.
asymptotic equivalence General or domain usage Two functions are asymptotically equivalent at a specified limit if their ratio tends to one.
The functions 𝑛 + 1 n + 1 and n are asymptotically equivalent as n tends to infinity because ( 𝑛 + 1 ) / 𝑛 ( n + 1 ) / n tends to 1. Their difference remains 1, showing that asymptotic equivalence compares relative rather than absolute error.
In the denominator and least-common-multiple arguments, asymptotic equivalence isolates the leading growth while suppressing lower-order terms. It does not supply exact equality , effective thresholds , or usable constants unless those are proved separately.
Meaning scope General or domain usage. Limits and growth. Authors sometimes use 'asymptotic' informally; the symbol ∼ has the precise ratio meaning.
Scope Write 𝑓 ∼ 𝑔 f ∼ g only after naming the limit and ensuring g is nonzero nearby. The statement means 𝑓 / 𝑔 → 1 f / g → 1 . It is stronger than 𝑓 = 𝑂 ( 𝑔 ) f = O ( g ) and 𝑔 = 𝑂 ( 𝑓 ) g = O ( f ) , which allow a fixed multiplicative gap.
Other names, related terms and sources
Also shown as asymptotically equivalent, asymptotically equal
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 436 (mathematical_source)
asymptotic_equivalence · mathematical concept Generated from the governed public vocabulary for Plectis.
asymptotic expansion General or domain usage An ordered approximation whose truncation errors are controlled relative to successive smaller terms in a specified limit .
For example 𝑓 ( 𝑥 ) ∼ 𝑎 0 + 𝑎 1 / 𝑥 + 𝑎 2 / 𝑥 2 + … f ( x ) ∼ a 0 + a 1 / x + a 2 / x 2 + … means that every fixed finite truncation has the corresponding smaller-order remainder as x tends to infinity. The coefficients describe increasingly fine scales; the infinite series itself need not converge.
The #1049 paper computes a first coefficient correction of order 1 / 𝑘 1 / k with an 𝑂 ( 𝑘 − 2 ) O ( k − 2 ) remainder. Summing its logarithm produces a power of N in the determinant asymptotic. The finer correction matters even though the dominant exponential and factorial factors are already known.
Meaning scope General or domain usage. The Poincaré notion controls each fixed truncation ; convergence of the displayed infinite series and uniform parameter control are separate properties.
Scope State the limiting variable and region, and whether estimates are uniform in other parameters. Differentiating an expansion generally needs additional hypotheses. A two-term approximation does not establish a full expansion to arbitrary order.
Other names, related terms and sources
Also shown as Poincaré asymptotic expansion, Poincare asymptotic expansion
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2256 (mathematical_source)
asymptotic_expansion · mathematical concept Generated from the governed public vocabulary for Plectis.
Atlas System-local specialization The Atlas is Plectis's navigable map of the system's parts and their relationships.
It helps a reader or agent move from an overview to a particular component , source , work record , or check . Its entries are derived from the system's stored information so the map can be refreshed as that information changes.
An Atlas entry is a route to inspect something; appearing on the map alone does not establish that the object is complete, current, or validated .
Example The Why section says we will start with the Atlas, the full system.
Meaning scope System-local specialization. On the landing, Atlas is the full-system contents map used to select a target. It is not a geographic atlas, and not by itself the public site.
Scope Landing walkthrough of the unpublished operator interface .
Not this Atlas is not the glossary itself, and not a claim that every internal cluster is public.
Reader rule The public site exposes a selected part of the wider system map .
Other names, related terms and sources
Also shown as Surface Atlas
Search handles system atlas
atlas · public projection Generated from the governed public vocabulary for Plectis.
Atom feed Externally anchored An Atom feed is an XML document for syndicating entries such as articles or updates, with identifying and descriptive metadata .
Each entry commonly carries a stable identifier , title, update time, link, author information, and summary or content. A reader polls the published feed URL and decides locally how to display or retain new entries . Atom is an open syndication format related to RSS.
Atom defines XML elements and rules for identifying, dating, linking, and carrying entries . Stable entry identifiers help readers avoid duplicates when titles or URLs change, while updated timestamps signal revisions. Feeds can contain full content or summaries and may paginate or archive older entries separately. Polling frequency belongs to the reader , so delivery is not instantaneous. The format enables decentralized subscription without requiring an email address, but server logs may still record ordinary requests and therefore should not be described as absolute reader anonymity.
Example A feed reader checks the updates file and shows what is new.
Scope Atom is an open syndication standard , external to this work.
Reader rule A feed reports only entries the publisher includes; subscribing does not notify the publisher or prove that every site change appears in the feed.
Other names, related terms and sources
Also shown as atom, feed
atom_feed · public projection Generated from the governed public vocabulary for Plectis.
audit General or domain usage An audit is a systematic examination of records against stated requirements; here it often checks whether an agent 's report matches its actions.
For example, a completion audit can compare a claim that tests passed with the commands and results recorded for that session. This is narrower than deciding whether the tests adequately assess the software .
An accurate report of a poorly tested change can pass a report-faithfulness audit. Assessing the underlying change requires additional evidence and appropriate checks .
Example The closeout faithfulness audit compares a session's report against its trace.
Scope An audit establishes the agreement between a report and a record .
Reader rule Read the audit's stated criteria to see which question it answers.
Other names, related terms and sources
Also shown as audits, audited
audit · public projection Generated from the governed public vocabulary for Plectis.
authentication General or domain usage Authentication is the process of checking a claim about who or what an actor is.
A system may authenticate a person, account, device, or service with passwords, keys, certificates , tokens, or multiple factors . Authentication differs from authorization , which determines permitted actions.
Authentication compares presented evidence with an identity system’s rules. It may establish control of an account or cryptographic key without proving a legal name or broader trustworthiness. Sessions often remember a successful check for a limited time. Plectis definitions of credentials , clients , webhooks , and HTTPS rely on this distinction: verifying identity is separate from deciding what that identity may read, change, publish, or trigger.
Example A service verifies a webhook signature tied to a registered sender.
Meaning scope General or domain usage. Verification of a claimed identity or source , distinct from deciding what an authenticated party is permitted to do.
Scope State the identity claim and assurance method; successful authentication does not grant every permission .
Not this Knowing a public username does not authenticate control of that account.
Other names, related terms and sources
Also shown as authenticate, authenticated identity
Source refs sites/microcosm/docs/architecture.html (prerequisite_context)
authentication · public projection Generated from the governed public vocabulary for Plectis.
authority General or domain usage Authority is the recognised basis for settling a particular question or permitting an action.
Plectis assigns authority by subject. Source code establishes what an implementation contains; an execution record reports a captured run; the operator's instructions determine intended scope . Each source can settle some questions and leave others unanswered.
A generated page can help you find authoritative material, but a convenient or confident summary does not acquire the authority of the source it describes.
Example The term registry is authoritative for glossary membership, while the generated glossary page is not.
Scope Authority covers the decision class, artifact , time, and conditions named by its governing contract .
Not this Confidence, prominence, or repetition does not create authority.
Reader rule Identify both the source and the kind of decision it can support .
Other names, related terms and sources
Also shown as decision authority
Search handles authoritative
authority · public projection Generated from the governed public vocabulary for Plectis.
authorization General or domain usage Authorization determines which actions a person, program , or role is permitted to perform on specified resources.
Authentication checks identity; authorization determines permitted actions. A policy can also allow an anonymous user to read public material without identifying them. Technical capability does not itself grant permission , and permission for one action need not cover another.
Authorization answers whether a particular actor may perform a particular operation on a resource under current conditions. The decision can come from access-control roles, explicit user consent, ownership, organizational policy, or delegated authority . Good authorization is scoped: permission to read one file does not imply permission to publish it, and approval to prepare a message does not imply approval to send it. Authentication supplies an identity claim but does not determine every allowed action. Authorization can also expire or be revoked, so past permission is not automatically authority for a materially different target or time.
Scope An authorization decision binds an actor, action, target, conditions, and duration through policy, ownership, consent, role, or delegated authority .
Other names, related terms and sources
Also shown as authorise, authorize, authorised, authorized
Source refs sites/microcosm/docs/architecture.html (reading_context) sites/microcosm/docs/doctrine.html (reading_context)
authorization · public projection Generated from the governed public vocabulary for Plectis.
axiom System-local specialization An axiom is a starting assumption of a mathematical theory; Plectis also uses the word for a fundamental system rule.
nearly-mathematical system rule
Meaning scope System-local specialization. An ai_workflow axiom is a promoted system constraint. It is not automatically a mathematical axiom, self-evident truth, or externally accepted principle .
Scope On maths pages, the mathematical or Lean sense. On doctrine pages, the system constraint sense. The same English word is kept so the collision stays visible.
Not this Lean 's three standard axioms are not this system's doctrine layer , and an axiom candidate in the software lattice is not a mathematical axiom.
Reader rule The surrounding subject determines which meaning is intended.
Other names, related terms and sources
Also shown as axiom candidate, pri_axiom
Search handles infinity stone, system axiom, primitive constraint
Source refs CLAUDE.md (adapter) doctrine module navigation_hologram_theory (paper_module) doctrine module system_constitution_seed (paper_module)
axiom · doctrine Generated from the governed public vocabulary for Plectis.
B
backend General or domain usage A backend is the processing, storage, and service layer behind a user-facing interface or another client .
Backends accept requests, apply business or domain logic, read and write data, call other services, and return results. Some systems have no visual frontend , and the boundary between frontend and backend depends on the architecture rather than on whether code is publicly visible.
Backend is a relational role. Browser code may be frontend to a person while acting as a client of remote APIs ; one service can consume another and provide results downstream. Backends may run on servers , local machines, embedded devices, or serverless platforms. Their correctness, security, privacy , availability, and performance require separate evidence . Source publication can make implementation inspectable, but an externally hosted backend may still depend on configuration , data, credentials , and infrastructure that readers cannot reproduce .
Example A service accepts a request from a webpage, queries stored records , and returns data that the frontend displays.
Scope Backend names a role behind a client interface ; it can describe public or private code and local or remotely hosted services.
Reader rule A backend claim should name the service boundary and behavior tested; being behind the interface does not make a component independently reproducible or more trustworthy.
Other names, related terms and sources
Also shown as back end
back_end · public projection Generated from the governed public vocabulary for Plectis.
band System-local specialization A band is a named level of detail in a description, such as a brief label, a short summary, or a full explanation.
one compression level packet
Meaning scope System-local specialization. Band means a level in the repository 's compression ladder, not a frequency band, musical group, statistical interval, or general taxonomy level.
Scope Bands appear wherever the site offers a thing at more than one depth: component and paper -module summaries that expand, doctrine cards, and the layered entries in the doctrine reference . The vocabulary comes from the compression profiles and the navigation design that the public pages are generated from.
Not this A band is not a paragraph length or a writing style, and it is not the whole record . It is one defined level of a depth ladder, with a contract for what that level must contain.
Reader rule A shorter band should reduce reading effort without changing the claim .
Other names, related terms and sources
Also shown as compression band, band schema
Search handles band ladder, russian doll band, definition band, telescope band, telescoping band, holographic tier
Source refs doctrine module navigation_hologram_theory (paper_module) standard std_system_term (standard)
band · navigation Generated from the governed public vocabulary for Plectis.
barrier General or domain usage A mathematical barrier is an obstruction showing why a specified approach cannot establish its intended result under stated conditions.
A barrier theorem proves a limitation of a method or construction. In these papers , such results help identify which attempted routes have failed and what a future approach would have to change.
A method failing does not show that the original problem is impossible. A barrier can be useful progress by preventing repetition and revealing which assumption caused the obstruction.
Example A proof that one proposed mechanism stays uniformly away from its target is a barrier to that mechanism ; it does not rule out other mechanisms .
Scope A barrier establishes that one route fails. It says nothing about routes it does not name.
Reader rule Check the hypotheses and the precise class of approaches ruled out.
Other names, related terms and sources
Also shown as obstruction
barrier · public projection Generated from the governed public vocabulary for Plectis.
base General or domain usage The base of a power is the number being raised to an exponent . In a positional numeral system, powers of the base also determine place values.
In 𝑏 𝑛 b n , b is the base and n is the exponent . Decimal notation uses powers of ten for place values, while binary uses powers of two. The mathematics papers also raise rational bases such as 3 / 2 3 / 2 to powers without assuming ordinary integer -base digit rules.
For an integer base 𝑏 > 1 b > 1 , the usual digits are 0 through 𝑏 − 1 b − 1 , and the places after the radix point have weights 1 / 𝑏 1 / b , 1 / 𝑏 2 1 / b 2 , and so on. More general positional expansions require their own digit conventions. In the irrationality papers , expressions involving a rational base can be studied as powers or series directly; conclusions about integer divisibility cannot be transferred without checking the assumptions .
Example In base two, 0 . 1 1 0.11 represents 1 / 2 + 1 / 4 1 / 2 + 1 / 4 ; at a rational base such as 3 / 2 3 / 2 , power-based series need the separate assumptions stated in the paper .
Scope Base covers the explicitly named numeral or exponential base in one series , expansion, or theorem .
Not this Base here does not mean a database , code superclass, or physical support .
Reader rule Check whether the passage concerns powers, positional digits, or both, and retain its stated restrictions on the base.
Other names, related terms and sources
Also shown as number base, rational base
Search handles integer base
base · public projection Generated from the governed public vocabulary for Plectis.
basis General or domain usage In linear algebra, a basis gives unique vector coordinates; in an argument, its basis is the assumptions or evidence supporting it.
A vector-space basis both spans the space and is linearly independent : every vector is a unique finite sum of basis vectors multiplied by scalars . One horizontal and one vertical unit vector form a basis for the ordinary plane.
Plectis uses “named basis ” for the stated sources or assumptions behind a claim . Naming those sources makes them inspectable; it does not by itself show that they support the conclusion.
Example The vectors ( 1 , 0 ) ( 1 , 0 ) and (0,1) form a basis of the plane.
The standard basis of the plane Two arrows of length one leave the origin: e1 along the horizontal axis to (1, 0) and e2 along the vertical axis to (0, 1). e1 e2 1 1 0 x y The standard basis of the plane. e 1 = (1, 0) and e 2 = (0, 1): one basis of the real plane among infinitely many.
Meaning scope General or domain usage. Covers both the linear-algebra sense and the ordinary evidential sense. In linear algebra, a basis is a linearly independent spanning family; in an argument, a basis is the assumptions or evidence on which it rests. named_basis is the separate Plectis artifact that records selected premises for a bounded task.
Scope Covers the vector-space meaning and distinguishes the evidential use of the same word.
Reader rule The scalars and vector space are part of the mathematical definition; evidence supporting an argument does not have to form a vector space .
Other names, related terms and sources
Also shown as rational basis, linear basis, linear bases, vector-space basis
basis · public projection Generated from the governed public vocabulary for Plectis.
benchmark General or domain usage A benchmark is a specified workload and measurement procedure used to compare performance against a baseline or other systems.
A benchmark couples a task with a metric , dataset , environment , and scoring rule. Its result describes performance under those conditions; it does not automatically rank systems for workloads the benchmark did not test.
Benchmarks measure properties such as speed, accuracy, reliability , resource use, or cost on a defined workload. Fair comparison fixes the relevant conditions or explicitly identifies what is being varied, including hardware, scoring, workloads, and treatment of failures. A single score can hide trade-offs, distribution shifts, or poor tail behaviour. Repeated optimization against a public test may also make the score less representative because systems adapt to its examples. In finance, benchmark can instead mean a reference index or rate; the shared idea is comparison with a declared standard , not a universal measure of quality.
Example A premise -retrieval benchmark can compare which relevant lemmas different search methods return for the same queries.
Scope A benchmark covers the declared tasks, data, metric , model or system version, and execution conditions.
Not this A single impressive demo or hand-picked example is not a benchmark.
Reader rule A comparison must identify the workload, scoring rule, environment , and any deliberately varied conditions; conclusions remain limited to what those choices represent.
Other names, related terms and sources
Also shown as evaluation benchmark, benchmark run
Search handles benchmark result
benchmark · public projection Generated from the governed public vocabulary for Plectis.
Bergman kernel General or domain usage The kernel that reproduces square-integrable holomorphic functions by integration over their domain.
For the unit disc with ordinary area measure, 𝐾 ( 𝑧 , 𝑤 ) = 1 / [ 𝜋 ( 1 − 𝑧 ⋅ ―― 𝑤 ) 2 ] K ( z , w ) = 1 / [ π ( 1 − z ⋅ w ― ) 2 ] . If f is holomorphic and square-integrable there, 𝑓 ( 𝑧 ) = ∫ 𝐾 ( 𝑧 , 𝑤 ) 𝑓 ( 𝑤 ) 𝑑 𝐴 ( 𝑤 ) f ( z ) = ∫ K ( z , w ) f ( w ) d A ( w ) . The kernel is holomorphic in z and antiholomorphic in w.
In #1041 the coefficient expansion of a Riemann map and Cauchy–Schwarz turn component area into a bound on the length of the image of a real interval. The positive disc kernel makes the resulting double integral explicitly computable.
Meaning scope General or domain usage. The paper uses the unweighted unit-disc Bergman kernel with ordinary area normalization; positivity of arbitrary off-diagonal values is not claimed .
Scope The normalization depends on the measure. Positive-definite kernel does not mean every kernel value is a positive real number . On the real diameter of the disc, this particular kernel is positive, which permits a special comparison.
Other names, related terms and sources
Also shown as Bergman reproducing kernel
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 719 (mathematical_source)
bergman_kernel · mathematical concept Generated from the governed public vocabulary for Plectis.
Bernstein basis General or domain usage The degree-n polynomial basis ( 𝑛 𝑘 ) 𝑡 𝑘 ( 1 − 𝑡 ) 𝑛 − 𝑘 ( n k ) t k ( 1 − t ) n − k for k from 0 to n.
Meaning scope General or domain usage. The positivity implication requires the Bernstein representation on the specified interval; ordinary power coefficients have no equivalent implication .
Scope Nonnegative coefficients are a sufficient positivity certificate , not a necessary condition in a fixed degree. Basis positivity holds on the stated interval; it cannot be used unchanged outside [ 0 , 1 ] [ 0 , 1 ] . Bernstein approximation polynomials are a related construction, not this basis itself.
Other names, related terms and sources
Also shown as Bernstein polynomial basis, Bernstein basis polynomials
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 421 (mathematical_source)
bernstein_basis · mathematical concept Generated from the governed public vocabulary for Plectis.
Bertrand postulate General or domain usage Bertrand’s postulate states that for every integer 𝑛 > 1 n > 1 there is a prime strictly between n and 2n.
It guarantees a prime in a fixed multiplicative interval, without identifying which prime . For instance, at 𝑛 = 3 n = 3 the prime 5 lies between 3 and 6.
The #68 finite -gcd argument needs a prime ℓ with 𝐷 / 2 < ℓ ≤ 𝐷 D / 2 < ℓ ≤ D . Bertrand supplies it for 𝐷 ≥ 3 D ≥ 3 after treating the integer endpoints ; 𝐷 = 2 D = 2 is handled directly. This interval ensures a unique largest factorial channel contributes the relevant prime valuation, ruling out a nontrivial common divisor .
Scope Endpoint conventions and the small cases matter when reformulating the theorem . It gives no claim that every short interval of an arbitrary fixed length contains a prime .
Other names, related terms and sources
Also shown as Bertrand's postulate, Bertrand’s postulate, Bertrand theorem
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::sec:finite-gcd (mathematical_source)
bertrand_postulate · mathematical concept Generated from the governed public vocabulary for Plectis.
big-o notation General or domain usage Big-O notation bounds the magnitude of one quantity by a fixed constant times another near a specified limit .
The expression 𝑛 + 7 n + 7 is 𝑂 ( 𝑛 ) O ( n ) as n grows because 𝑛 + 7 ≤ 8 𝑛 n + 7 ≤ 8 n for every 𝑛 ≥ 1 n ≥ 1 . The notation records an eventual constant-factor upper bound ; it does not claim that 𝑛 + 7 n + 7 is approximately equal to n.
Big-O lets the papers separate a main arithmetic contribution from controlled errors or bound the number of exceptional indices . It hides constants and a finite initial range, so it cannot by itself certify a numerical inequality at a particular input.
Meaning scope General or domain usage. Asymptotic analysis. It is an upper bound class, not approximate equality .
Scope The statement 𝑓 = 𝑂 ( 𝑔 ) f = O ( g ) near a specified limit means | 𝑓 | ≤ 𝐶 | 𝑔 | | f | ≤ C | g | there for some fixed C after a threshold . Any parameters on which C may depend must be stated, often by a subscript such as 𝑂 𝜀 O ε .
Other names, related terms and sources
Also shown as big O
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 110 (mathematical_source)
big_o_notation · mathematical concept Generated from the governed public vocabulary for Plectis.
biholomorphic map General or domain usage A bijective holomorphic map whose inverse is also holomorphic .
A biholomorphism gives complex domains the same analytic structure. Translation and nonzero complex scaling are examples. A local biholomorphism has such an inverse near each point; it can still identify distinct points globally.
The square-root coordinate in #1041 becomes a global biholomorphism only after properness and simple connectivity are established. Its inverse turns a segment in the coordinate domain into a root-connecting curve. Estimating that curve requires a separate bound on the inverse derivative , rather than topology alone.
Meaning scope General or domain usage. Global biholomorphism requires a bijective holomorphic map with holomorphic inverse; local biholomorphic behaviour is a strictly weaker condition.
Scope In one complex variable a holomorphic map with nonzero derivative is locally biholomorphic. A global conclusion also needs injectivity and the specified target. Biholomorphic maps preserve angles locally but generally change lengths and areas.
Other names, related terms and sources
Also shown as biholomorphic, biholomorphism, biholomorphic equivalence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::sec:separation (mathematical_source)
biholomorphic_map · mathematical concept Generated from the governed public vocabulary for Plectis.
bijection General or domain usage A bijection is a function that reaches every element of its codomain exactly once.
Equivalently, it is both injective and surjective : different inputs produce different outputs, and every element of the codomain is reached. The integer map 𝑛 ↦ 𝑛 + 1 n ↦ n + 1 is bijective, with inverse 𝑚 ↦ 𝑚 − 1 m ↦ m − 1 .
A bijection alone need not preserve distance , addition, or continuity. Statements requiring those properties must supply them separately; a conformal bijection in the geometry papers carries much more structure than an arbitrary pairing.
Other names, related terms and sources
Also shown as bijective, one-to-one correspondence
Source refs governed vocabulary term_registry (reading_context)
bijection · mathematical concept Generated from the governed public vocabulary for Plectis.
binary expansion General or domain usage A binary expansion writes a number with digits 0 and 1, using powers of two as place values.
For example, 0 . 1 0 1 0.101 in binary is 1 / 2 + 0 / 4 + 1 / 8 1 / 2 + 0 / 4 + 1 / 8 , or 5 / 8 5 / 8 . The digit positions turn questions about a real number into questions about a sequence of zeros and ones.
Numbers with a terminating expansion also have an alternative ending in repeating ones. Arguments about uniqueness or periodicity must account for this familiar ambiguity.
Example The binary totient series is studied through constraints that rationality would impose on its eventual binary digits.
Scope A binary expansion covers one number under the standard base-two representation convention.
Not this A decimal approximation printed with zeros and ones is not automatically a binary expansion.
Reader rule In base two, rational numbers have eventually repeating expansions.
Other names, related terms and sources
Also shown as binary digits, base-two expansion
Search handles base 2 expansion
binary_expansion · public projection Generated from the governed public vocabulary for Plectis.
binomial coefficient General or domain usage A binomial coefficient counts ways to choose a fixed number of elements from a finite set , without regard to order.
For integers 0 ≤ 𝑘 ≤ 𝑛 0 ≤ k ≤ n , “n choose k” is 𝑛 ! / [ 𝑘 ! ( 𝑛 − 𝑘 ) ! ] n ! / [ k ! ( n − k ) ! ] . For example, five elements have ten two-element subsets . Choosing none or choosing all gives one possibility.
The coefficients also appear in ( 1 + 𝑥 ) 𝑛 ( 1 + x ) n . In #1049, ordinary binomial coefficients occur in exponents of q-polynomials , while Gaussian binomial coefficients are a different polynomial analogue. Their value at 𝑞 = 1 q = 1 recovers the ordinary coefficient ; the two should not be identified at an arbitrary q.
Scope These formulas specify nonnegative integer parameters. Generalized binomial coefficients extend the notation to other parameters and need their own convention.
Other names, related terms and sources
Also shown as binomial coefficients, n choose k
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::sec:weights (mathematical_source)
binomial_coefficient · mathematical concept Generated from the governed public vocabulary for Plectis.
Boolean selector General or domain usage A Boolean selector is a sequence or function taking values 0 and 1 that records which objects are included.
Given terms 𝑎 1 , 𝑎 2 , … a 1 , a 2 , … , a selector 𝜀 𝑛 ε n forms the chosen subseries ∑ 𝜀 𝑛 𝑎 𝑛 ∑ ε n a n : 𝜀 𝑛 = 1 ε n = 1 keeps the nth term and 𝜀 𝑛 = 0 ε n = 0 omits it. The selector is the indicator function of the selected index set.
In the Mersenne -support paper , one binary selector determines the coefficient sequence and hence the support subseries . This makes combinatorial choices into arithmetic data that can be transformed by Möbius-type identities.
Example Given terms 𝑎 1 , 𝑎 2 , … a 1 , a 2 , … , a selector 𝜀 𝑛 ε n forms the chosen subseries ∑ 𝜀 𝑛 𝑎 𝑛 ∑ ε n a n : 𝜀 𝑛 = 1 ε n = 1 keeps the nth term and 𝜀 𝑛 = 0 ε n = 0 omits it.
Meaning scope General or domain usage. A selector records membership using zero and one. It does not make the selected set random, finite , or periodic .
Scope “Boolean” here means two-valued, not that logical operations are necessarily being performed. The selector encodes membership but does not by itself impose finiteness, randomness, periodicity , or independence on the chosen set.
Other names, related terms and sources
Also shown as binary selector, 0–1 selector
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 497 (mathematical_source)
boolean_selector · mathematical concept Generated from the governed public vocabulary for Plectis.
Borel–Cantelli lemma General or domain usage The Borel–Cantelli lemmas relate sums of event probabilities to whether infinitely many events occur.
Meaning scope General or domain usage. Both standard lemmas are covered with their separate assumptions . The first is an implication from summability ; its converse needs additional conditions and is not asserted for arbitrary dependent events.
Scope Do not infer the second conclusion from divergence alone. State the independence or other sufficient dependence condition used.
Other names, related terms and sources
Also shown as Borel-Cantelli lemma, Borel Cantelli lemma, Borel–Cantelli lemmas
Search handles Borel-Cantelli lemmas
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
borel_cantelli_lemma · mathematical concept Generated from the governed public vocabulary for Plectis.
bound General or domain usage A bound is a value that a quantity is proved to stay above or below under stated conditions.
An upper bound M gives 𝑥 ≤ 𝑀 x ≤ M ; a lower bound m gives 𝑚 ≤ 𝑥 m ≤ x . Bounds can also depend on a parameter, such as the number of terms in a sum .
In these papers , bounds often control the error left after a finite calculation , allowing a statement about an infinite process to follow from finite information.
Example If a nonnegative tail is at most 1 / 1 0 0 1 / 100 , then the partial sum approximates the full sum with error no larger than 1 / 1 0 0 1 / 100 .
Scope A bound covers the quantity and range it is proved for.
Reader rule A bound need not equal the quantity it controls or be the best possible bound.
Other names, related terms and sources
Also shown as bounds, bounded
Search handles unbounded
bound · public projection Generated from the governed public vocabulary for Plectis.
branch point General or domain usage A branch point is a location around which continuing a multivalued function can lead from one branch to another.
For the complex square root, continuing a chosen value around zero once changes its sign: starting with one square root returns to the other. No single continuous square-root choice works on the entire punctured plane.
Avoiding branch points lets the selected inverse of a polynomial continue as one injective holomorphic branch.
Meaning scope General or domain usage. Complex analysis and algebraic functions . Distinct from a branch in a proof tree or repository .
Scope This concerns continuation around the point, not merely a formula that is inconvenient to evaluate there.
Other names, related terms and sources
Also shown as algebraic branch point
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 510 (mathematical_source)
branch_point · mathematical concept Generated from the governed public vocabulary for Plectis.
bridge System-local specialization A bridge is Plectis's mechanism for sending a bounded task to an outside worker and returning its response.
single-call external worker lane
Meaning scope System-local specialization. Bridge means the repository 's bounded external-worker transport. It is not a physical bridge, a generic software bridge, or an autonomous controller.
Scope The term covers the external worker lane and its dispatch and response machinery. A reader meets it wherever the site describes work sent to separate workers, such as parallel reasoning, research runs, or bulk population, and in the runtime component that carries this work across phases .
Not this A bridge is not the system's conductor and not an autonomous agent that explores the codebase, runs many steps, or makes changes by itself. It is a one-packet -out, one-packet -back transport with all orchestration held outside it.
Reader rule The bridge itself does not grant the outside worker direct control of the local files.
Other names, related terms and sources
Also shown as bridge runtime, bridge dispatch, external worker
Search handles browser bridge
Related terms operates_under observe Bridge often powers observe/probe passes. controlled_by kernel Kernel and controller surfaces launch and read bridge work.
Source refs doctrine module bridge_runtime (paper_module) doctrine skill bridge_dispatch_authoring (skill)
bridge · runtime Generated from the governed public vocabulary for Plectis.
bundle General or domain usage A bundle is a group of related files packaged together for inspection or use.
Reader rule The bundle's inventory and source versions determine what it actually contains.
Other names, related terms and sources
Also shown as exported bundle
Search handles bundle set
bundle · public projection Generated from the governed public vocabulary for Plectis.
C
cache General or domain usage A cache stores a reusable copy of data or a computed result so later access can avoid repeated work.
Caches improve speed or reduce load by serving previously stored values. That benefit creates a freshness problem: the cached copy may no longer agree with its source after the source changes.
A cache keeps data closer to a consumer or preserves the result of an expensive computation. A cache hit reuses a matching entry ; a miss fetches or computes the value and may store it. Keys determine which requests count as equivalent, while capacity and eviction policies determine what remains available. Expiration limits age, and invalidation removes entries known to be stale. No single policy guarantees both perfect freshness and maximum reuse. Browsers , processors, applications, databases , and build systems all use caches, but their consistency requirements and failure consequences differ.
Scope A functioning cache has a key that identifies reusable work, a policy for admitting and removing entries , and an expiration, invalidation, or refresh path when source state changes.
Other names, related terms and sources
Also shown as caches, cached
Source refs sites/microcosm/docs/doctrine.html (reading_context) sites/microcosm/docs/reference.html (reading_context)
cache · public projection Generated from the governed public vocabulary for Plectis.
calibration General or domain usage Calibration compares measurements with a reference standard or compares stated forecast probabilities with observed event frequencies.
Instrument calibration characterizes or adjusts readings against a known standard . Forecast calibration asks whether events assigned similar probabilities occur at corresponding rates across a suitable collection of predictions.
Calibration has two common technical senses. A measuring instrument is calibrated by comparing its readings with reference values under controlled conditions, then estimating bias, uncertainty, or an adjustment. A probabilistic forecaster is calibrated when, among comparable events assigned probability p, approximately a proportion p occur over repeated cases. This is a group-frequency property, so one correct or incorrect forecast says little about calibration. A forecaster can be calibrated yet uninformative by always giving the base rate. Conversely, sharp predictions can be useful but miscalibrated if their stated probabilities systematically overstate or understate observed frequencies.
Scope Measurement calibration requires a traceable reference and stated conditions; probability calibration requires comparable forecast-event pairs and enough observations to assess frequency agreement at the claimed resolution.
Other names, related terms and sources
Also shown as calibrated, probability calibration
Source refs sites/microcosm/index.html (reading_context) sites/microcosm/docs/rules-and-ideas.html (reading_context)
calibration · public projection Generated from the governed public vocabulary for Plectis.
callback General or domain usage A callback is a function supplied to other code so that code can call it when a specified event or stage occurs.
Callbacks let a caller provide behaviour without controlling the whole operation. They are common in event handling, asynchronous work, validation , and library extension points.
The code receiving a callback chooses when to invoke it and what arguments to supply. A sorting function might call a supplied comparison function immediately; a browser might call a registered click handler much later. Callbacks can therefore be synchronous or asynchronous. Plectis evaluators use them for checks that vary between cases while a shared runner performs the common steps.
Example A validator runner calls an evaluate_negative_case callback for each negative fixture .
Meaning scope General or domain usage. A callback is supplied or registered for other code to invoke. It can run synchronously or asynchronously; registration does not imply a delay.
Scope Check who invokes the callback, when it may run, what arguments it receives, and how errors or repeated calls are handled.
Not this Calling a named helper directly, without passing or registering it for other code to invoke, is an ordinary function call rather than a callback arrangement.
Other names, related terms and sources
Also shown as callbacks, callback function
Source refs sites/microcosm/docs/paper-module-batch6-unsurfaced-primitives-capsule.html (reading_context)
callback · public projection Generated from the governed public vocabulary for Plectis.
canonicalisation Externally anchored Canonicalisation is the process of putting something into a standard , representative form.
In the mathematical research discussion here, it means consolidating a result into a natural statement and an understood proof that others can reuse. Equivalent formulations and routine supporting lemmas may become part of one clearer account.
This is a later question than whether a proof checks : it concerns which formulation and explanation become useful, recognised tools for other work.
Example A later paper that rebuilds a first formal proof around the natural statement and the shortest argument would be an attempt to assist canonicalisation; whether the community adopts that form is external.
Reader rule A repository can simplify its own presentation, but it cannot declare that the mathematical community has adopted it.
Other names, related terms and sources
Also shown as canonicalization
Search handles canonicalise, canonicalize
canonicalisation · public projection Generated from the governed public vocabulary for Plectis.
cardinality General or domain usage Cardinality measures how many elements a set has, extending finite counting to infinite sets through bijections .
The set { 2 , 4 , 6 } { 2 , 4 , 6 } has cardinality 3. Two sets have the same cardinality when their elements can be paired by a bijection . Consequently, the natural numbers and the even natural numbers have the same infinite cardinality via 𝑛 ↦ 2 𝑛 n ↦ 2 n .
A proper subset can have the same infinite cardinality as the containing set. Cardinality is therefore different from length, area, probability, or asymptotic density , each of which answers a different question about size.
Other names, related terms and sources
Also shown as set cardinality, cardinalities
Source refs governed vocabulary term_registry (reading_context)
cardinality · mathematical concept Generated from the governed public vocabulary for Plectis.
care System-local specialization Care means attending to the people, correctness, and future maintenance affected by a piece of work.
stake becomes upkeep
Plectis uses the word as a practical standard for an agent 's conduct. A change should be understandable, checked to the appropriate extent, and left in a state that another person can continue.
For example, preserving unrelated edits and updating an instruction made inaccurate by a change both reduce avoidable costs for the next person working on the system.
Example The Agent Completion Faithfulness Audit is care made concrete: it checks that a finished task left an accurate record of what was actually done, rather than a tidy claim the underlying files do not support . See it live: Agent Completion Faithfulness Audit open the audit that checks a finished task left an honest record
Meaning scope System-local specialization. Care is an operational judgment trait in the Type A register. The term does not claim emotion, consciousness, human virtue, or an external psychological classification.
Scope Care covers the maintenance-and-continuity dimension of how agents act on the system: protecting the next person or agent from re-deriving lost context, inheriting stale facts, or losing the original intent. A reader meets it across the agent reliability and continuity material, and in the audits that check whether a completed task left an honest, faithful record .
Not this Care is not sentiment, politeness, or a general value statement about doing good work. It is a specific obligation to leave upkeep behind: provenance , validation , and closeout records that the next agent can rely on.
Reader rule Care is expressed through decisions and follow-through, rather than through enthusiastic language.
Other names, related terms and sources
Also shown as system care, agent care
Search handles care directive, care register, care posture, care and passion
Related terms supports type_a_judgment Care is one trait supporting live controller judgment. operates_through common_sense Care becomes practical through situated judgment and cheap truthful surfaces. routes_to up_propagate Care-driven local lessons should move to the owning plane when reusable.
Source refs CODEX.md (adapter) CLAUDE.md (adapter) standard std_agent_entry_surface (standard)
care · judgment trait Generated from the governed public vocabulary for Plectis.
catalog System-local specialization A catalog is an organised inventory; on Plectis's architecture page it lists patterns available for use in the system.
Meaning scope System-local specialization. On the architecture page, catalog is the spine step after project: the governed collection of patterns the system can bind. It is not a bibliography and not the skill catalog.
Scope Spine catalog and the public pattern-catalog contract .
Not this The glossary itself is not the catalog, and neither is a bibliography of papers .
Reader rule This particular catalog is distinct from the site's collection of papers or skills .
Other names, related terms and sources
Also shown as pattern catalog
Search handles catalogue
catalog · public projection Generated from the governed public vocabulary for Plectis.
Cauchy determinant formula General or domain usage An exact product evaluation for a matrix with entries that are reciprocals of pairwise sums.
For 𝐶 𝑖 𝑗 = 1 / ( 𝑥 𝑖 + 𝑦 𝑗 ) C i j = 1 / ( x i + y j ) , its determinant is ∏ 𝑖 < 𝑗 ( 𝑥 𝑗 − 𝑥 𝑖 ) ( 𝑦 𝑗 − 𝑦 𝑖 ) ∏ 𝑖 , 𝑗 ( 𝑥 𝑖 + 𝑦 𝑗 ) ∏ i < j ( x j − x i ) ( y j − y i ) ∏ i , j ( x i + y j ) . The formula assumes that every denominator is nonzero. Distinct x-values and distinct y-values make the numerator nonzero.
The #1049 paper first evaluates the equal -weight geometric moment determinant exactly by this formula. That solved model helps isolate the additional effect of nonconstant moment weights in the later asymptotic theorem .
Meaning scope General or domain usage. The formula is for the stated Cauchy matrix with nonvanishing denominators ; it does not evaluate arbitrary matrices .
Scope The multiplicative version with entries 1 / ( 1 − 𝑥 𝑖 𝑦 𝑗 ) 1 / ( 1 − x i y j ) follows by a change of variables and has its own displayed factors . Keep signs, indexing and normalization consistent. This identity evaluates one structured determinant ; it is different from Cauchy–Binet .
Other names, related terms and sources
Also shown as Cauchy's determinant formula, Cauchy determinant identity
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 136 (mathematical_source)
cauchy_determinant_formula · mathematical concept Generated from the governed public vocabulary for Plectis.
Cauchy product General or domain usage The Cauchy product of two series groups products of terms by the sum of their indices .
Other names, related terms and sources
Also shown as Cauchy product of series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::eq:weight-generating-function (mathematical_source)
cauchy_product · mathematical concept Generated from the governed public vocabulary for Plectis.
Cauchy–Binet formula General or domain usage The Cauchy–Binet formula expresses the determinant of a rectangular matrix product as a sum of products of matching square minors .
Other names, related terms and sources
Also shown as Cauchy-Binet, Cauchy–Binet, Cauchy-Binet formula
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex (mathematical_source)
cauchy_binet_formula · mathematical concept Generated from the governed public vocabulary for Plectis.
cauchy–schwarz inequality General or domain usage The absolute inner product of two vectors is at most the product of their lengths.
For real lists 𝑎 1 , … , 𝑎 𝑛 a 1 , … , a n and 𝑏 1 , … , 𝑏 𝑛 b 1 , … , b n , Cauchy–Schwarz says | ∑ 𝑎 𝑖 𝑏 𝑖 | ≤ √ ∑ 𝑎 2 𝑖 √ ∑ 𝑏 2 𝑖 | ∑ a i b i | ≤ ∑ a i 2 ∑ b i 2 . For example, it bounds a mixed sum using two simpler square-sums, with equality only when the lists are proportional.
The lemniscate analysis uses Cauchy–Schwarz to convert energy control into a perimeter or path-length estimate. The inequality does not create smallness alone: one still needs useful bounds for both factors on its right-hand side.
Meaning scope General or domain usage. Linear algebra and analysis. Also called Schwarz or Cauchy–Bunyakovsky–Schwarz.
Scope Identify the vectors, functions , or sequences and the inner product before applying the inequality . Infinite -dimensional or integral versions also require the square-size quantities on the right to be finite .
Other names, related terms and sources
Also shown as Cauchy-Schwarz
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 654 (mathematical_source)
cauchy_schwarz_inequality · mathematical concept Generated from the governed public vocabulary for Plectis.
ceiling function General or domain usage The ceiling of a real number x is the smallest integer at least x, written ⌈x⌉.
For example, ⌈ 2 . 3 ⌉ = 3 ⌈ 2.3 ⌉ = 3 , ⌈ 2 ⌉ = 2 ⌈ 2 ⌉ = 2 , and ⌈ − 2 . 3 ⌉ = − 2 ⌈ − 2.3 ⌉ = − 2 . It rounds toward positive infinity, not toward the integer with greatest absolute value .
In the landing page’s #243 example, ceiling converts 𝑛 ⋅ 𝑎 2 𝑛 / ( 𝑛 + 3 ) n ⋅ a n 2 / ( n + 3 ) into an integer recurrence term with a one-sided error smaller than one. This rounding bound matters when checking the recurrence ’s asymptotic rate.
Scope It satisfies 𝑥 ≤ ⌈ 𝑥 ⌉ < 𝑥 + 1 x ≤ ⌈ x ⌉ < x + 1 . Ceiling differs from rounding to the nearest integer and from floor , which chooses the greatest integer at most x.
Other names, related terms and sources
Also shown as ceiling, ceil, rounding upward
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex (mathematical_source)
ceiling_function · mathematical concept Generated from the governed public vocabulary for Plectis.
certificate General or domain usage A certificate is data that a specified checker can use to verify a particular claim .
The data might provide a witness , a calculation trace, or the finite cases needed for a result. Producing the certificate and checking it can be separate tasks, with different costs and trust requirements.
A collection of verified cases establishes a general theorem only when a further argument shows that those cases cover everything the theorem asserts.
Example A certificate may be a finite witness checked by Lean , an exact rational calculation replayed by a dedicated verifier , or another compact data object whose checker establishes the stated claim under declared assumptions .
Reader rule The guarantee depends on what the checker verifies and how that check connects to the claim .
Other names, related terms and sources
Also shown as finite certificate
Search handles finite certificates
certificate · public projection Generated from the governed public vocabulary for Plectis.
Challenge/Solution pair System-coined term A Challenge/Solution pair packages a precise Lean problem with a proposed solution that can be checked against it.
The challenge states the required result and allowed assumptions . The solution supplies the implementation or proof intended to meet that requirement. Plectis uses the pair as an independently inspectable unit in its Comparator and Palomar material.
Checking one pair establishes that result within its stated setting. It does not automatically settle neighbouring statements or the original open problem from which the challenge was derived.
Example The coding-agents page tells a coding agent that each entry is a Challenge/Solution pair. See it live: With a coding agent Challenge/Solution pair instruction
Reader rule The solution must satisfy the actual challenge, including its hypotheses and restrictions.
Other names, related terms and sources
Also shown as challenge solution pair, challenge/solution
challenge_solution_pair · public projection Generated from the governed public vocabulary for Plectis.
changelog General or domain usage A changelog is a reader -facing record of notable changes between versions.
It helps users understand additions, fixes, removals, compatibility breaks, and migration needs without reconstructing history from every commit . A changelog selects and explains relevant changes, while Git history records a finer-grained ancestry of snapshots .
A changelog is curated communication for users, organized around named versions or dates. It selects additions, fixes, removals, compatibility breaks, security notes, and migration requirements that matter outside the development process. Git history serves a different purpose: commits preserve repository trees and ancestry at finer granularity, often with messages unsuitable as release documentation. A useful changelog links claims to versions, distinguishes planned from shipped behavior, and states omissions. It should not be read as exhaustive evidence that every internal alteration, dependency update, or deployment event was recorded.
Example A release note saying that glossary coverage increased is a changelog entry .
Scope The term covers the public, reader -oriented history of significant updates.
Not this A current feature list with no dates or change relationships is not a changelog.
Reader rule A changelog should name versions and dates and should not imply that omitted internal changes never occurred.
Other names, related terms and sources
Also shown as change log, change history, release notes
changelog · public projection Generated from the governed public vocabulary for Plectis.
Chebotarev density theorem General or domain usage The Chebotarev density theorem says that primes with any prescribed Frobenius conjugacy class occur with a predictable positive density in a finite Galois extension .
Meaning scope General or domain usage. The finite Galois form describes unramified primes through conjugacy classes. Quantitative error bounds require an effective version.
Scope The standard theorem excludes ramified primes and prescribes a conjugacy class , not necessarily one distinguished group element. An effective version adds quantitative error bounds ; the paper explicitly uses only the qualitative finite -Galois form.
Other names, related terms and sources
Also shown as Chebotarev theorem
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 580 (mathematical_source)
chebotarev_density_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
Chebyshev polynomial General or domain usage A polynomial family whose first-kind members satisfy 𝑇 𝑛 ( c o s 𝜃 ) = c o s ( 𝑛 𝜃 ) T n ( cos θ ) = cos ( n θ ) .
The first members are 𝑇 0 = 1 T 0 = 1 , 𝑇 1 = 𝑥 T 1 = x and 𝑇 2 = 2 𝑥 2 − 1 T 2 = 2 x 2 − 1 . For 𝑛 ≥ 1 n ≥ 1 , 𝑇 𝑛 T n has leading coefficient 2 𝑛 − 1 2 n − 1 and alternates between − 1 − 1 and 1 at 𝑛 + 1 n + 1 points of [ − 1 , 1 ] [ − 1 , 1 ] . This oscillation gives its extremal approximation property.
In #1041 the appropriately scaled first-kind zeros attain the sharp bound for an adjacent root segment when all roots are collinear. Alternation supplies both the comparison and the equality case, connecting a geometric root problem with uniform polynomial approximation.
Meaning scope General or domain usage. This row leads with first-kind Chebyshev polynomials; monic scaling and other kinds must be identified explicitly.
Scope For 𝑛 ≥ 1 n ≥ 1 the monic comparison polynomial is 2 1 − 𝑛 𝑇 𝑛 2 1 − n T n ; for 𝑛 = 0 n = 0 it is 𝑇 0 = 1 T 0 = 1 . Different Chebyshev families use different normalizations; the first-kind convention is the one used for the collinear-root argument.
Other names, related terms and sources
Also shown as Chebyshev polynomials, Chebyshev polynomial of the first kind
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 842 (mathematical_source)
chebyshev_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
check General or domain usage A check is an examination of whether something satisfies a stated condition.
On this site, a check usually has a runnable command, specified inputs, and a recorded result. It may test a behaviour, validate a file, compare copies, or verify a proof .
Useful checks can distinguish relevant failures from success. Reading a recorded result tells you about that run; repeating the command supplies evidence about your own copy and environment .
Example Each of the public components ships one check, its command written out in full.
Scope A check establishes its own outcome on its own inputs, and nothing wider.
Reader rule The result should say what was examined and which condition passed or failed.
Other names, related terms and sources
Also shown as checks, checked
check · public projection Generated from the governed public vocabulary for Plectis.
check result System-local specialization A check result records the outcome and evidence from a named software check .
source-linked check result
Meaning scope System-local specialization. The governed internal row retains the software verification -record meaning. Public text also explains the ordinary mathematical existential witness, which is an object with a proved property rather than a synonym for a log.
Scope Mathematical witnesses and software check records support different kinds of claim .
Not this A log reporting success is not by itself a proof of a mathematical existence statement or of the whole system's correctness.
Reader rule Interpret a check result within its recorded method and scope . In mathematics , witness has a different meaning: an object satisfying an existence claim .
Other names, related terms and sources
Also shown as verification record, witness
Search handles public witness, proof witness, witness route, witness surface
Source refs core/axiom_organ_routing.json (source_routing) tool build_microcosm_public_site (public_projection_builder) standard std_operator_action_receipt (standard)
witness · evidence Generated from the governed public vocabulary for Plectis.
checker General or domain usage A checker is a program or procedure that evaluates an input against specified rules.
A syntax checker, link checker, and proof checker each answer a different question. Their outputs are useful when the rules, inputs, and failure conditions are clear enough to inspect .
The rules may still omit something important to the wider task. Plectis therefore connects checker results to specific claims rather than treating every pass as general approval.
Example The internal-link checker rejects a page whose href points to no generated target.
Scope The term covers automated and procedural validation tools shown in the site's evidence chain.
Not this A human opinion without a stated evaluation rule is not an automated checker result.
Reader rule A pass establishes satisfaction of the implemented rules, subject to the checker's own correctness.
Other names, related terms and sources
Also shown as checkers, automated checker, verifier, verifiers
checker · public projection Generated from the governed public vocabulary for Plectis.
Chinese remainder theorem General or domain usage The Chinese remainder theorem solves simultaneous congruences with pairwise coprime positive moduli.
It says that any prescribed remainders occur together in exactly one class modulo the product of the moduli. For example, 𝑥 ≡ 1 x ≡ 1 modulo 2 and 𝑥 ≡ 2 x ≡ 2 modulo 3 combine to 𝑥 ≡ 5 x ≡ 5 modulo 6.
The papers use the theorem to arrange several divisibility conditions at once. It gives a controlled arithmetic construction rather than merely evidence that a computer found one suitable integer .
Scope Without coprimality , the prescribed remainders must satisfy compatibility conditions.
Other names, related terms and sources
Also shown as CRT, Chinese remainder
Source refs sites/microcosm/maths/problems/erdos_243.html::line 116 (mathematical_source)
chinese_remainder_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
circuit-break General or domain usage To circuit-break a process is to interrupt a loop that would otherwise keep running or reinforcing itself.
In Plectis's research discussion, the loop is self-confirmation: the same people or tools produce work and judge its value. An outside reader can interrupt that loop by questioning the evidence , interpretation, or direction.
Automated checks remain useful for errors they can detect. Independent judgement addresses questions of meaning and value that repeating the internal checks may never raise.
Example A mathematician reading one problem page and saying the main lemma is a known result would circuit-break the author's self-assessment.
Scope Names the interruption of a self-feeding process. It does not name the content of the resulting judgement.
Not this Prompting a model to praise the repository is not a circuit-break; it continues the same loop.
Reader rule An interruption prompts reassessment; it does not itself decide which conclusion is true.
Other names, related terms and sources
Also shown as circuit break, circuit breaker
Search handles circuit-breaks
circuit_break · public projection Generated from the governed public vocabulary for Plectis.
claim General or domain usage A claim is an assertion that can be examined for truth or support .
Plectis records what a component or mathematical result is said to establish and links that wording to evidence . This makes it possible to compare the public explanation with the source , proof , or recorded test.
For example, a successful test on specified inputs supports that tested behaviour. A claim covering every possible input requires a different argument or a suitable proof .
Example A component states one claim and includes one check ; the release gate refuses wording that reaches past what the check ran.
Scope A claim establishes nothing by itself. Its evidence does, and only as far as the evidence reaches.
Reader rule The strength of the wording should match the strength and scope of the evidence .
Other names, related terms and sources
Also shown as claims, claimed
claim · public projection Generated from the governed public vocabulary for Plectis.
claim registry System-local specialization A claim registry is a structured list of assertions and the evidence , scope , and status attached to each.
Meaning scope System-local specialization. Here, the claim registry is the reviewed map from public mathematical claims to their status, formal support , and open boundary; it is not an inventory of every Lean declaration .
Scope The registry covers the claims recorded in it, not everything the corpus contains.
Reader rule Registration records how a claim is presented and supported; it is not peer review .
Other names, related terms and sources
Also shown as claims ledger
Source refs tool measure_lean_corpus (source_authority)
claim_registry · public projection Generated from the governed public vocabulary for Plectis.
classical logic General or domain usage Classical logic allows excluded middle and principles such as eliminating a double negation.
Meaning scope General or domain usage. The standard logical meaning is intended. A historically classical theorem and a proof using classical logic are different descriptions, and neither is a ranking of mathematical quality.
Scope A classical proof can establish existence without yielding an executable procedure for the object. Its accepted logical assumptions should remain explicit.
Other names, related terms and sources
Also shown as classical reasoning, classical proof
classical_logic · mathematical concept Generated from the governed public vocabulary for Plectis.
clearing denominators General or domain usage Clearing denominators multiplies an equation or expression by a suitable nonzero common denominator to remove its fractions .
Other names, related terms and sources
Also shown as clear denominators, denominator clearing
Source refs sites/microcosm/maths/problems/erdos_243.html::line 108 (mathematical_source)
denominator_clearing · mathematical concept Generated from the governed public vocabulary for Plectis.
client General or domain usage A client is a program or device that requests data or a service from a server .
Meaning scope General or domain usage. A program or component acting as the requester of another service, rather than any program running independently.
Scope Identify the service and protocol when calling something a client; the label alone does not state its permissions or trust.
Not this A standalone program doing local arithmetic is not acting as a client unless it requests another service.
Other names, related terms and sources
Also shown as clients, software client, API client
Source refs sites/microcosm/docs/paper-module-formal-math-verifier-trace-repair-loop.html (reading_context)
client · public projection Generated from the governed public vocabulary for Plectis.
clone General or domain usage To clone a repository is to create a local copy of its files and Git history, with options to limit what is downloaded.
A normal full clone lets you inspect earlier revisions and work on the project locally. A shallow clone downloads limited history; other options can defer file contents or restrict the working checkout.
A clone records a particular state. To compare your results with a published example, use the stated revision and environment rather than assuming that every copy contains the same files.
Example The quickstart begins by cloning the repository , then runs the first check against it.
Scope A clone reflects the repository at the moment it was copied.
Reader rule The public repositories linked here can be cloned for local inspection and checks .
Other names, related terms and sources
Also shown as clones, cloned
Search handles cloning
clone · public projection Generated from the governed public vocabulary for Plectis.
closed route System-local specialization A closed route is a recorded approach that has been ruled out within a stated set of assumptions or methods.
The working records keep the reason for closure, such as a counterexample or a proved obstruction . This lets later researchers understand the failure before trying a similar idea.
A materially different method or hypothesis may avoid the obstruction . The record should make clear what would have to change, and whether the closure rests on proof , exact calculation, or weaker evidence .
Example For #249, the positive rank-one Möbius–Mersenne mechanism is a closed route: its cone sits a uniform gap above the target value.
Meaning scope System-local specialization. A closed route is a fact about one method. It says nothing about whether the problem is true or false.
Scope Covers failed approaches recorded in the papers and working records .
Not this An approach abandoned for lack of time is not a closed route, because nothing was shown.
Reader rule Closure applies to the described approach, not automatically to the original problem.
Other names, related terms and sources
Also shown as failed approach
Search handles failed routes, failed approaches, failed mechanism, failed mechanisms, dead end, dead ends
closed_route · public projection Generated from the governed public vocabulary for Plectis.
closed set General or domain usage A set containing all of its limit points; equivalently, its complement is open.
Scope Closed does not mean bounded : the entire real line is closed. A set can be both open and closed, depending on the surrounding space.
Other names, related terms and sources
Also shown as closed subset, closed region
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 956 (mathematical_source)
closed_set · mathematical concept Generated from the governed public vocabulary for Plectis.
closeout System-local specialization A closeout is the final record of a unit of work: what changed, what was checked , and what remains unresolved.
It gives the next person enough information to continue without reconstructing the session. Plectis expects the record to distinguish completed work, deliberate scope limits , and unfinished obligations .
A useful closeout also explains any condition that should trigger another pass. That makes a bounded stopping point understandable without implying that every related problem has been solved.
Example A closeout that reports a landed commit , a clean owned slice , and a list of paths left to their own owner is complete; one that reports only the commit is not.
Meaning scope System-local specialization. Closeout is the recorded landing of one bounded unit of work (change, validation , residue, deliberate omissions, and handoff), not merely the final chat message or the fact that editing stopped.
Scope A closeout describes one unit of work. It makes no claim about the surrounding system.
Reader rule Claims of completion should point to the resulting files or execution evidence .
Other names, related terms and sources
Also shown as close-out, closeouts
Source refs standard std_phase_closeout (source_authority) organs/agent_closeout_faithfulness_audit.md (source_authority)
closeout · public projection Generated from the governed public vocabulary for Plectis.
closure of a set General or domain usage The smallest closed set containing a given set.
The closure of the open interval (0,1) is [ 0 , 1 ] [ 0 , 1 ] : it adds the two boundary points approachable by sequences from inside. Points already in the set remain.
Density and lower-semicontinuity arguments prove results first on generic polynomial configurations , then extend them to the closure containing limiting nongeneric cases.
Scope A point lies in the closure exactly when every neighbourhood of it meets the original set. Closure is not the same as solving or completing an argument.
Other names, related terms and sources
Also shown as topological closure, set closure
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 1164 (mathematical_source)
topological_closure · mathematical concept Generated from the governed public vocabulary for Plectis.
coarea formula General or domain usage The coarea formula rewrites an integral over a region as integrals over level sets of a function , with a gradient factor accounting for how the levels are spaced.
For a height function on a rectangle, integrating a quantity over the rectangle can be done by integrating along each horizontal slice and then over height. In curved settings , | ∇ 𝑢 | | ∇ u | supplies the needed Jacobian.
The paper uses coarea to integrate geometric information over polynomial level curves . Combined with winding or the argument principle , it translates two-dimensional analytic energy into one-dimensional boundary-length information.
Example For a height function on a rectangle, integrating a quantity over the rectangle can be done by integrating along each horizontal slice and then over height.
Meaning scope General or domain usage. The formula uses the appropriate Jacobian and measures for the dimensions involved. It does not by itself supply a bound on either side.
Scope Precise hypotheses depend on dimension and regularity, commonly a Lipschitz map and measurable integrand. Critical levels may require measure-theoretic treatment. The formula is an identity, not automatically an inequality or a bound .
Other names, related terms and sources
Also shown as coarea theorem
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 523 (mathematical_source)
coarea_formula · mathematical concept Generated from the governed public vocabulary for Plectis.
Code Map System-coined term Code Map is a generated view of the code's parts and their dependencies .
It helps readers see which modules belong together and which other modules they use. Plectis derives this view from source information so the diagram can be refreshed when the implementation changes.
The map reflects the relationships its analysis captures. Dynamic behaviour or indirect connections may require further inspection , and the view can become stale if it has not been rebuilt.
Example The Why section says Code Map works out its clusters from real dependencies .
Meaning scope System-coined term. Code Map is the derived dependency view of this system's code clusters. It is not an ordinary street map , and not the glossary term map .
Scope Landing walkthrough of the unpublished operator interface .
Not this Code Map is not the public architecture -map HTML page , and not a geographic map .
Reader rule Open the linked source when a dependency matters to a proposed change.
Other names, related terms and sources
Also shown as code_map
code_map · public projection Generated from the governed public vocabulary for Plectis.
coding agent General or domain usage A coding agent is an AI agent equipped to work with source files and development tools.
Scope A coding agent establishes what it actually ran on a machine. It does not establish anything it only read.
Not this A chat assistant that quotes this website has not acted as a coding agent.
Reader rule Its report should distinguish actions it performed from actions it merely recommends.
Other names, related terms and sources
Also shown as coding agents
coding_agent · public projection Generated from the governed public vocabulary for Plectis.
codomain General or domain usage The codomain is the set in which a function 's outputs are declared to lie.
A function from integers to integers given by 𝑓 ( 𝑛 ) = 𝑛 2 f ( n ) = n 2 has the integers as its codomain, although it never produces a negative integer . Its image is the smaller set of outputs it actually attains.
Keeping this distinction explicit prevents “every output” from changing meaning halfway through an argument. Restricting the codomain to the image makes a function surjective onto that smaller set, but says nothing new about which values its formula produces.
Other names, related terms and sources
Also shown as target set of a function
Source refs governed vocabulary term_registry (reading_context)
codomain · mathematical concept Generated from the governed public vocabulary for Plectis.
coefficient General or domain usage A number multiplying a variable , power, basis element, or series term.
In 3 𝑧 2 − 7 𝑧 + 4 3 z 2 − 7 z + 4 , the coefficients are 3, -7, and 4. A missing power has coefficient zero: the coefficient of 𝑧 3 z 3 in this example is 0.
Plectis uses coefficients both to describe polynomial families and to weight infinite series , so the surrounding formula determines which meaning applies.
Other names, related terms and sources
Also shown as coefficients, polynomial coefficient
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 245 (mathematical_source)
coefficient · mathematical concept Generated from the governed public vocabulary for Plectis.
coefficient sequence General or domain usage A coefficient sequence is the indexed list of coefficients in a series or expansion, including any zero coefficients .
In ∑ 𝑐 𝑛 𝑥 𝑛 ∑ c n x n , the list 𝑐 0 , 𝑐 1 , … c 0 , c 1 , … is the coefficient sequence. Zeros matter because they mark missing powers or omitted series terms; the support is the set of indices where 𝑐 𝑛 c n is nonzero.
The Mersenne paper obtains its coefficient sequence by a divisor transform of a Boolean selector . That sequence then determines the support and arithmetic behavior of the associated series .
Example In ∑ 𝑐 𝑛 𝑥 𝑛 ∑ c n x n , the list 𝑐 0 , 𝑐 1 , … c 0 , c 1 , … is the coefficient sequence.
Meaning scope General or domain usage. A coefficient sequence belongs to a specified expansion. It is distinct from the function or number that expansion may represent.
Scope The surrounding expansion determines what the coefficients belong to. A coefficient sequence can be finite or infinite and need not converge by itself. It is data, distinct from the value of the resulting series .
Other names, related terms and sources
Also shown as sequence of coefficients
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 110 (mathematical_source)
coefficient_sequence · mathematical concept Generated from the governed public vocabulary for Plectis.
coercion General or domain usage A type coercion is a designated conversion inserted to use a value where another type is expected.
Meaning scope General or domain usage. The programming-language conversion sense is intended. Lean inserts registered coercions during elaboration ; it does not silently identify all numerically related types.
Scope Inspect the conversion when types matter. A coercion is a function or mechanism with defined behaviour, not an assertion that two types are identical or every conversion loses no information.
Other names, related terms and sources
Also shown as type coercion, type coercions, implicit conversion
coercion · proof infrastructure Generated from the governed public vocabulary for Plectis.
cofinal General or domain usage A subset of an ordered set is cofinal if it reaches at least as far as every element of that set.
Scope Cofinal is about indices going to infinity, not about density or frequency.
Reader rule Cofinality does not mean that every sufficiently large index qualifies.
Other names, related terms and sources
Also shown as cofinality
cofinal · public projection Generated from the governed public vocabulary for Plectis.
cold agent System-coined term A cold agent starts a task without the earlier conversation or session context.
unprimed capable agent
It must recover the task's meaning and current state from available files, instructions, and navigation routes. Plectis uses this situation to judge whether knowledge has been preserved well enough for work to continue.
A source link, clear status, and recorded next step can let a new agent resume correctly. A conclusion kept only in a previous conversation cannot do that.
Example The "With a coding agent " page is a concrete instance: it walks a coding agent that has just been pointed at the system through its first moves, assuming no earlier context, which is exactly the cold-agent situation. See it live: With a coding agent see the first moves a fresh agent is walked through
Meaning scope System-coined term. A cold agent is a capable agent with no prior-session memory that must orient from durable artifacts ; cold describes context, not intelligence , experience, or tool access.
Scope The term covers the kind of agent the documentation, standards , and entry surfaces are written for: one with no prior-session memory. A reader meets it across the entry and orientation pages, the coding-agent guide, and the Cold-Reader Route Map , wherever the system explains how a fresh agent is meant to find its way in.
Not this A cold agent is not a less capable or restricted agent , and not a person new to the team. It is a fully capable agent that simply begins with no session memory and must orient from the written artifacts rather than from remembered context.
Reader rule “Cold” describes missing context, not a lack of reasoning ability.
Other names, related terms and sources
Also shown as cold reader, cold session
Search handles fresh agent, cold boot, fresh capable agent
Source refs doctrine module navigation_hologram_theory (paper_module) doctrine skill navigation_seed (skill) CLAUDE.md (adapter)
cold_agent · actor Generated from the governed public vocabulary for Plectis.
cold clone System-local specialization A cold clone is a fresh repository checkout used to test whether someone new can follow the published instructions.
The test starts without the author's local caches , private files, or unrecorded setup. It checks whether the stated dependencies and commands are enough to reproduce the advertised example.
A successful cold-clone run supports portability to that tested environment . It does not promise identical behaviour on every operating system, dependency version, or machine.
Example The cold-clone probe runs on a fresh clone of a tagged release and writes its result to .microcosm/cold_clone_probe.json .
Meaning scope System-local specialization. A cold clone is a clean checkout used to test the published repository without the author’s caches or local configuration ; it is not just any Git clone or a proof of all-environment correctness.
Scope A cold-clone probe establishes only how the named revision, environment , and commands behaved in that run. It does not prove every supported environment or the correctness of the release as a whole.
Reader rule Any additional setup must be stated for the test to be meaningful.
Other names, related terms and sources
Also shown as cold-clone probe
Source refs src/microcosm_core/cold_clone_probe.py (source_authority) standards/std_microcosm_cold_clone_probe.json (source_authority)
cold_clone · public projection Generated from the governed public vocabulary for Plectis.
collaboration General or domain usage Collaboration is people working together on a shared task or result.
Meaning scope General or domain usage. Here collaboration includes people coordinating on proofs , corrections, explanations, implementations , reviews, or other shared results, with contribution credit preserved where the work is published. It does not by itself imply co-authorship, employment, or joint repository ownership.
Scope Landing invitation to contribute with credit .
Not this Independent mention without coordination or contribution is not collaboration merely because it concerns the same project. A talk can be collaborative when its preparation, correction, exposition , or resulting feedback forms part of shared work.
Reader rule Attribution should identify the people responsible for the work and describe tool assistance accurately.
Other names, related terms and sources
Also shown as collaborate, collaborating
collaboration · public projection Generated from the governed public vocabulary for Plectis.
combinatorics General or domain usage Combinatorics studies how discrete objects can be selected, arranged, counted, and related.
Typical questions concern subsets , permutations, graphs , and patterns that must occur in sufficiently large collections. Some problems ask for an exact count; others ask whether a configuration exists at all.
In the papers here, combinatorial structure can turn a broad number-theory question into a finite collection of cases or expose patterns that an arithmetic argument must address.
Example A graph -colouring problem is combinatorial because it studies discrete assignments under adjacency constraints.
Scope Combinatorics covers the discrete objects, constraints, and counting or existence questions in the stated problem.
Not this A purely numerical calculation is not combinatorics unless it represents a discrete structural question.
Reader rule The objects and allowed arrangements must be specified before a counting argument applies.
Other names, related terms and sources
Also shown as combinatorial mathematics
Search handles combinatorial
combinatorics · subject Generated from the governed public vocabulary for Plectis.
command shell General or domain usage A command shell interprets commands and coordinates the programs , files, and data streams they act on.
For example, a shell can run a test program , pass its output to another program , and save errors in a file. Bash and Zsh are shells. The terminal displays the interaction; the shell parses the command language and carries out its instructions.
The website’s runnable instructions depend on the stated shell and working directory. A shell also runs scripts without an interactive terminal , and some commands are built into the shell rather than separate programs . Reproducing an instruction requires preserving its arguments and relevant environment , not merely copying the visible program name. A successful shell invocation establishes only the outcome reported by the invoked operation.
Scope Quoting, variable expansion, and redirection are shell operations that can change which arguments a program receives and where its output goes.
Other names, related terms and sources
Also shown as command-line shell, Unix shell
Source refs governed vocabulary term_registry (reading_context)
command_shell · public projection Generated from the governed public vocabulary for Plectis.
command-line interface General or domain usage A command-line interface lets someone control software through textual commands, usually with arguments and options.
A command such as a tool name followed by --help uses a command-line interface. Arguments identify inputs or subcommands, while options modify behaviour. The interface can be used interactively or called from a script, which makes repeated operations easier to reproduce .
The system exposes checks and builders through command-line interfaces so a reader can repeat a named operation and inspect its output. Commands can also be invoked directly by another program without a shell. Exit codes , standard output, and standard error are common ways to report results. A graphical interface may offer the same underlying operation with buttons and forms instead of typed commands.
Scope The interface describes how instructions are supplied; the shell and terminal are separate programs that may help supply and display them.
Other names, related terms and sources
Also shown as command line interface, CLI
Source refs governed vocabulary term_registry (reading_context)
command_line_interface · public projection Generated from the governed public vocabulary for Plectis.
commit General or domain usage A Git commit records a complete repository -tree snapshot , parent link or links, and identifying metadata .
A commit names one state in Git history. It points to the full tree, links to its parent commit or commits, and records metadata such as author, time, and message; a diff is computed by comparing commits.
Git stores a commit as an object that refers to one complete tree, zero or more parent commits, and metadata including author, committer, timestamps, and message. Its identifier therefore depends on both the recorded content and its history links. An ordinary commit usually has one parent; a merge commit can have several. The perceived change is not stored as an intrinsic patch: Git calculates a diff against a chosen parent or other revision. A commit neither includes unstaged work nor implies that anyone reviewed, tested, released, deployed , or approved the snapshot .
Example A deploy receipt cites the commit it published, so the live site can be traced to exact source .
Scope A commit establishes what changed and when. It says nothing about whether the change was right.
Reader rule The commit object binds content, ancestry, and metadata ; it excludes uncommitted working-tree changes and does not itself encode a unique change when it has multiple possible comparison bases.
Other names, related terms and sources
Also shown as commits, committed
commit · public projection Generated from the governed public vocabulary for Plectis.
common sense System-local specialization In Plectis, common sense means choosing a proportionate action using the task, available evidence , and relevant constraints.
situated repair judgment
It applies when no instruction spells out every detail. An agent should infer routine next steps, inspect what already exists, and choose an action that advances the user's aim without silently widening it.
For example, updating a link broken by one's own change is ordinary follow-through; starting an unrelated redesign requires a different justification.
Example The area page on agent reliability and safety is a concrete home for this term: it gathers the components that govern how an agent infers a correct, source -backed action and records what it learned, which is common sense in operation. See it live: Area: agent reliability & safety see where situated agent judgment lives on the site
Meaning scope System-local specialization. Common sense is a local instruction to exercise bounded judgment and propagate reusable lessons; it is not claimed as a universal faculty or scientific construct.
Scope Common sense covers how agents move from the system's explicit governance to a correct action on a particular task, and how they feed reusable lessons back into shared surfaces. A reader meets it across the agent reliability and continuity areas of the site, wherever judgment, repair, and lesson propagation are described.
Not this Common sense is not ungoverned instinct, intuition, or a licence to improvise outside the rules. It is judgment bound to the system's axioms , standards , and live state, and incomplete until any reusable lesson is propagated back.
Reader rule Judgement remains accountable to evidence , permissions , and the consequences of being wrong.
Other names, related terms and sources
Also shown as commonsense, agent common sense
Search handles type a common sense, common-sense up propagation, common sense up propagates
Source refs doctrine skill local_to_general_propagation (skill) doctrine module agent_entry_surfaces (paper_module) CODEX.md (adapter)
common_sense · judgment trait Generated from the governed public vocabulary for Plectis.
compact General or domain usage Compact means concise in the software descriptions, while mathematical compactness requires every open cover to have a finite subcover .
Scope This entry distinguishes concise presentation from topological compactness ; the compactness entry gives the mathematical definition in more detail.
Not this Truncated text that removes the qualification from a claim is not a faithful compact view.
Reader rule In Euclidean space, compact sets are exactly the closed and bounded sets; other spaces require their own compactness test.
Other names, related terms and sources
Also shown as compacts, compacted, compacting, compact view
compact · public projection Generated from the governed public vocabulary for Plectis.
compactness General or domain usage A space is compact if every collection of open sets covering it has a finite subcollection that still covers it.
Scope These equivalent tests require their stated setting; boundedness alone is not enough in general.
Other names, related terms and sources
Also shown as compactness argument, compact set
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 1064 (mathematical_source)
compactness · mathematical concept Generated from the governed public vocabulary for Plectis.
Comparator General or domain usage Comparator is a Lean tool for checking a submitted solution against a separately specified challenge.
Keeping the challenge separate helps detect a submission that proves a different or weakened statement. The challenge and checking configuration determine the requirements, including any restrictions on assumptions .
Plectis uses this separation to support external inspection of formal results. A successful comparison concerns the specified challenge; it does not establish the importance of the result or its agreement with an informal claim .
Example A run reports both exit codes , the pinned tool revisions, and the hashes of the built binaries .
Scope Comparator is maintained by the leanprover organisation and is external to this work.
Reader rule Read the checked pair and configuration to see exactly what was accepted.
Sources
comparator · public projection Generated from the governed public vocabulary for Plectis.
compatibility route System-coined term A compatibility route keeps an old address or identifier usable after an item has moved or been renamed.
old path support
It may be a redirect, alias, or explanatory page leading to the current location. Plectis keeps such routes so existing citations and bookmarks can still reach the intended material.
A migration record can state the old route, new route, and expected behaviour. This makes it possible to test the transition instead of relying on readers to discover the move themselves.
Example The old Microcosm site root is a compatibility route: it shows a tombstone and forwards visitors to the current Plectis site rather than serving the former content as if it were still live. See it live: Cold Reader Route Map open the component that maps readers from any entry point to the current surface
Meaning scope System-coined term. A compatibility route preserves a retired URL or identifier by forwarding it to the current Plectis object; it is not a second live identity or an endorsement of the retired name.
Scope Covers retired Microcosm-era URLs , source paths, and identifiers that must continue resolving after the move to Plectis. A reader meets one whenever an old link or bookmark lands on a tombstone or redirect that points to the current page.
Not this A compatibility route is not evidence that the old name is still the current brand, and it is not a separate active site running in parallel. It is a one-way bridge from a retired address to the live one.
Reader rule The destination identifies the current item; the old address preserves continuity.
Other names, related terms and sources
Also shown as legacy route, tombstone route
Search handles old route, redirect route, migration route
Related terms routes_from microcosm Microcosm is now a legacy/compatibility label. routes_to plectis Compatibility routes point to the current public identity. uses routing Compatibility behavior is a routing concern.
Source refs sites/microcosm/legacy-route-manifest.json (generated_legacy_manifest) sites/microcosm-legacy/index.html (legacy_tombstone)
compatibility_route · routing Generated from the governed public vocabulary for Plectis.
compiled binary General or domain usage A compiled binary is machine-readable output from compilation, such as an object file, library, bytecode module , firmware image, or executable.
Compilation can produce several binary artifact kinds , and some are neither native machine code nor directly executable. Their exact bytes depend on source , tools, flags, dependencies , target platform, and environment . Running may require linking, loading, interpretation, or a virtual machine.
Compiled binary is a broad term for machine-readable output produced by compilation; it need not be a native executable. The result may be an object file, shared or static library, bytecode module , firmware image, executable program , or another platform-specific artifact . Its bytes depend on source , compiler and linker versions, flags, dependencies , target architecture , and build environment . Running may require a loader or virtual machine. Identity, safety, and provenance need separate evidence such as digests , signatures, reproducible builds, and a binding to the corresponding source revision.
Example A reproducibility receipt records the digest of a compiled object, library, bytecode module , firmware image, or executable together with its build inputs.
Scope The computing artifact sense, distinct from base-two notation, a binary relation, or a two-way classification.
Not this A number written in base two is binary notation, not a compiled binary; a compiled library or object file also need not be directly executable.
Reader rule A binary’s presence proves neither provenance nor safety; bind it to source revision, build recipe, platform, and digest when identity matters.
Other names, related terms and sources
Also shown as built binary
compiled_binary · public projection Generated from the governed public vocabulary for Plectis.
compiler General or domain usage A compiler translates one structured representation into another under defined transformation and checking rules.
A programming-language compiler may turn source into machine code, bytecode, or another language. A repository compiler may transform governed records into HTML, indexes , or other deterministic projections rather than executable code.
Compilers can parse , resolve names, check types, optimize, link, or generate output, but the exact stages and target vary. Machine code is only one possible result; source -to-source translators, template engines, schema compilers, and documentation builders also compile representations. Successful compilation establishes compliance with the checks the compiler performs, not the truth of input claims or correctness for every runtime case. Generated output remains reproducible when the input, compiler version, options, dependencies , and environment are fixed and its provenance stays traceable.
Scope Compilation is characterized by its input language and authority , transformations, target representation, diagnostics, compiler version, and guarantees established during translation.
Other names, related terms and sources
Also shown as compilers, compile, compiled
Source refs sites/microcosm/docs/area-import-drift.html (reading_context) sites/microcosm/docs/components.html (reading_context)
compiler · public projection Generated from the governed public vocabulary for Plectis.
completely multiplicative function General or domain usage A completely multiplicative function takes 1 to 1 and turns every product of positive integers into the product of their values.
Other names, related terms and sources
Also shown as completely multiplicative arithmetic function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 7220 (mathematical_source)
completely_multiplicative_function · mathematical concept Generated from the governed public vocabulary for Plectis.
complex number General or domain usage A number 𝑎 + 𝑏 𝑖 a + b i with real a,b and 𝑖 2 = − 1 i 2 = − 1 .
Scope Real numbers are the special case 𝑏 = 0 b = 0 . Addition works coordinatewise, while multiplication uses 𝑖 2 = − 1 i 2 = − 1 and combines rotation with scaling.
Other names, related terms and sources
Also shown as complex numbers
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 573 (mathematical_source)
complex_number · mathematical concept Generated from the governed public vocabulary for Plectis.
complex plane General or domain usage The complex plane represents every complex number 𝑎 + 𝑏 𝑖 a + b i by the point with Cartesian coordinates ( 𝑎 , 𝑏 ) ( a , b ) .
The horizontal coordinate is the real part and the vertical coordinate is the imaginary part. The number 3 + 2 𝑖 3 + 2 i lies at ( 3 , 2 ) ( 3 , 2 ) , and its distance from zero is √ 1 3 13 . This identifies the complex numbers with a two-dimensional real plane.
The lemniscate papers draw roots, critical points , curves, and regions in this plane. A complex number is one element; the complex plane is the whole ambient space. A set of roots can be finite while the surrounding plane is infinite . Real coordinates make geometric distances visible, and the complex arithmetic determines how polynomial maps transform those points. The complex plane is distinct from the Riemann sphere, which adds a point at infinity.
Scope Multiplication by a nonzero complex number acts as a rotation and scaling; complex multiplication supplies additional structure beyond the plane’s real coordinates.
Other names, related terms and sources
Also shown as Argand plane
Source refs governed vocabulary term_registry (reading_context)
complex_plane · mathematical concept Generated from the governed public vocabulary for Plectis.
component System-local specialization A component is a distinct part of a system with a defined job and interfaces to other parts.
bounded public object
Plectis presents public components with their inputs, outputs, source , and checks . This lets a reader inspect one mechanism without first understanding the entire system.
Combining components can introduce additional interactions. Evidence for each part helps assess the combination, but the combined behaviour may require its own checks and an explanation of how the parts fit together.
Example The Cold Reader Route Map is one component: a single unit whose job is to lay out a route through the system for someone arriving without prior context, shown on its own card with its evidence line and source route. See it live: Cold Reader Route Map open one live component card
Meaning scope System-local specialization. Component means one governed public system object in Plectis. It does not claim that every software , physical, or organizational component has this record shape .
Scope Component covers the reader -facing units that make up the system, encountered across the public site wherever a unit is named, carded, or linked, with the full set gathered on the components page.
Not this A component is not a marketing feature and not the whole system in miniature. It is a single unit of running code with a stated boundary, and the public word does not mean every underlying source identifier has been renamed from organ.
Reader rule The component's description should make clear which behaviour it implements and tests .
Other names, related terms and sources
Also shown as component card, bounded public object
Search handles organ, public object
Related terms belongs_to plectis Components are the public object units exposed by Plectis. translates microcosm Component is the public copy translation for legacy Microcosm object vocabulary. uses scope_limit Each component needs an explicit limit on what its evidence supports .
Source refs tool build_microcosm_public_site (public_projection_builder) core/organ_atlas.json (compatibility_source)
component · public projection Generated from the governed public vocabulary for Plectis.
compression System-local specialization Compression reduces the amount of information needed to store, transmit, or read something.
preserve through bands
Meaning scope System-local specialization. Compression means preservation of meaning across governed navigation bands. It is not data compression, model compression, or summarization in every external use.
Scope Compression governs how the public pages, component cards , paper modules , and field-guide entries are derived from the underlying files and records . A reader meets it wherever a short summary stands in for a larger artifact and offers a way to open the fuller layer.
Not this Shortening a summary by deleting a necessary hypothesis changes its meaning and fails the purpose of this navigation compression.
Reader rule This use allows deliberate loss of detail, so preserving meaning requires judgement and checks .
Other names, related terms and sources
Also shown as compress, summarize safely
Search handles summarise safely, context compression, holographic compression, navigation compression, profile-governed compression, telescope compression, telescoping compression
Source refs doctrine skill profile_governed_compression (skill) doctrine module navigation_hologram_theory (paper_module)
compression · navigation Generated from the governed public vocabulary for Plectis.
compression profile System-coined term A compression profile specifies how one kind of material should be presented at different levels of detail.
governed compression rulebook
It defines what a short view must include, what it may omit, and how it links to the fuller account. Plectis uses profiles to make summaries of the same artifact kind follow consistent expectations.
For example, a result card may always need its claim and evidence status even when a very short version leaves out the supporting calculation.
Example The vocabulary-term profile is a concrete compression profile: it governs how a vocabulary term is projected into a word, a phrase, a flag, a card, and deeper bands, which is the same laddered shape this glossary entry follows. See it live: Navigation Hologram Route Plane open the route plane where banded compression is projected
Meaning scope System-coined term. A compression profile governs the depth bands and allowed omissions for one artifact kind ; it is not a file-compression setting or an improvised summary style.
Scope The term covers the rulebooks that govern banded compression across the system. A reader meets it behind any surface that presents the same content at different levels of detail, and it is grounded in the navigation and route-plane machinery that projects artifacts through bands.
Not this A compression profile is not a file-size or data-compression setting, and not a one-off summary someone writes by hand. It is a declared rulebook, bound to a specific artifact kind , stating which details a shortened form must keep and which collapses are not allowed.
Reader rule The profile governs the shape of a summary; the source governs its facts.
Other names, related terms and sources
Also shown as profile_id, russian doll profile
Search handles band profile, compression rulebook
Source refs doctrine module navigation_hologram_theory (paper_module)
compression_profile · artifact Generated from the governed public vocabulary for Plectis.
computer science General or domain usage Computer science is the study of computation, algorithms , information, and the systems that process them.
Scope Covers the ordinary name of the field and the landing's 'CS people' invitation.
Not this Solving an Erdős problem is mathematics ; calling that CS would hide the actual result.
Reader rule Formal verification is one part of this wider field.
Other names, related terms and sources
Also shown as CS, CS people
Search handles C.S.
computer_science · public projection Generated from the governed public vocabulary for Plectis.
concept System-local specialization A concept is an idea or category used to understand and organise a subject.
named system object
Meaning scope System-local specialization. Concept means a governed doctrine entity with a stable id and sources . It does not mean every idea or assert that the local definition is philosophically exhaustive.
Scope Concepts cover the named objects in the doctrine layer , distinct from anti-patterns, axioms , and principles . A reader meets them wherever the doctrine refers to a defined object by name, and on the doctrine pages where those objects are listed and described.
Not this A concept is not a step, a procedure, or a tool you run. It is the name and definition of an object, not the action taken on it; the doing belongs to mechanisms and skills .
Reader rule The record explains what the idea denotes; procedures describe how to act on it.
Other names, related terms and sources
Also shown as con, con_*, doctrine concept
Search handles noun
Source refs standard std_concept (standard) doctrine skill concept_mechanism_curation (skill)
concept · doctrine Generated from the governed public vocabulary for Plectis.
concurrency General or domain usage Concurrency is the organization of multiple tasks whose execution or waiting periods overlap.
Concurrent tasks can interleave on one processor or execute simultaneously on several processors. When they share mutable state or limited resources, their possible orderings require explicit coordination.
Concurrency allows more than one task to be in progress during the same interval. A scheduler may interleave them on one processing unit, or hardware may run them in parallel. Overlap can improve responsiveness and resource use when one task waits for input or a service. It also creates several hazards: races depend on timing, deadlocks leave tasks waiting on one another, duplicate work can violate uniqueness assumptions , and concurrent writes can lose updates. Locks, transactions , message passing, immutable data, and ownership rules are different ways to control those interactions.
Scope Concurrency permits overlapping progress but does not imply simultaneous execution ; correctness depends on how shared state, ordering, cancellation, failures, and resource limits are coordinated.
Other names, related terms and sources
Also shown as concurrent, concurrently
Source refs sites/microcosm/docs/architecture.html (reading_context) sites/microcosm/docs/area-agent-reliability.html (reading_context)
concurrency · public projection Generated from the governed public vocabulary for Plectis.
conditional reduction General or domain usage A conditional reduction proves that a target statement follows if a specified further condition holds.
The implication can be a complete theorem even while the condition remains unresolved. The reduction is useful when it exposes a more tractable question or clarifies exactly what additional evidence is needed.
A one-way implication need not give an equivalent problem. The new condition may be stronger than the target, so its difficulty and plausibility need separate assessment.
Example A proof that the target follows from a still-open summability estimate is a conditional reduction: the implication is established, while the target remains open until the estimate is proved.
Scope A conditional reduction establishes an implication , not its conclusion.
Reader rule The target is still open until the required condition is established or another proof is found.
Other names, related terms and sources
Also shown as conditional reductions
conditional_reduction · public projection Generated from the governed public vocabulary for Plectis.
conditional theorem General or domain usage A conditional theorem proves a conclusion under stated hypotheses.
Scope Conditional here means logically conditional on a stated hypothesis , not provisional or draft.
Reader rule Read the assumptions together with the conclusion, including assumptions supplied as parameters in Lean .
Other names, related terms and sources
Also shown as conditional, conditional result
conditional_theorem · public projection Generated from the governed public vocabulary for Plectis.
configuration General or domain usage Configuration is the set of selected values and options that determines how a program or system operates in a particular environment .
Configuration can choose paths, features, limits , credentials , service addresses, or policy modes without changing the program ’s source code. Different configurations can produce different behaviour from the same version.
Configuration may live in command-line options, environment variables , structured files, deployment systems, or stored service settings. Defaults are also configuration choices even when no user edits a file. Plectis source contracts name configuration paths when routes depend on them. A configuration can be syntactically valid yet unsafe or unsuitable, so validation must check both form and permitted combinations.
Example A configuration file selects the public output directory and excludes private source roots.
Meaning scope General or domain usage. Settings that select or parameterize existing behavior without implementing the underlying algorithm itself.
Scope Record the relevant configuration with a result when those settings can affect interpretation or reproduction.
Not this A code change that implements a new algorithm is not merely a configuration change.
Other names, related terms and sources
Also shown as config, configuration setting, settings
Source refs sites/microcosm/SOURCE_CONTRACT.md (reading_context)
configuration · public projection Generated from the governed public vocabulary for Plectis.
conformal map General or domain usage A conformal map preserves angles locally; in planar complex analysis, it is a holomorphic map with nonzero derivative .
A conformal map locally acts like a rotation and a positive scaling, with the scale allowed to vary between points. For example, 𝑧 ↦ 𝑧 2 z ↦ z 2 is conformal away from zero. It preserves local angles but can change lengths and areas.
A conformal map preserves oriented angles between intersecting curves at every point. For maps between open subsets of the complex plane , a holomorphic function is conformal wherever its derivative is nonzero. Such a map may stretch lengths and areas, but infinitesimally it acts as a rotation followed by a positive scaling. A conformal bijection has a conformal inverse and gives an equivalence of domains. A Riemann map is a special conformal bijection between a proper simply connected planar domain and the unit disc , so conformal map and Riemann map are not interchangeable names.
Example The map z maps to z squared is conformal away from zero but fails to be conformal at zero, where its derivative vanishes.
Meaning scope General or domain usage. Conformal is local; univalent or conformal bijection adds global injectivity.
Scope For planar complex domains verify that the map is holomorphic and has nonzero derivative ; global one-to-one correspondence additionally requires injectivity and is not part of local conformality alone.
Not this A general continuous homeomorphism can distort angles and need not be conformal.
Other names, related terms and sources
Also shown as conformal mapping, angle-preserving map
conformal_map · mathematical concept Generated from the governed public vocabulary for Plectis.
congruence General or domain usage Two integers are congruent modulo m if their difference is divisible by m.
For a positive modulus , this is equivalent to having the same remainder. Thus 1 7 ≡ 2 17 ≡ 2 modulo 5 because 1 7 − 2 = 1 5 17 − 2 = 15 is divisible by 5.
The papers use congruences to keep only the remainder information relevant to an argument. A nonzero remainder can rule out divisibility even when the original expression is too large to inspect directly.
Other names, related terms and sources
Also shown as congruent modulo, modular congruence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 151 (mathematical_source)
congruence · mathematical concept Generated from the governed public vocabulary for Plectis.
conjecture General or domain usage A conjecture is a precise mathematical claim proposed as true but not yet established by proof .
Examples, calculations, and partial results may make a conjecture plausible. A proof must cover its full statement; a counterexample must satisfy its hypotheses while violating its conclusion.
The papers can give equivalent formulations or sufficient conditions for a conjecture. Those are useful results, but the conjecture stays unresolved unless the additional work actually establishes or refutes it.
Example An Erdős problem can ask whether a stated property always holds, making that proposed universal statement a conjecture.
Scope A conjecture covers the exact statement and hypotheses in its cited formulation.
Not this A theorem is not a conjecture once its proof has been accepted under the stated assumptions .
Reader rule Evidence from many cases does not by itself settle a claim about all cases.
Other names, related terms and sources
Also shown as mathematical conjecture
Search handles conjectures
conjecture · public projection Generated from the governed public vocabulary for Plectis.
conjugacy class General or domain usage The conjugacy class of a group element g is the set { ℎ 𝑔 ℎ − 1 : ℎ i n t h e g r o u p } { h g h − 1 : h in the group } .
In an abelian group every conjugacy class has one element because ℎ 𝑔 ℎ − 1 = 𝑔 h g h − 1 = g . In a nonabelian symmetry group, conjugate elements represent the same action after changing the coordinate or labeling used to describe it.
Changing the prime ideal above a fixed base prime conjugates its Frobenius element . Chebotarev therefore naturally counts base primes by Frobenius conjugacy classes.
Example In an abelian group every conjugacy class has one element because ℎ 𝑔 ℎ − 1 = 𝑔 h g h − 1 = g .
Meaning scope General or domain usage. Conjugacy relates g to hgh⁻¹ as h varies within a group. It is distinct from complex conjugation.
Scope Conjugacy is an equivalence relation on group elements. It is not complex conjugation, although complex conjugation itself can be a particular group element. A theorem prescribing a class is weaker than choosing one distinguished element.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 283 (prerequisite_dependency)
conjugacy_class · mathematical concept Generated from the governed public vocabulary for Plectis.
connected component General or domain usage A connected component is a connected subset that cannot be enlarged while remaining connected within the surrounding space.
Connected means that the part cannot be separated into two disjoint, nonempty relatively open pieces. Each point belongs to exactly one connected component.
In the lemniscate papers , components distinguish separate regions around polynomial roots . Statements requiring an actual path or a length bound need more than merely identifying which connected component contains a point.
Scope Connectedness need not provide a continuous path between every pair of points in an arbitrary space.
Other names, related terms and sources
Also shown as maximal connected piece, connected components
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 709 (mathematical_source)
connected_component · mathematical concept Generated from the governed public vocabulary for Plectis.
connected set General or domain usage A set that cannot be split into two disjoint nonempty open pieces relative to that set.
An interval is connected, while two separated intervals are not. Connectedness says the set is one topological piece even when no particular path has yet been supplied.
The lower-bound argument applies to every connected set containing two selected roots, so it is stronger than checking only straight segments or one chosen curve.
Scope Path connected implies connected, but the converse can fail in general spaces. Do not silently replace a connected-set claim by a stronger path claim .
Other names, related terms and sources
Also shown as connected subset, topologically connected
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 730 (mathematical_source)
connected_set · mathematical concept Generated from the governed public vocabulary for Plectis.
constructive proof General or domain usage A constructive proof uses constructive inference and supplies the information required by its conclusions.
For an existence claim , this usually means producing an appropriate witness with justification of its property. Constructive logic does not use unrestricted excluded middle or double-negation elimination as general inference rules.
The external-verification notes distinguish constructive dyadic -rank arguments from other evidence routes. Lean can check constructive and classical developments, so being machine-checked alone does not identify which logical methods a result uses.
Meaning scope General or domain usage. The logical meaning is intended. Informal mathematics also uses constructive for explicit constructions; the row distinguishes that description from a claim about an entire proof 's constructive foundations.
Scope State the constructive framework and assumptions when computational content matters. An explicitly described object inside an otherwise classical argument need not make the whole proof constructive.
Other names, related terms and sources
Also shown as constructive argument, constructive proofs
Source refs sites/microcosm/maths/documents/external-verification.html (local_reader_surface)
constructive_proof · mathematical concept Generated from the governed public vocabulary for Plectis.
context packet System-coined term A context packet is a selected collection of information supplied for a particular task.
Plectis uses packets to give an agent the relevant question, source routes, constraints, and current evidence without requiring it to read the whole repository . Public reader packets serve a similar orientation purpose.
Selection necessarily leaves things out. Links to the underlying material let a reader recover missing detail and check whether a summary still agrees with the sources it describes.
Example The Why section pairs kernel routes with context packets as the agent path.
Meaning scope System-coined term. A context packet is the bounded bundle of routes and material an agent uses to reach the same objects a human reaches through the visual front end . It is not a chat window's entire history.
Scope Landing copy about how agents navigate the system.
Not this A context packet is not the model 's hidden weights, and not a guarantee of a correct answer.
Reader rule A packet should make its scope and source versions clear.
Other names, related terms and sources
Also shown as context packets
context_packet · public projection Generated from the governed public vocabulary for Plectis.
context window General or domain usage A context window is the bounded sequence of tokens a language model can use during a generation.
The window can contain instructions, conversation, retrieved documents, tool results, and tokens generated so far. These compete for finite space, although input and output limits vary by model . Token capacity measures available context, not comprehension, permanent memory, or factual reliability .
A context window bounds the tokens a language model can directly condition on for one generation. Instructions, conversation, retrieved passages, tool results, and the requested output budget all consume capacity. Content outside that window has no direct effect unless another mechanism retrieves or summarizes it back in. Large capacity does not create durable memory, guarantee recall, or ensure equal attention across positions. Tokenization also means character count and word count do not map uniformly to available space, especially across code, mathematics , and languages.
Example A fourteen megabyte packet is past what a chat window reads straight through.
Scope Applies to language models ; the exact size varies by model and changes over time.
Reader rule A larger window permits more input but does not guarantee that every included detail is used accurately or with equal attention.
Other names, related terms and sources
Also shown as context windows
context_window · public projection Generated from the governed public vocabulary for Plectis.
continuous integration General or domain usage Continuous integration is the practice of frequently combining code changes and automatically checking that they work together.
A CI service reacts to selected repository changes by running declared builds, tests , linters, or policy checks in a controlled environment . It gives collaborators evidence about whether changes integrate and preserves logs and status. The result covers the configured jobs and their environment .
Continuous integration combines small repository changes frequently and runs declared automation against each selected revision. Typical jobs compile code, execute tests , check formatting, scan dependencies , or build documentation in a controlled environment . The practice detects integration faults early and leaves reviewable logs, but its authority ends at configured checks , fixtures , platforms, and permissions . A green result establishes only what the completed checks justify; a skipped job or an untested requirement is not covered by the colour of the overall status. Reproducibility also depends on pinned dependencies and a faithfully described runner environment .
Example A check in the CI floor runs on every commit to the public repository .
Scope Describes the practice; the specific service used is a separate question.
Reader rule A green CI result means the configured checks passed for that revision; it is not proof of correctness, security, deployability, or review.
Other names, related terms and sources
Also shown as CI
Search handles public ci
continuous_integration · public projection Generated from the governed public vocabulary for Plectis.
contradiction General or domain usage A contradiction is an impossibility obtained from assumptions , such as a statement and its negation both being true.
Scope A contradiction rejects the assumptions used to derive it within the logic and hypotheses of that proof .
Not this Two surprising or tension-filled statements are not a contradiction unless they cannot both be true.
Reader rule Each inference must follow from the assumptions actually available at that point.
Other names, related terms and sources
Also shown as proof by contradiction
Search handles contradict, contradicts
contradiction · public projection Generated from the governed public vocabulary for Plectis.
contrapositive General or domain usage In classical logic , the contrapositive of “if P, then Q” is the equivalent statement “if not Q, then not P”.
For example, “every multiple of 4 is even” gives “an odd integer is not a multiple of 4”. Either version expresses the same implication through a different route.
The papers often prove that rationality would force a property, then establish failure of that property to deduce irrationality . The reasoning must negate the exact consequence, with its quantifiers intact.
Scope The converse, “if Q, then P”, is a different statement and need not hold.
Other names, related terms and sources
Also shown as proof by contrapositive, contrapositive form
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 790 (mathematical_source)
contrapositive · mathematical concept Generated from the governed public vocabulary for Plectis.
contribute General or domain usage To contribute is to supply work that helps a shared project advance or correct itself.
Here useful contributions include proofs , counterexamples , clearer explanations, software fixes, and reproducible reports of failed approaches . The public repositories provide concrete material against which a contribution can be inspected.
A mathematical result remains attributable to the people who established it. Using Plectis as a tool or starting point does not transfer priority for their result to the project.
Example A correction to a hypothesis , sent as an issue on the Lean repository , is a contribution.
Meaning scope General or domain usage. Contribute keeps its ordinary meaning: to give work that can be accepted. Credit for accepted work is a separate record ; see contributor credit .
Scope Names the act of giving work. It does not name payment, employment, or automatic coauthorship.
Not this A model proposing text is not itself a contributor; a person who stands behind accepted work is.
Reader rule Acceptance and attribution should follow the work and evidence , not the confidence of its presentation.
Other names, related terms and sources
Also shown as contribution, contributions
Search handles contributes, contributed, contributing, how to contribute
contribute · public projection Generated from the governed public vocabulary for Plectis.
contributor credit System-local specialization Contributor credit records who supplied a piece of work and what that contribution was.
Plectis aims to preserve attribution for accepted results, corrections, and other useful work, including when later work builds on them. Describing the contribution makes the credit more informative than simply listing a name.
The project's contribution record is not a substitute for scholarly priority or publication conventions. A result's authors retain credit for establishing it, including when this system helped them work.
Example A correction to a stated hypothesis , sent as an issue, is credited to its author in the contribution record .
Meaning scope System-local specialization. Credit here follows the Lean repository 's written policy. It is not a promise of coauthorship, employment or payment, and it is never awarded to a model .
Scope Covers acknowledgement for accepted contributions to the two public repositories , including downstream results they lead to.
Not this A polite reply from a reader is not a review and earns no credit line.
Reader rule Human authorship and the use of AI or other tools should be recorded distinctly.
Other names, related terms and sources
Also shown as credit
Search handles credit policy, how credit works, credit for contributions
contributor_credit · public projection Generated from the governed public vocabulary for Plectis.
convergence General or domain usage Convergence means approaching a specified limit ; for an infinite series , it means that its partial sums approach a finite value.
Reader rule Terms tending to zero are necessary for a series to converge, but are not sufficient.
Other names, related terms and sources
Also shown as series convergence
Search handles convergent, converges
convergence · public projection Generated from the governed public vocabulary for Plectis.
convex combination General or domain usage A weighted sum whose weights are nonnegative and add to one.
One quarter of x plus three quarters of y lies on the line segment between x and y.
The trinomial root equation places normalized polynomial values inside the convex hull of two controlled quantities.
Meaning scope General or domain usage. Convex geometry and analysis. Convexity concerns mixtures, not merely curved shapes.
Scope Allowing negative weights while keeping their total equal to one gives an affine combination. A general linear combination need not have weights summing to one.
Other names, related terms and sources
Also shown as weighted average
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 42 (mathematical_source)
convex_combination · mathematical concept Generated from the governed public vocabulary for Plectis.
convex envelope General or domain usage The convex envelope of a function is the greatest convex function that lies everywhere at or below the original function .
On the interval [ − 1 , 1 ] [ − 1 , 1 ] , the function 𝑓 ( 𝑥 ) = − 𝑥 2 f ( x ) = − x 2 bends downward and is not convex . Its convex envelope is the constant function − 1 − 1 : that constant stays below f, and convexity prevents any convex function below f from rising above the chord joining the two endpoint values.
On a convex domain, take the pointwise supremum of all convex functions g satisfying 𝑔 ≤ 𝑓 g ≤ f . Equivalently, minimize weighted averages of f over finite convex combinations representing each point. If no finite convex minorant exists, the envelope may take − ∞ − ∞ under an extended-value convention. A closed convex envelope additionally requires lower semicontinuity ; that condition can change boundary values. The function construction is related to convex hulls through the epigraph, the set of points on or above a graph .
Example For 𝑓 ( 𝑥 ) = − 𝑥 2 f ( x ) = − x 2 on [ − 1 , 1 ] [ − 1 , 1 ] , the lower convex envelope is the constant function − 1 − 1 .
Reader rule State the convention and domain. Here “convex envelope” means the lower convex envelope of a function . It is not the convex hull of a set, although the envelope can be constructed from convex combinations and is closely related to the convex hull of the function ’s epigraph.
Other names, related terms and sources
Also shown as lower convex envelope, greatest convex minorant
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 89 (mathematical_context)
convex_envelope · mathematical concept Generated from the governed public vocabulary for Plectis.
convex hull General or domain usage The convex hull of a set is the smallest convex set containing it, equivalently all finite weighted averages of its points with nonnegative weights summing to one.
For three non-collinear points in the plane, the convex hull is the filled triangle, including its edges and interior. For two points it is their line segment. It fills all straight mixtures between the original points.
In the polynomial paper , a point is located relative to the convex hull of several partial sums . That geometric containment encodes every possible convex combination of those sums and gives stronger information than membership in their union.
Example For three non-collinear points in the plane, the convex hull is the filled triangle, including its edges and interior.
Meaning scope General or domain usage. The hull includes the filled-in region, not just its boundary. Points already inside the hull do not enlarge it.
Scope A set is convex when the segment between any two of its points remains inside. The convex hull contains points, not merely the polygonal boundary; repeated or interior generating points do not change it.
Sources
Source refs sites/microcosm/maths/papers/erdos-1041-lemniscate-newton-flow.html::line 165 (mathematical_source)
convex_hull · mathematical concept Generated from the governed public vocabulary for Plectis.
convexity General or domain usage A set is convex when it contains every line segment between its points; a function is convex when its graph lies at or below each chord joining two graph points.
A filled disc is a convex set because every segment between two points stays inside; a crescent need not be. The function 𝑓 ( 𝑥 ) = 𝑥 2 f ( x ) = x 2 is convex because its graph lies below every chord. These are related meanings: the epigraph lying on or above a convex function is a convex set.
For a set C, convexity requires 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑦 t x + ( 1 − t ) y to belong to C whenever x and y do and 0 ≤ 𝑡 ≤ 1 0 ≤ t ≤ 1 . For a real-valued function on a convex domain, it requires 𝑓 ( 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑦 ) ≤ 𝑡 𝑓 ( 𝑥 ) + ( 1 − 𝑡 ) 𝑓 ( 𝑦 ) f ( t x + ( 1 − t ) y ) ≤ t f ( x ) + ( 1 − t ) f ( y ) . A linear function is convex, so convex does not mean strictly curved. The polynomial papers use convex combinations and convex hulls to turn weighted relationships between points into geometric information.
Example A filled disc is a convex set because every segment between two points stays inside; a crescent need not be.
Meaning scope General or domain usage. For sets, convexity concerns containment of line segments. For functions , values must lie at or below the chords joining graph points.
Scope Identify the object. For a set, test whether 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑦 t x + ( 1 − t ) y remains inside. For a function , test whether 𝑓 ( 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑦 ) ≤ 𝑡 𝑓 ( 𝑥 ) + ( 1 − 𝑡 ) 𝑓 ( 𝑦 ) f ( t x + ( 1 − t ) y ) ≤ t f ( x ) + ( 1 − t ) f ( y ) . Convex does not mean increasing, and strict convexity is stronger.
Other names, related terms and sources
Also shown as convex function, convex set, convex
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 345 (mathematical_source)
convexity · mathematical concept Generated from the governed public vocabulary for Plectis.
coprime General or domain usage Two integers are coprime if their greatest common divisor is 1.
Scope Coprime is a relation between the stated integers or sets of integers .
Not this Two numbers can share no obvious small factor and still fail to be coprime.
Reader rule A fraction is in lowest terms when its numerator and denominator are coprime.
Other names, related terms and sources
Also shown as relatively prime, co-prime
Search handles coprimality
coprime · public projection Generated from the governed public vocabulary for Plectis.
corpus General or domain usage A corpus is a collection of material studied or managed as a body of work.
The site uses the term for collections such as formal declarations , papers , or recorded examples. A particular revision or manifest can fix which items belong to the collection being described.
A corpus can grow or change over time. Results about one snapshot should not silently be treated as results about every later version or every related repository .
Example The papers corpus is the fixed set of published PDFs the release chain checks .
Scope A corpus result covers that corpus and nothing outside it.
Reader rule Any reported count or check should identify the corpus and version it covers.
Other names, related terms and sources
Also shown as corpora
corpus · public projection Generated from the governed public vocabulary for Plectis.
countable set General or domain usage A set is countable when its elements can be injected into the natural numbers ; finite sets are included.
An infinite countable set can be listed in a sequence covering every element. A finite set is also countable, and the empty set qualifies. Countably infinite explicitly excludes these finite cases.
The #257 divisor -cover discussion permits finite or countable families of finite covering sets. This permits an indexed sum over the cover without asserting that the covered support itself is finite or that an optimal cover has been computed.
Meaning scope General or domain usage. The at-most-countable convention is intended, consistent with Mathlib . Countably infinite is the strictly infinite case; countability alone supplies no computable listing.
Scope Countability bounds cardinality , not density, size of individual values, or existence of an efficient enumeration algorithm .
Other names, related terms and sources
Also shown as countable sets, at most countable
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
countable_set · mathematical concept Generated from the governed public vocabulary for Plectis.
counterexample General or domain usage A counterexample is a case that satisfies a claim 's assumptions but makes its conclusion false.
One counterexample disproves a universal statement. For instance, 2 is a counterexample to “every prime number is odd”, because it is prime and even.
Counterexamples in the working records may target an attempted lemma or method rather than the original open problem . Naming the exact statement they refute preserves that distinction and explains what a revised approach must avoid.
Example The prime 2 refutes the statement that every prime is odd; it does not refute the statement that every prime greater than 2 is odd.
Scope A counterexample refutes the exact universal statement whose hypotheses it satisfies; it does not establish a broader negative claim or settle nearby formulations with different hypotheses.
Reader rule An example outside the assumptions does not refute the statement.
Other names, related terms and sources
Also shown as counterexamples
counterexample · public projection Generated from the governed public vocabulary for Plectis.
coverage General or domain usage Coverage is the measured portion of a declared population, requirement set, behavior space, or source surface that has been examined or represented.
The denominator and matching method determine what the number means. Test coverage can report executed statements or branches; corpus coverage can report linked records ; proof coverage can report which stated obligations have formal evidence . None of these automatically establishes correctness of covered items.
Coverage converts a bounded inventory into a numerator, denominator , and method. High test coverage can coexist with weak assertions or missing behaviors. Complete proof coverage may mean every declared obligation has a proof while the specification itself omits an important requirement. Source or documentation coverage can be exact within a known catalogue yet silent about objects outside it. Comparisons are meaningful only when inventories and methods align. A useful receipt therefore preserves the authority for the denominator , exclusions, measurement version, and concrete uncovered set.
Example A report states that 92 of 100 declared routes were exercised and names the eight uncovered routes.
Meaning scope General or domain usage. Coverage measures a specified part of a stated inventory or space. The system records inventories and matching methods; test coverage, corpus coverage, and proof -obligation coverage remain distinct measurements.
Scope Coverage is always relative to one declared inventory or behavior space, method, and measurement time.
Not this A high percentage does not prove covered items correct or show completeness beyond the declared denominator .
Reader rule Ask what total set was declared, how membership and matches were determined, when measurement occurred, and which uncovered cases remain.
Other names, related terms and sources
Also shown as covered set, coverage receipt
Search handles coverage count, coverage fraction
Source refs standard std_compliance_coverage (source_authority) src/microcosm_core/organs/self_ignorance_coverage_ledger.py (source_authority)
coverage · public projection Generated from the governed public vocabulary for Plectis.
covering map General or domain usage A map whose target has neighbourhoods that lift to separate copies, each mapped homeomorphically onto that neighbourhood .
A covering map is a continuous surjection with this evenly covered neighbourhood property. The real line covers the circle by 𝑡 ↦ e x p ( 𝑖 𝑡 ) t ↦ exp ( i t ) . The map 𝑧 ↦ 𝑧 2 z ↦ z 2 covers the punctured plane twice, but branches at zero.
The #1041 paper removes the critical values attained in the chosen polynomial component . The remaining restriction is a covering. On its simply connected slit domain, each chosen root determines an inverse sheet. These topological prerequisites do not themselves bound the lifted path length.
Other names, related terms and sources
Also shown as finite cover, covering projection
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::res:component-local-covering (mathematical_source)
covering_map · mathematical concept Generated from the governed public vocabulary for Plectis.
credential General or domain usage A credential is evidence used to support a claim about identity, qualification, role, or authority .
In computing, credentials include passwords, keys, tokens, and certificates used during authentication . In professional settings , credentials include degrees, licences, and recognised appointments.
Technical credentials help a system check an account, service, or role: examples include passwords, signed certificates , and access tokens. Some are secret; a public certificate need not be. Institutional credentials instead record training, qualifications, or position. Plectis uses both senses. Neither possession of a credential nor a person’s qualifications replace checking the specific permission or research argument involved.
Example An SSH private key is a technical credential; a professional licence is an institutional credential.
Meaning scope General or domain usage. Evidence used to establish identity, authority , or qualification; a public account name alone is not a secret authentication credential.
Scope Determine which claim a credential supports ; holding it does not grant every permission or prove every relevant competence.
Not this A public username alone is not a secret authentication credential.
Other names, related terms and sources
Also shown as credentials, login credential, professional credential
Source refs sites/microcosm/lean/experience/papers/open-source-mathematics-strategy.html (reading_context)
credential · public projection Generated from the governed public vocabulary for Plectis.
critic posture System-coined term Critic posture is a deliberate way of examining an idea for weaknesses before relying on it.
critique becomes thinking trait
Plectis uses it to ask concrete questions: whether an abstraction fits the evidence , whether a proposed route can be executed , and whether a necessary rule or check is missing.
This turns an objection into work that can be assessed. The critic's role is to test the idea, while any resulting change still needs an owner and validation .
Example The Routing Anti Patterns Registry is a concrete result of critic posture: a recorded set of failure modes , each one a criticism that held up under testing and was written down as a durable rule rather than left as a passing objection. See it live: Routing Anti Patterns Registry open the recorded failure modes that stabilized criticism produces
Meaning scope System-coined term. Critic posture is the Type A practice of stress-testing an abstraction, route, or missing standard and durably recording what survives; it is not negativity, a reviewer identity, or a free-floating opinion.
Scope Critic posture covers the judgment trait applied during human and agent brainstorming, where ideas are stress-tested before they become doctrine . A reader meets it in the doctrine and agent -reliability material, and sees its results in the recorded rules and anti-patterns that stabilized criticism produces.
Not this Critic posture is not a separate reviewer role that must be spawned, and it is not a judgment that the whole system is flawed. It is the habit of testing one idea at its weak points and recording what holds.
Reader rule A useful criticism identifies the affected claim and the evidence that would resolve it.
Other names, related terms and sources
Also shown as critics as thinking traits, critic as thinking trait
Search handles critical posture, critique as thinking trait, failure question, substrate critic
Source refs doctrine skill human_ai_brainstorming (skill) doctrine skill local_to_general_propagation (skill) standard std_agent_entry_surface (standard) governed vocabulary term_registry (registry)
critic_posture · judgment trait Generated from the governed public vocabulary for Plectis.
critical point General or domain usage A critical point of a differentiable real or complex function is an input where its derivative vanishes; in several real variables , all first partial derivatives vanish there.
For a complex polynomial p, a critical point c satisfies 𝑝 ′ ( 𝑐 ) = 0 p ′ ( c ) = 0 . For 𝑝 ( 𝑧 ) = 𝑧 2 − 1 p ( z ) = z 2 − 1 , the critical point is 0, whereas the roots are 1 and − 1 − 1 . In several real variables , all first partial derivatives must vanish together.
Some elementary conventions also include points of nondifferentiability. The polynomial setting here is differentiable everywhere, and critical points matter because the Newton expression − 𝑝 / 𝑝 ′ − p / p ′ is undefined there.
Example For 𝑝 ( 𝑧 ) = 𝑧 2 − 1 p ( z ) = z 2 − 1 , 𝑝 ′ ( 𝑧 ) = 2 𝑧 p ′ ( z ) = 2 z , so 0 is the unique critical point even though the roots are 1 and − 1 − 1 .
Reader rule A critical point is an input where the derivative vanishes; its image is a critical value . Neither need be a root, and distinct critical points can share one critical value .
Other names, related terms and sources
Also shown as stationary point, polynomial critical point
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 455 (mathematical_source)
critical_point · mathematical concept Generated from the governed public vocabulary for Plectis.
critical value General or domain usage A critical value is the output of a function at one of its critical points .
For 𝑝 ( 𝑧 ) = 𝑧 2 − 1 p ( z ) = z 2 − 1 , the critical point 0 has critical value − 1 − 1 . The point and value lie on different sides of the function : one is an input and the other is its image.
The lemniscate arguments compare these magnitudes and directions to study how regions can meet. Distinct critical points can share a critical value, and different values can have the same magnitude.
Scope The modulus | 𝑝 ( 𝑐 ) | | p ( c ) | is the magnitude of a critical value, not the value itself.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 151 (mathematical_source)
critical_value · mathematical concept Generated from the governed public vocabulary for Plectis.
CSS General or domain usage CSS is a language for describing how structured documents are presented.
CSS rules select parts of an HTML document and assign visual or layout properties such as colour, spacing, type, position, and responsive behaviour. The document remains HTML; CSS changes its presentation.
A browser combines the document tree with matching CSS rules to calculate its presentation. When rules compete, the cascade resolves their origin, importance, layer, specificity, and order; some properties are inherited from a parent. Plectis shares a stylesheet across generated pages and uses it for screen layouts, print output, readable contrast, and reduced-motion preferences.
Example A rule gives focused glossary links a visible outline.
Meaning scope General or domain usage. The style language that controls presentation of structured documents, distinct from HTML structure and JavaScript behavior.
Scope CSS controls presentation, including layout and interaction cues such as visible keyboard focus.
Not this JavaScript code that reacts to a click is behaviour, not CSS presentation.
Other names, related terms and sources
Also shown as Cascading Style Sheets, CSS stylesheet, CSS stylesheets
Source refs sites/microcosm/docs/lineage.html (reading_context)
css · public projection Generated from the governed public vocabulary for Plectis.
curve parametrisation General or domain usage A function from a parameter interval into a space whose image traces a curve.
The map 𝑡 ↦ ( c o s 𝑡 , s i n 𝑡 ) t ↦ ( cos t , sin t ) , for 0 ≤ 𝑡 ≤ 2 𝜋 0 ≤ t ≤ 2 π , traces the unit circle once counterclockwise. A parametrisation specifies a position for every parameter value, and a differentiable parametrisation also determines direction and speed.
A parametrisation of a curve is a map gamma from an interval into a space, usually Euclidean or complex space. Its image is the geometric set traced by gamma. When gamma is differentiable , gamma'(t) gives velocity; if that derivative never vanishes, the parametrisation is regular. Replacing t by a suitable increasing function changes speed without changing orientation or image, while a decreasing replacement reverses orientation . Curve length is unchanged by sufficiently regular one-to-one reparametrisation, but a map that retraces part of the curve can count that part more than once.
Example 𝛾 ( 𝑡 ) = ( c o s 𝑡 , s i n 𝑡 ) γ ( t ) = ( cos t , sin t ) for 0 through 2 𝜋 2 π parametrises the unit circle once counterclockwise.
Meaning scope General or domain usage. Parametrisation can also describe a family of objects by coordinates; this entry focuses on curves because that is the manuscript use requiring the prerequisite.
Scope Separate the parametrised map from its image: different parametrisations can trace the same geometric curve, with different speeds or orientations .
Not this The unit circle as a bare set is a curve image, not a specified parametrisation.
Other names, related terms and sources
Also shown as curve parametrization, parametric curve
curve_parametrisation · mathematical concept Generated from the governed public vocabulary for Plectis.
cyclotomic polynomial General or domain usage The nth cyclotomic polynomial is the monic integer polynomial whose roots are exactly the primitive nth roots of unity .
Φ 1 ( 𝑥 ) = 𝑥 − 1 Φ 1 ( x ) = x − 1 , Φ 2 ( 𝑥 ) = 𝑥 + 1 Φ 2 ( x ) = x + 1 , and Φ 4 ( 𝑥 ) = 𝑥 2 + 1 Φ 4 ( x ) = x 2 + 1 because ± 𝑖 ± i are the primitive fourth roots. The factorization 𝑥 𝑛 − 1 = ∏ 𝑑 ∣ 𝑛 Φ 𝑑 ( 𝑥 ) x n − 1 = ∏ d ∣ n Φ d ( x ) organizes all roots of unity by exact order.
The paper cancels cyclotomic factors before estimating rational -base denominators . The factorization isolates predictable roots-of-unity divisibility , allowing the remaining numerator and denominator growth to be measured more sharply.
Example Φ 1 ( 𝑥 ) = 𝑥 − 1 Φ 1 ( x ) = x − 1 , Φ 2 ( 𝑥 ) = 𝑥 + 1 Φ 2 ( x ) = x + 1 , and Φ 4 ( 𝑥 ) = 𝑥 2 + 1 Φ 4 ( x ) = x 2 + 1 because ± 𝑖 ± i are the primitive fourth roots.
Meaning scope General or domain usage. The nth cyclotomic polynomial selects roots of unity with exact multiplicative order n, rather than roots of smaller order dividing n.
Scope A primitive nth root has exact multiplicative order n. Cyclotomic polynomials are irreducible over the rationals , but “cyclotomic factor” in a calculation may mean one copy appearing inside a larger product .
Other names, related terms and sources
Also shown as cyclotomic factor
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 588 (mathematical_source)
cyclotomic_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
D
D-finite function General or domain usage A D-finite function satisfies a nontrivial linear differential equation with polynomial coefficients .
Other names, related terms and sources
Also shown as D-finite series, D-finite power series, differentiably finite power series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::lines 535–539 (mathematical_source)
d_finite_function · mathematical concept Generated from the governed public vocabulary for Plectis.
data field General or domain usage A data field is a named part of a structured record that holds a value with an expected meaning and form.
A result record might have fields for its status, timestamp, and source revision. A schema states which fields are required, what values they accept, and how absence or an empty value is interpreted. This computing meaning differs from an algebraic field or a field of study.
Fields let programs locate specific information without inferring it from free text. Their values can be numbers, strings, lists, nested records , or other allowed data. A missing field, an explicit null value, and an empty string may express different states. The site uses fields to preserve exact identifiers and checking results across generated views. Merely recording a value does not show that it is accurate, current, or supported by evidence ; those properties require their own checks .
Scope A field name identifies its role within a record or schema; the same name in another schema can have a different meaning.
Other names, related terms and sources
Also shown as data fields, record field, record fields
field · public projection Generated from the governed public vocabulary for Plectis.
database General or domain usage A database is an organized collection of data maintained so it can be accessed, queried, and updated.
A relational database organizes records in tables; document, graph , and key-value databases use other models . A database management system provides the software for storing, querying, and changing those records . Everyday computing prose often uses “database” for both the data and that running service.
A database is the organized data, managed through software often called a database management system; a dataset groups records for a particular analysis or other purpose. A query result may reflect one transaction snapshot , a replica lag, cached values, permissions , or later updates. Constraints can prevent some invalid states but cannot establish that recorded facts are true. Replication improves availability yet introduces consistency choices. Reliable interpretation names the database instance or export, schema version, query, time, and whether the result came from live, cached , replicated, or archived state.
Scope Database behavior is defined by its data model , schema, query and update semantics, consistency, transactions , indexes , access controls, replication, and backup policy.
Other names, related terms and sources
Also shown as databases
Source refs sites/microcosm/docs/components.html (reading_context) sites/microcosm/docs/paper-module-agent-sandbox-policy-escape-replay.html (reading_context)
database · public projection Generated from the governed public vocabulary for Plectis.
dataset General or domain usage A dataset is an organized collection of observations or records intended to be considered together.
A table of measurements, labelled images, survey responses, documents, or synthetic examples can each be a dataset. Its meaning depends on what was collected, from whom, when, and how.
Datasets do not speak independently of their construction. Missing groups, duplicated records , measurement error, label ambiguity, selection bias, data leakage, later corrections, and incompatible versions can change an analysis. A dataset may be representative for one question and unsuitable for another. Synthetic data reflects assumptions of its generator rather than direct observation. Train, validation , and test partitions are roles assigned to records , not different kinds of evidence . Reproducible conclusions identify the exact version and preprocessing used.
Example A fixture dataset may contain the committed cases used by one validator test.
Scope A dataset covers the records and version included by its manifest or collection rule.
Not this Several unrelated files in one directory do not automatically form a coherent dataset.
Reader rule A dataset is characterized by its population, sampling and collection process, fields, units, labels, exclusions, version, and known transformations.
Other names, related terms and sources
Also shown as data set
Search handles datasets
dataset · public projection Generated from the governed public vocabulary for Plectis.
decidability General or domain usage A decision problem is decidable when an algorithm always terminates with the correct yes-or-no answer.
In Lean , Decidable P is a type containing either a proof of P or a proof of its negation. A computational instance can be evaluated by decide, connecting executable decisions to logically justified outcomes.
Finite certificate checks use decidable arithmetic tests . The distinction matters when a proof has a classical instance available but evaluation cannot reduce it: type-level availability and practical computation are different requirements.
Meaning scope General or domain usage. The computability meaning and Lean 's proof -bearing Decidable representation are distinguished. A classical logical decision object alone does not establish algorithmic decidability.
Scope Classical reasoning can supply a noncomputable Decidable instance. Its existence in the logic is not an executable decision algorithm for an arbitrary problem.
Other names, related terms and sources
Also shown as decidable proposition, decidable predicate, decidable problem
Source refs sites/microcosm/maths/documents/wave-index.html (local_reader_surface)
decidability · mathematical concept Generated from the governed public vocabulary for Plectis.
declaration General or domain usage A declaration introduces a named item in a programming or proof language, such as a definition, theorem , or structure.
Reader rule A declaration count combines different kinds of items and is not a count of distinct mathematical discoveries.
Other names, related terms and sources
Also shown as declarations
declaration · public projection Generated from the governed public vocabulary for Plectis.
definite integral General or domain usage A definite integral accumulates a function ’s values over a specified region using a rule for measuring that region.
For example, integrating 2x from 0 to 1 gives 1, the area under that graph over the interval. Integrals can also describe mass, averages, energy, and curve length. Signed values can cancel, so an integral need not equal the total unsigned area.
A definite integral combines the values of a function over a specified domain. The Riemann integral is built from limits of weighted sums over finer partitions and is well suited to bounded functions on finite intervals. The Lebesgue integral groups values using a measure and handles wider classes of functions and limit operations. Continuous functions on a closed bounded interval are integrable in both senses with the same value. An improper integral is a limit used for an unbounded domain or singular integrand, so convergence must be proved rather than assumed.
Example The integral of 2x from 0 to 1 equals 1.
Meaning scope General or domain usage. Avoid the bare alias integral because the manuscripts also use integral to mean integer -valued or belonging to an integer lattice .
Scope Check the integration domain, variable , and notion of integration; finite Riemann integration and Lebesgue integration agree for continuous functions on compact intervals but have different general scope .
Not this Calling a rational expression integral because it takes integer values uses integral as an adjective and does not refer to integration.
Other names, related terms and sources
Also shown as integration of a function
integral · mathematical concept Generated from the governed public vocabulary for Plectis.
definitional equality General or domain usage Definitional equality is equality recognized by a formal system's built-in computation and conversion rules.
Two expressions can be recognized as the same after evaluating a function or unfolding a definition. For example, a numerical expression such as 2 + 3 2 + 3 can reduce to 5 without a separate theorem asserting their equality .
Lean uses this relation when matching a term's type to an expected type. The local hypothesis -extraction tool promises to recover the actual binder type, avoiding a transcription that might merely look equivalent or introduce different definitions.
Meaning scope General or domain usage. The type-theoretic computation/conversion meaning is intended. Exact conversion rules are system-specific; this row does not replace Lean 's operational definition.
Scope Do not assume every mathematically equal expression is definitionally equal. A more substantial identity may require a propositional equality proof .
Other names, related terms and sources
Also shown as definitionally equal, judgmental equality, judgemental equality
Source refs sites/microcosm/maths/documents/residual-progress.html (local_reader_surface)
definitional_equality · mathematical concept Generated from the governed public vocabulary for Plectis.
degree of a polynomial General or domain usage The degree of a nonzero polynomial is the highest exponent with a nonzero coefficient .
For example, 3 𝑧 4 + 2 𝑧 − 1 3 z 4 + 2 z − 1 has degree 4, while a nonzero constant has degree 0. Over the complex numbers , a degree-n polynomial has n roots counted with multiplicity.
Degree constrains possible algebraic behaviour without determining the locations or distinctness of roots. The lemniscate papers use degree in quantitative estimates and sometimes prove results only for particular degree ranges.
Other names, related terms and sources
Also shown as polynomial degree
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 455 (mathematical_source)
polynomial_degree · mathematical concept Generated from the governed public vocabulary for Plectis.
Demo Take System-coined term Demo Take is the system's recording tool for capturing a demonstration and its accompanying material.
It brings screen recording, transcript capture, and still frames into one workflow. The resulting files can then support a prepared demonstration without reconstructing the session from separate recordings.
It is useful for explanation and review, while repeatability still depends on the source , inputs, environment , and commands behind what appears on screen.
Example The long walkthrough says it was recorded on the Demo Take Console.
Meaning scope System-coined term. Demo Take is this project's capture console for screen, transcript , and stills. It is not a general video-editing product , and not OBS itself.
Scope Landing demo-video copy.
Not this Demo Take is not YouTube, and not the public website builder.
Reader rule A recorded demonstration shows the particular run and material that were captured.
Other names, related terms and sources
Also shown as Demo Take Console
demo_take · public projection Generated from the governed public vocabulary for Plectis.
denominator General or domain usage The denominator is the divisor in a fraction : the b in 𝑎 / 𝑏 a / b , where b is nonzero.
In 3 / 4 3 / 4 , the denominator is 4. For a positive fraction interpreted as equal -sized parts, it specifies that the whole has been divided into four parts.
Number-theory arguments often require the denominator in lowest terms. For example, whether a fraction terminates in a chosen numeral base depends on the prime factors of that reduced denominator.
Example For a finite support , the reduced denominator has multiplicative order exactly the least common multiple of the support .
Scope A denominator constraint covers the value it is derived for.
Reader rule Cancelling a common factor changes the written denominator without changing the fraction 's value.
Other names, related terms and sources
Also shown as denominators
denominator · public projection Generated from the governed public vocabulary for Plectis.
dense subset General or domain usage A subset whose closure is the whole surrounding space.
The rational numbers are dense in the real line: every open interval, however short, contains a rational . They still omit most real numbers , so dense does not mean equal to the surrounding space or large by counting.
In the running-LCM paper , an irrational rotation has a dense orbit , allowing points arbitrarily close to any target location on the circle. Topological density concerns proximity, while asymptotic density concerns proportions of integers ; any connection requires specifying the set and surrounding space.
Meaning scope General or domain usage. Topology and dynamical systems. Topological density differs from asymptotic density of integers .
Scope A subset is dense when its closure is the whole space, equivalently when every nonempty open region meets it. Density depends on the surrounding topology; changing the space can change the verdict.
Other names, related terms and sources
Also shown as dense, everywhere dense
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos-269-three-prime-running-lcm.tex::line 110 (mathematical_source)
dense_subset · mathematical concept Generated from the governed public vocabulary for Plectis.
dependency General or domain usage A dependency is an object, service, fact, or earlier result that another component or conclusion requires.
A software component may depend on a library, file, service, or build step; an argument may depend on a premise or earlier theorem . The dependency identifies a necessary input, not merely a related object.
Dependencies connect work into a directed structure. In software , a package can require a particular library version, a generated file can require its source , and a service can require another service to answer. In reasoning, a conclusion depends on its premises and supporting results. Required dependencies prevent the dependent route from working when absent; optional dependencies affect only features that use them. Because changes can propagate downstream, dependency records often include versions, identities, and compatibility conditions. Cycles require special handling because no member can be prepared independently of the others.
Example The pre-install probe reports missing dependencies before any component runs.
Scope Declared dependencies cover what the project knows it needs.
Reader rule A dependency relation has a direction: the dependent item requires the upstream item, and a change or failure upstream can require downstream rebuilding, rechecking, or withdrawal.
Other names, related terms and sources
Also shown as dependencies, dependencies declared
dependency · public projection Generated from the governed public vocabulary for Plectis.
dependent type General or domain usage A dependent type is a type whose form can depend on a value, not only on another type.
For example, Fin n is the type of natural numbers below n, so changing n changes the available values. A function can likewise return a value whose type depends on its input, expressing constraints directly in its signature.
The #243 Lean source uses functions indexed by Fin k to represent finite families. Their index bounds are tracked by types, allowing proofs about every member while preventing indices outside the declared family.
Meaning scope General or domain usage. The type-theoretic meaning is intended, including value-indexed types and dependent functions . It is distinct from an ordinary software dependency between files.
Scope Read the value parameter as part of the type. An object of Fin 3 cannot simply be used as an object of Fin 2 without the required justification.
Other names, related terms and sources
Also shown as dependent types, dependent function type, dependent function types
dependent_type · mathematical concept Generated from the governed public vocabulary for Plectis.
deployment General or domain usage Deployment places a software version or configuration into an environment where it can run or serve users.
Building and testing an application creates candidate artifacts ; deploying selects one and installs or activates it in development, staging, production, or another target environment .
Deployment is distinct from committing source , merging a pull request , publishing a release , and proving that the service works correctly. A rollout may be partial, staged, paused, rolled back , or active only for selected users. Database migrations, secrets, feature flags, infrastructure, and cached assets can make two deployments of the same code behave differently. Successful deployment automation shows that its steps completed under defined checks ; health monitoring and user-visible verification establish whether the deployed system remains available and behaves as intended.
Example The public-site deploy publishes the generated Plectis files and verifies their hashes at the live host.
Scope A deployment covers the named output, destination, revision, and verification time.
Not this A local build or committed change is not a deployment.
Reader rule Deployment status identifies the artifact , target environment , configuration , rollout state, and whether traffic or users actually reach it.
Other names, related terms and sources
Also shown as deploy, live deployment
Search handles deployed
deployment · public projection Generated from the governed public vocabulary for Plectis.
derivation General or domain usage A derivation is a sequence of justified steps leading from stated starting points to a result.
In mathematics , the steps use definitions, assumptions , and valid inference rules. In the software descriptions, a derivation can instead describe how a generated object was obtained from its sources .
Keeping the starting material and steps inspectable helps locate an error or repeat the process. A final answer alone may hide the assumption or transformation on which it depends.
Example A generated page has a derivation from registry data through the deterministic site builder.
Scope The term covers proof calculations, formula transformations, and source -to-projection computation chains.
Not this A result asserted without intermediate rules or a reproducible procedure is not an inspectable derivation.
Reader rule The meaning of “justified” depends on the setting and the rules being used.
Other names, related terms and sources
Also shown as derivations, derived argument, calculation derivation
derivation · public projection Generated from the governed public vocabulary for Plectis.
derivation certificate System-coined term A derivation certificate is an inspectable record that lets a checker verify how a particular claim follows from its stated basis .
Meaning scope System-coined term. A derivation certificate is the finite checkable artifact that lets an independent checker recompute a claim from its named basis . It is not a diploma, and not a Lean proof on its own unless that is the certificate named.
Scope Doctrine operating-loop copy.
Not this A paragraph of explanation is not a derivation certificate.
Reader rule Simply recording that a process ran does not certify every conclusion drawn from it.
Other names, related terms and sources
Also shown as derivation certificates
derivation_certificate · public projection Generated from the governed public vocabulary for Plectis.
derivative General or domain usage A derivative is the linear map that approximates a function 's change to first order near a point.
For a function of one real or complex variable , the derivative at x is 𝑓 ′ ( 𝑥 ) = l i m ℎ → 0 ( 𝑓 ( 𝑥 + ℎ ) − 𝑓 ( 𝑥 ) ) / ℎ f ′ ( x ) = lim h → 0 ( f ( x + h ) − f ( x ) ) / h when this limit exists. For 𝑓 ( 𝑥 ) = 𝑥 2 f ( x ) = x 2 , expanding the quotient gives 𝑓 ′ ( 𝑥 ) = 2 𝑥 f ′ ( x ) = 2 x . In several variables , the derivative acts on a direction of movement to give the corresponding first-order change.
Polynomial critical points satisfy 𝑓 ′ ( 𝑐 ) = 0 f ′ ( c ) = 0 , and the Newton vector field uses the quotient − 𝑓 / 𝑓 ′ − f / f ′ .
Scope The approximation error must become negligible compared with the size of the input change. For complex functions , the difference quotient must approach the same limit from every complex direction.
Other names, related terms and sources
Also shown as derivatives, differentiate, differentiation
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 698 (mathematical_source)
derivative · mathematical concept Generated from the governed public vocabulary for Plectis.
Desnanot–Jacobi identity General or domain usage A determinant identity relating a square matrix to minors obtained by removing one or two rows and columns.
For an 𝑛 × 𝑛 n × n matrix M, 𝑛 ≥ 2 n ≥ 2 , let 𝐷 𝑗 𝑖 D i j denote its determinant after deleting row i and column j, and 𝐷 𝑗 , 𝑙 𝑖 , 𝑘 D i , k j , l after deleting both pairs. For 𝑖 < 𝑘 i < k and 𝑗 < 𝑙 j < l , d e t ( 𝑀 ) 𝐷 𝑗 , 𝑙 𝑖 , 𝑘 = 𝐷 𝑗 𝑖 𝐷 𝑙 𝑘 − 𝐷 𝑙 𝑖 𝐷 𝑗 𝑘 det ( M ) D i , k j , l = D i j D k l − D i l D k j . The empty determinant is one.
The #1049 coefficient Hankel determinants are computed recursively using this identity and exact polynomial division. It connects neighbouring ranks and shifts, providing an algebraic computation method without by itself proving every resulting determinant positive.
Meaning scope General or domain usage. This row is the algebraic identity, not an unconditional permission to divide by a possibly zero minor.
Scope The multiplicative identity holds even when a minor vanishes. Turning it into a recurrence by division requires a nonzero divisor minor, or an exact polynomial -divisibility argument; otherwise the divided expression is not justified.
Other names, related terms and sources
Also shown as Desnanot-Jacobi identity, Dodgson determinant identity
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2797 (mathematical_source)
desnanot_jacobi_identity · mathematical concept Generated from the governed public vocabulary for Plectis.
determinant General or domain usage A determinant is a scalar computed from a square matrix ; over a field, it is nonzero exactly when the matrix is invertible.
Meaning scope General or domain usage. Finite -dimensional linear algebra. Not a probability 'determinant' or causal determining factor .
Scope A zero determinant signals dependence or collapse, but its numerical size depends on coordinate scaling.
Other names, related terms and sources
Also shown as det
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 136 (mathematical_source)
determinant · mathematical concept Generated from the governed public vocabulary for Plectis.
deterministic General or domain usage A deterministic process produces the same output whenever all relevant inputs and operating conditions are the same.
Determinism rules out unresolved random choice for a fixed execution state. Reproducibility still depends on treating versions, ordering, clocks, external responses, and configuration as inputs when they can affect the result.
A deterministic algorithm maps each complete input state to one result. Running it twice with truly identical inputs therefore gives identical output. Apparent exceptions often come from hidden inputs: system time, directory order, concurrent scheduling, floating-point platform details, network responses, tool versions, or an unrecorded random seed. Determinism does not establish correctness, speed, or real-world validity; a consistently wrong calculation is still deterministic. It also differs from reproducibility , which asks whether another execution environment can reconstruct the conditions closely enough to obtain the recorded result.
Example Generating the glossary twice from the same registry and builder revision should produce byte-identical output.
Scope Deterministic applies to the named process under its declared inputs, versions, and environment .
Not this A process is not deterministic merely because two observed runs happened to agree.
Reader rule The same specified input and environment determine one output; any random seed, time value, scheduling order, or external response that affects execution belongs among those conditions.
Other names, related terms and sources
Also shown as repeatable output
Search handles determinism
deterministic · public projection Generated from the governed public vocabulary for Plectis.
Diebold-Mariano test General or domain usage The Diebold–Mariano test assesses whether two forecasting methods have equal expected loss under a chosen measure of error.
It compares the loss differences between paired forecasts and accounts for time dependence through an estimate of their long-run variance. Squared error and absolute error can lead to different comparisons.
The test addresses average predictive loss in the analysed setting. Statistical significance neither identifies the cause of a difference nor guarantees that the better-performing method will remain better on future data.
Example Two forecasts of the same series can be compared by the size of their squared errors.
Scope Named for Francis Diebold and Roberto Mariano; the test is standard in forecast evaluation and is not a contribution of this work.
Reader rule Interpret the result under the test's sampling and dependence assumptions .
Other names, related terms and sources
Also shown as diebold-mariano, diebold mariano
diebold_mariano_test · public projection Generated from the governed public vocabulary for Plectis.
differentiable function General or domain usage A function with a linear first-order approximation at each point under discussion.
The derivative gives a linear approximation whose error becomes negligible compared with the change in input. Squaring is differentiable everywhere on the reals ; absolute value is continuous at zero but has no derivative there because its two one-sided slopes disagree.
For a real function of one variable , differentiability at x means that the difference quotient approaches a finite limit . In several real variables , differentiability means there is a linear map that approximates the increment with an error small compared with the increment's size. For a curve 𝑧 ( 𝑡 ) z ( t ) , its derivative is its instantaneous velocity. For complex functions , the same quotient must have one limit independent of the direction of approach; differentiability on an open set then leads to holomorphicity. Differentiability implies continuity at the point, but continuity alone does not imply differentiability.
Example The trajectory assumption 𝑧 ′ ( 𝑡 ) = 𝑁 ( 𝑧 ( 𝑡 ) ) z ′ ( t ) = N ( z ( t ) ) in the Newton-flow paper requires z to be differentiable in the time parameter.
Meaning scope General or domain usage. This entry concerns mathematical differentiability, not whether two data records can be distinguished.
Scope In several variables use the full linear approximation, not merely the existence of all partial derivatives ; in complex analysis complex differentiability is substantially stronger than real differentiability.
Not this Having directional or coordinate partial derivatives alone does not guarantee differentiability in several variables .
Other names, related terms and sources
Also shown as differentiable, differentiability
differentiable_function · mathematical concept Generated from the governed public vocabulary for Plectis.
digest General or domain usage A cryptographic digest is a fixed-size value computed from data, used to detect whether the data has changed.
The same bytes produce the same digest under the same algorithm . Plectis uses hashes to connect generated material and result records to particular file contents.
Different inputs can theoretically share a digest, so it is not a mathematical guarantee of identical bytes. A digest also says nothing about the truth or quality of the contents.
Example The deploy verifies the live stylesheet's digest before reporting success.
Scope A digest establishes byte identity between two copies.
Reader rule A mismatch proves the contents differ; a matching secure hash provides strong practical evidence of equality .
Other names, related terms and sources
Also shown as checksum
Search handles hash
digest · public projection Generated from the governed public vocabulary for Plectis.
digestion Externally anchored Mathematical digestion is the process of understanding a result well enough to place it in the field and use it in further work.
It includes identifying the main idea, checking how the hypotheses matter, connecting the result to earlier work, and finding useful applications or reformulations . The site's discussion follows the distinction between verifying a proof and making its mathematics usable.
Clear explanations, failed approaches , and precise open questions help other mathematicians assess and continue the work. Community uptake cannot be awarded by a repository 's own checks .
Example A reader who can explain the main argument, identify its limitations, and apply the result to a new question has understood more than whether a formal proof passes its checker .
Meaning scope Externally anchored. The staged meaning of digestion used here is Terence Tao's, from Mathematics in the age of AI (arXiv:2608.16753). This site does not own or redefine that stage; it only says how it tries to help authors assist it. Community digestion and acceptance remain external.
Scope The word is Tao's. The local use is: keep the record that would help a mathematician digest the work. The local use is not: declare the work digested.
Not this A long formally verified proof with no account of the hard step, the false starts, or what remains open is not digestion, however correct it is.
Reader rule A checked proof and a published paper can support this process without completing it.
Other names, related terms and sources
Also shown as community digestion
Search handles mathematical digestion
digestion · public projection Generated from the governed public vocabulary for Plectis.
dimension General or domain usage A vector space has dimension equal to the size of a basis ; geometric notions such as Hausdorff dimension use different definitions.
The ordinary plane has vector-space dimension two because every vector has a unique expression using two independent coordinate directions. A line through the origin has dimension one, while a space of all infinite sequences can be infinite -dimensional.
The arithmetic-function papers prove large or infinite linear dimension using evaluation matrices and independent channel families. Geometric notions such as Hausdorff dimension answer a different covering-scale question, so the qualifying word determines which definition applies.
Meaning scope General or domain usage. Linear algebra. Distinct from geometric fractal dimension or software array dimensions.
Scope Linear dimension is the size of a basis over a specified scalar field. Showing independent families of every finite size proves infinite -dimensionality. It does not mean each individual vector has infinitely many geometric directions.
Other names, related terms and sources
Also shown as linear dimension, vector-space dimension
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 167 (mathematical_source)
dimension · mathematical concept Generated from the governed public vocabulary for Plectis.
dirichlet convolution General or domain usage The arithmetic-function product ( 𝑓 ∗ 𝑔 ) ( 𝑛 ) = ∑ 𝑑 ∣ 𝑛 𝑓 ( 𝑑 ) 𝑔 ( 𝑛 / 𝑑 ) ( f ∗ g ) ( n ) = ∑ d ∣ n f ( d ) g ( n / d ) .
Meaning scope General or domain usage. Arithmetic functions . The manuscript may say divisor transform without naming convolution.
Scope The summation runs over divisors d of n and pairs each with 𝑛 / 𝑑 n / d . This is not ordinary additive convolution, which sums over decompositions such as 𝑎 + 𝑏 = 𝑛 a + b = n . The identity element is 1 at 𝑛 = 1 n = 1 and 0 elsewhere.
Other names, related terms and sources
Also shown as divisor convolution
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 110 (mathematical_source)
dirichlet_convolution · mathematical concept Generated from the governed public vocabulary for Plectis.
Dirichlet energy General or domain usage The Dirichlet energy of a sufficiently regular function u on a region is the integral of | ∇ 𝑢 | 2 | ∇ u | 2 ; for complex maps it measures the total squared stretching.
Meaning scope General or domain usage. Finite Dirichlet energy bounds an integral of squared derivatives . It does not by itself bound the derivative at each point.
Scope The normalization and whether u is real-, vector-, or complex-valued must be stated. Finite energy is an averaged square-derivative condition; it does not by itself bound the derivative at every point.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 143 (mathematical_source)
dirichlet_energy · mathematical concept Generated from the governed public vocabulary for Plectis.
dirichlet's theorem on primes in arithmetic progressions General or domain usage Dirichlet’s theorem says that every residue class a modulo a positive integer q with g c d ( 𝑎 , 𝑞 ) = 1 gcd ( a , q ) = 1 contains infinitely many primes .
Dirichlet’s theorem guarantees infinitely many primes in every arithmetic progression 𝑎 , 𝑎 + 𝑞 , 𝑎 + 2 𝑞 , … a , a + q , a + 2 q , … when a and q are coprime . Thus both 1,5,9,… and 3,7,11,… contain infinitely many primes for modulus 4.
The totient construction uses this theorem to choose primes in engineered residue classes , making selected matrix entries nonzero while other entries gain prescribed factors . It is distinct from Dirichlet convolution and from other results bearing Dirichlet’s name.
Other names, related terms and sources
Also shown as Dirichlet's theorem, primes in arithmetic progressions
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 1698 (mathematical_source)
dirichlet_theorem_arithmetic_progressions · mathematical concept Generated from the governed public vocabulary for Plectis.
discrete additive convolution General or domain usage The additive convolution of two sequences combines pairs of terms whose indices add to the output index .
Other names, related terms and sources
Also shown as discrete convolution, additive convolution of sequences
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 416 (mathematical_source)
discrete_convolution · mathematical concept Generated from the governed public vocabulary for Plectis.
discrete mathematics General or domain usage Discrete mathematics studies objects with separate elements, such as integers , graphs , and finite arrangements.
Scope Discrete mathematics covers the discrete objects and relations named by the problem or theory.
Not this A problem about a continuously varying physical field is not discrete merely because a computer samples it.
Reader rule The relevant structure is determined by the definitions of the problem.
Other names, related terms and sources
Also shown as discrete math
Search handles discrete structures
discrete_mathematics · subject Generated from the governed public vocabulary for Plectis.
discriminant General or domain usage A discriminant detects repeated roots or arithmetic degeneracy: a polynomial ’s discriminant vanishes exactly when it has a repeated root , while a number field ’s discriminant records how its integral arithmetic behaves modulo primes .
Meaning scope General or domain usage. Polynomial and number-field discriminants are related but distinct. The discriminant of an order or chosen basis can differ from the field discriminant.
Scope Polynomial and number-field discriminants are related but are not identical objects. Their values depend on conventions and, for an order or basis discriminant, on the chosen integral data. Always identify which discriminant is meant.
Other names, related terms and sources
Also shown as field discriminant, polynomial discriminant
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 285 (mathematical_source)
discriminant · mathematical concept Generated from the governed public vocabulary for Plectis.
disjoint sets General or domain usage Two sets are disjoint when they have no common element, equivalently when their intersection is empty.
A family is pairwise disjoint if every two distinct members are disjoint. This is stronger than saying that the intersection of all members is empty: several sets can overlap in pairs while sharing no single element collectively.
The #257 constructions use disjoint sets of prime coordinates and disjoint events within a fixed parent group. Each kind of separation supports a different counting or probability step, so the set family being compared must be identified.
Meaning scope General or domain usage. The set-theoretic meaning is intended, including pairwise disjoint families. It does not mean probabilistic independence, noninteraction between systems, or merely distinct set names.
Scope Distinguish disjointness from independence. Probability masses add for disjoint events, while independence concerns products of probabilities for intersections.
Other names, related terms and sources
Also shown as disjoint set, pairwise disjoint sets, disjoint subsets
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
disjoint_sets · mathematical concept Generated from the governed public vocabulary for Plectis.
distance General or domain usage A distance assigns zero to identical points, positive values to distinct points, and obeys symmetry and the triangle inequality .
On the real line, the distance from x to y is | 𝑥 − 𝑦 | | x − y | ; in the complex plane the same formula gives Euclidean distance. A valid distance is nonnegative, symmetric, and zero exactly when its two points coincide.
The lemniscate paper compares Euclidean separation, path length, and hyperbolic distance when selecting root connections. Two metrics can rank or scale pairs differently even on the same set; numerical bounds cannot be transferred without a proved comparison.
Meaning scope General or domain usage. Metric geometry. A manuscript may specify a non-Euclidean metric .
Scope Distances obey 𝑑 ( 𝑥 , 𝑧 ) ≤ 𝑑 ( 𝑥 , 𝑦 ) + 𝑑 ( 𝑦 , 𝑧 ) d ( x , z ) ≤ d ( x , y ) + d ( y , z ) : traveling through y cannot beat the direct distance. A problem may use a different metric , such as hyperbolic distance , so always identify which distance is intended.
Other names, related terms and sources
Also shown as metric distance
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 192 (mathematical_source)
distance · mathematical concept Generated from the governed public vocabulary for Plectis.
divergence General or domain usage A sequence or series diverges when it does not converge in the sense being considered.
Reader rule Individual terms tending to zero do not ensure that their sum converges .
Other names, related terms and sources
Also shown as divergent behavior
Search handles diverges, divergent, divergent series
divergence · mathematical concept Generated from the governed public vocabulary for Plectis.
divisibility General or domain usage Divisibility is the relation in which one integer is an exact integer multiple of another.
The notation 𝑎 ∣ 𝑏 a ∣ b means that 𝑏 = 𝑎 𝑘 b = a k for some integer k. For example, 3 divides 12 because 1 2 = 3 ⋅ 4 12 = 3 ⋅ 4 , while 5 does not divide 12.
With this algebraic definition, every integer divides zero and zero divides only zero. The papers often impose positivity to exclude such cases, then use divisibility to track denominator cancellation, congruences , and prime factors .
Scope The direction matters: 𝑎 ∣ 𝑏 a ∣ b does not generally imply 𝑏 ∣ 𝑎 b ∣ a .
Other names, related terms and sources
Also shown as divides, divisor relation
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 306 (mathematical_source)
divisibility · mathematical concept Generated from the governed public vocabulary for Plectis.
divisor General or domain usage An integer d is a divisor of an integer n when 𝑛 = 𝑑 ⋅ 𝑘 n = d ⋅ k for some integer k.
For example, 3 divides 12 because 1 2 = 3 ⋅ 4 12 = 3 ⋅ 4 . Number-theory statements usually specify positive divisors, while the divisibility relation itself can also involve negative integers or zero.
A divisor is an exact factor , so there is no remainder. With the stated algebraic definition, every integer divides zero, and zero divides only zero; additional positivity hypotheses often exclude these edge cases.
Example 3 is a divisor of 12 because 1 2 = 3 × 4 12 = 3 × 4 .
Reader rule The notation 𝑑 ∣ 𝑛 d ∣ n means “d divides n”.
Other names, related terms and sources
Also shown as factor of an integer
Search handles divisors
divisor · mathematical concept Generated from the governed public vocabulary for Plectis.
divisor transform General or domain usage The divisor transform sends an arithmetic function a to 𝑏 ( 𝑛 ) = ∑ 𝑑 ∣ 𝑛 𝑎 ( 𝑑 ) b ( n ) = ∑ d ∣ n a ( d ) , summing its values over every positive divisor of n.
If a is the indicator of a selected set, then 𝑏 ( 𝑛 ) b ( n ) counts selected divisors of n. Möbius inversion recovers a from b by 𝑎 ( 𝑛 ) = ∑ 𝑑 ∣ 𝑛 𝜇 ( 𝑑 ) 𝑏 ( 𝑛 / 𝑑 ) a ( n ) = ∑ d ∣ n μ ( d ) b ( n / d ) .
The paper transforms one Boolean selector into its coefficient sequence . This lets inclusion choices be encoded by divisor arithmetic and later recovered through Möbius inversion.
Example If a is the indicator of a selected set, then 𝑏 ( 𝑛 ) b ( n ) counts selected divisors of n.
Meaning scope General or domain usage. The convention used here sums an arithmetic function over the positive divisors of n. Other normalizations need their own formula.
Scope Some authors use “divisor transform” for closely related normalizations, so the displayed formula should accompany the name. The sum is finite for every positive integer n and concerns divisors , not a Fourier transform.
Other names, related terms and sources
Also shown as divisor-sum transform
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 110 (mathematical_source)
divisor_transform · mathematical concept Generated from the governed public vocabulary for Plectis.
divisor-counting function General or domain usage The divisor-counting function 𝜏 ( 𝑛 ) τ ( n ) , also written 𝑑 ( 𝑛 ) d ( n ) , counts the positive divisors of a positive integer n.
Other names, related terms and sources
Also shown as divisor function, number-of-divisors function, divisor-counting function τ
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::eq:incidence (mathematical_source)
divisor_function · mathematical concept Generated from the governed public vocabulary for Plectis.
doctrine System-local specialization In Plectis, doctrine is the organised set of ideas and rules explaining how the system is intended to work.
curated system meaning layer
Meaning scope System-local specialization. Doctrine names this repository 's curated principle -concept -mechanism layer. It is not religious, legal, military, or generally authoritative doctrine outside the system.
Scope Doctrine covers the explicit-meaning layer of the system and is encountered on the Doctrine page and its individual cards, with cross-references reaching into components , paper modules , and the standards they enforce.
Not this Doctrine is not the source code or the running machinery, and it is not a binding guarantee that the system behaves as described. It is the recorded set of principles and ideas the system is meant to follow, which the components and checks are responsible for actually enforcing.
Reader rule A doctrine statement expresses a rule or interpretation; implementation evidence shows whether it is enacted.
Other names, related terms and sources
Also shown as doctrine layer, principles concepts mechanisms, curated meaning
Source refs doctrine module system_constitution_seed (paper_module)
doctrine · doctrine Generated from the governed public vocabulary for Plectis.
Document Object Model General or domain usage The Document Object Model, or DOM, represents a document as a tree of objects and provides an interface for reading and changing it.
In a browser , DOM nodes represent a document’s elements and text, with attributes describing the elements. JavaScript can inspect or change this structure. The DOM interface can also be implemented outside browsers ; it is distinct from the HTML text stored in a source file .
When a browser parses HTML, it creates nodes linked by parent, child, and sibling relationships. Scripts use standard DOM methods to find nodes, attach event listeners , change attributes, and insert controls. Plectis glossary code adds preview controls through this interface while preserving mathematical child nodes. The DOM may differ from downloaded source after scripts run or the browser repairs malformed markup.
Example A script sets aria-describedby on the focused term element in the DOM.
Meaning scope General or domain usage. The DOM represents documents through nodes and operations on them. It can be implemented outside browsers and is distinct from an arbitrary tree-shaped data object.
Scope A DOM change affects the current loaded document; it does not necessarily alter the HTML source file or server copy.
Not this A JSON object graph is not the Document Object Model merely because it forms a tree.
Other names, related terms and sources
Also shown as DOM, document tree
Source refs sites/microcosm/index.html (prerequisite_context)
dom · public projection Generated from the governed public vocabulary for Plectis.
DOI Externally anchored A DOI is a persistent identifier for an object such as a paper , dataset , or software release .
It resolves through the DOI system to information maintained by the registering organisation. That destination can be updated when the object's web location changes, allowing the identifier to remain stable.
When citing work, use the DOI for the intended object or version. Different versions and related artifacts may have separate identifiers or explicit relationships in their metadata .
Example A journal article's DOI resolves to the publisher's page.
Scope DOIs are administered by registration agencies under the International DOI Foundation, external to this work.
Reader rule A DOI identifies material; it does not certify correctness, peer review , or permanence of access.
Other names, related terms and sources
Also shown as digital object identifier
doi · public projection Generated from the governed public vocabulary for Plectis.
domain expert General or domain usage A domain expert is someone with substantial knowledge and judgement in a particular field.
For this project, relevant expertise may concern number theory , proof assistants , statistics, software architecture , or another subject addressed by a component . The useful expertise depends on the claim being examined.
An expert can help by assessing significance, detecting a missing assumption , relating a result to prior work, or explaining what would make the work easier for the field to use.
Example The hero names domain experts among the people the work is published for.
Meaning scope General or domain usage. A domain expert here is someone whose specialised field judgement the work still needs, whether or not they are a professional mathematician .
Scope Landing audience copy.
Not this Domain expert is not a substitute for a check result .
Reader rule Expertise in one area does not automatically settle questions in another.
Other names, related terms and sources
Also shown as domain experts
domain_expert · public projection Generated from the governed public vocabulary for Plectis.
dominant singularity General or domain usage A singularity nearest the expansion centre, which can determine the leading growth of power-series coefficients .
Meaning scope General or domain usage. Dominance is relative to the expansion centre and all singularities of equal modulus ; the paper uses a proved isolated-pole decomposition.
Scope Other singularities at the same distance can contribute oscillations or cancellations. The local singular shape and a justified analytic remainder are needed for coefficient estimates; identifying one pole is not enough when competing singularities have not been excluded.
Other names, related terms and sources
Also shown as nearest singularity of a generating function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2230 (mathematical_source)
dominant_singularity · mathematical concept Generated from the governed public vocabulary for Plectis.
dominated convergence theorem General or domain usage Dominated convergence permits passing a limit through an integral when one integrable bound controls the whole convergent family.
For measurable real or complex 𝑓 𝑛 f n converging almost everywhere to f, if | 𝑓 𝑛 | ≤ 𝑔 | f n | ≤ g for every n with ∫ 𝑔 ∫ g finite , then f is integrable and ∫ 𝑓 𝑛 → ∫ 𝑓 ∫ f n → ∫ f . The bound g must be common to all n.
The #1049 paper applies the sum version to partition contributions . Each fixed partition has a limiting contribution , but partitions of unbounded size must still be controlled. The proof supplies one summable majorant independent of N before identifying the limit of the full determinant expansion.
Scope Pointwise convergence alone is insufficient. For countable sums, the analogous sufficient bound is | 𝑎 𝑛 ( 𝑘 ) | ≤ 𝑔 ( 𝑘 ) | a n ( k ) | ≤ g ( k ) with ∑ 𝑘 𝑔 ( 𝑘 ) < ∞ ∑ k g ( k ) < ∞ ; then limit and sum can be interchanged.
Other names, related terms and sources
Also shown as dominated convergence, Lebesgue dominated convergence theorem
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::sec:geometric-moments (mathematical_source)
dominated_convergence_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
drift System-local specialization Drift is a mismatch that develops between things expected to agree, such as a generated page and its source .
A source can change while a copied count, summary, or diagram continues to describe an older state. Plectis uses comparisons and refresh records to detect this kind of disagreement.
A drift report locates a mismatch; deciding which side needs correction requires knowing the authoritative source . Regenerating a page helps only if its builder is using the right inputs.
Example The import-drift area collects components that check whether copied bodies still match the source they were taken from.
Meaning scope System-local specialization. Drift is divergence between a generated projection and the source authority that owns its claim ; it does not mean every gradual change, model drift, or ordinary project evolution.
Scope Drift detection covers the surfaces a build actually regenerates. Anything outside that set can be stale without being noticed.
Reader rule Identify the two objects, their versions, and the relationship being checked .
Other names, related terms and sources
Also shown as drifted, drifts
Source refs src/microcosm_core/engine_room/generated_projection_drift_gate.py (source_authority) standards/std_microcosm_engine_room_generated_projection_drift_gate.json (source_authority)
drift · public projection Generated from the governed public vocabulary for Plectis.
drilldown General or domain usage A drilldown opens a more detailed view of something shown in a summary.
For example, a component count can lead to the component list, then to one component 's source and recorded checks . Each step narrows the question and exposes more evidence .
Plectis uses these routes to make a large system readable in stages. A summary remains useful when readers can recover the detail that was deliberately left out.
Example Selecting a paper -module card and opening its source view is a drilldown.
Meaning scope General or domain usage. A drilldown opens greater depth for the same identified object and should preserve its source route; an arbitrary related link is navigation , not a drilldown.
Scope The term covers links and commands that open a selected row, component , module , or evidence record in greater detail.
Not this A link to an unrelated page is navigation , not a drilldown into the selected subject.
Reader rule The detailed view should preserve the identity of the item selected in the summary.
Other names, related terms and sources
Also shown as drill-down, drill down, detail route
Source refs doctrine module navigation_hologram_theory (source_authority) runtime module standard_option_surface (source_authority)
drilldown · public projection Generated from the governed public vocabulary for Plectis.
dyadic General or domain usage Dyadic means related to powers of two, often fractions or intervals built from them.
A dyadic rational has the form 𝑚 / 2 𝑛 m / 2 n for integers m and nonnegative n. Examples include 1 / 2 1 / 2 , 3 / 8 3 / 8 , and 5; each has a terminating binary expansion .
Dyadic scales are useful when repeatedly halving a range or relating binary digits to arithmetic. They provide a common structure for estimates, subdivisions, and expansions in base two.
Example Erdős #251 concerns a dyadic series built from prime gaps .
Scope A dyadic result covers base two unless it says otherwise.
Reader rule The exact object follows the noun: a dyadic interval or partition is not itself a number.
Other names, related terms and sources
Also shown as binary series
dyadic · public projection Generated from the governed public vocabulary for Plectis.
dyadic section General or domain usage A dyadic section of a sequence 𝑎 ( 𝑛 ) a ( n ) is a subsequence 𝑎 ( 2 𝑒 𝑛 + 𝑟 ) a ( 2 e n + r ) obtained by fixing the index modulo a power of two.
At level one, the two sections are the even and odd terms. At level two, there are four sections indexed by residues 0,1,2,3 modulo 4.
The paper studies ranks of the totient sequence ’s sections through each finite level and then the full dyadic kernel .
Example At level one, the two sections are the even and odd terms.
Meaning scope General or domain usage. A dyadic section selects an entire subsequence at one residue class modulo a power of two, rather than a finite block of terms.
Scope The level e and residue r are part of the section, with 0 ≤ 𝑟 < 2 𝑒 0 ≤ r < 2 e . A section is a subsequence , not a finite block. All dyadic sections together form the 2-kernel .
Other names, related terms and sources
Also shown as binary section, 2-section
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 34 (mathematical_source)
dyadic_section · mathematical concept Generated from the governed public vocabulary for Plectis.
dynamical recurrence General or domain usage Return of a trajectory arbitrarily close to its starting point at arbitrarily large future times.
For a flow 𝜑 𝑡 φ t , a point x is forward recurrent when every neighbourhood U of x is entered by 𝜑 𝑡 ( 𝑥 ) φ t ( x ) for arbitrarily large 𝑡 > 0 t > 0 . For an iterated map the times are positive integers . Periodic points are recurrent, but a recurrent orbit need not repeat exactly.
The #269 logarithmic flow has arbitrarily late returns close to phase zero. Those returns let a long initial crossing word remain unchanged while a later pair is interchanged. The proof derives the needed returns from compact torus structure rather than assuming a quantitative return schedule.
Other names, related terms and sources
Also shown as forward recurrent point, recurrence of a flow
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::line 798 (mathematical_source)
dynamical_recurrence · mathematical concept Generated from the governed public vocabulary for Plectis.
E
elaboration General or domain usage In a formal language, elaboration translates convenient source syntax into a more explicit core representation.
The elaborator resolves names, infers omitted arguments, handles overloaded notation, and can insert conversions. In Lean it also runs tactic code to construct terms. These tasks precede checking those terms against the core logical rules.
The local hypOf% elaborator extracts a named hypothesis from a theorem 's stored type rather than transcribing printed prose. Its output still needs the appropriate context and kernel checks ; successful elaboration alone is not an axiom audit .
Meaning scope General or domain usage. The compiler and proof -assistant meaning is intended. Lean 's concrete elaboration stages are distinct from kernel checking and compilation to executable code.
Scope Distinguish a failure to infer the intended expression from rejection of a fully specified core term. Both can block a build for different reasons.
Other names, related terms and sources
Also shown as term elaboration, Lean elaboration, elaborator
Search handles term elaborator
Source refs sites/microcosm/maths/documents/residual-progress.html (local_reader_surface)
elaboration · proof infrastructure Generated from the governed public vocabulary for Plectis.
empirical distribution General or domain usage An empirical distribution puts equal weight on each observation in a finite sample, adding weights when values repeat.
For observations 1,1,3, the empirical distribution places probability 2 / 3 2 / 3 on 1 and 1 / 3 1 / 3 on 3. Each observation receives equal weight before repeated values are combined, so the distribution summarizes observed frequencies.
The prime -gap countermodels preserve the empirical behavior detected by bounded short-block tests while altering the arithmetic conclusion of interest. This shows why matching many statistics can still fail to preserve denominator or irrationality structure.
Meaning scope General or domain usage. Probability and asymptotic statistics. Evidence from data, not necessarily a theoretical probability law .
Scope An empirical distribution comes from a finite sample. A limiting empirical distribution says these frequencies converge as sample size grows; it does not imply that observations are independent, random, or generated by that limiting law.
Other names, related terms and sources
Also shown as empirical measure, observed distribution
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 145 (mathematical_source)
empirical_distribution · mathematical concept Generated from the governed public vocabulary for Plectis.
endogenous General or domain usage Endogenous means originating within the system or process being discussed.
An internal score, feedback signal, or judgement may be endogenous if the process being assessed also produces it. The term always depends on where the system boundary is drawn.
In the site's research discussion, the concern is self-confirmation: repeated agreement among connected internal checks may provide less independent support than the number of agreeing outputs suggests.
Example A model prompted by the author to declare the work important is still endogenous.
Scope Describes the source of a process or judgement. It does not mean false.
Not this A named outsider reading a problem page and reporting a mistake is not endogenous to that loop.
Reader rule An internally produced measure can still be informative, but its dependencies matter.
Other names, related terms and sources
Also shown as endogenously
endogenous · public projection Generated from the governed public vocabulary for Plectis.
endpoint General or domain usage An endpoint is a defined end of a connection, process, path, or investigation; its exact meaning depends on context.
In networking, an endpoint is an addressable end of a communication channel; an API endpoint commonly combines a request method with a URL . In a graph , an edge joins endpoint vertices. In research, the word can name the result an argument is trying to reach.
These uses share the idea of an identified end or boundary, but their conditions differ. A network endpoint needs an address or interface , a graph endpoint is a vertex, and a research endpoint is a target statement. Plectis mathematics pages distinguish intermediate mechanisms from a proof of the target theorem . Reaching a useful intermediate result does not by itself establish that endpoint.
Example “No endpoint proof ” means the work has not proved the final target claim .
Meaning scope General or domain usage. A network endpoint, graph endpoint, and research endpoint have different requirements. Their shared idea of an identified end does not make evidence transferable between these senses.
Scope The surrounding field determines whether the end is an address, a vertex, or a target result. Evidence for one of these senses does not establish another.
Not this A useful intermediate lemma is not the endpoint merely because it advances the investigation.
Other names, related terms and sources
Also shown as endpoints, API endpoint, research endpoint
Source refs sites/microcosm/docs/paper-module-doctrine-fact-claim-audit.html (reading_context)
endpoint · public projection Generated from the governed public vocabulary for Plectis.
engine room System-local specialization “Engine room” is the site's informal label for components that operate and maintain the system itself.
Meaning scope System-local specialization. Engine room names Plectis components that inspect or maintain the system’s own operation; it is not a generic backend , the whole private system, or a claim of autonomous operation.
Scope Engine-room components establish behaviour of the machinery on the inputs they ship. They imply nothing about whole-system correctness .
Reader rule The label groups a function within the architecture rather than naming a separate product .
Other names, related terms and sources
Also shown as engine rooms
Source refs src/microcosm_core/engine_room/__init__.py (source_authority) core/organ_families.json (source_authority)
engine_room · public projection Generated from the governed public vocabulary for Plectis.
entry System-local specialization In the navigation descriptions, an entry is either a starting route or an individual item in a collection.
A command described as an entry route helps a reader choose the next relevant action. A glossary or catalog entry instead refers to one stored item with its own identity and detail.
Plectis tries to make entry routes short enough for first contact while preserving links to the sources needed for the task. An entry should orient the reader before asking them to load deeper context.
Example kernel.py --entry <task> is a system entry because it turns a task into a bounded route; the glossary row for paper is a collection entry because it identifies one term and opens its richer definition.
Meaning scope System-local specialization. Entry has two governed local uses: a selectable item in a collection and a supported first-contact route into the system; an arbitrary file or link is not an entry merely because it can be opened.
Scope The term covers governed collection rows and documented first-contact surfaces, including glossary entries, option rows , and the task-conditioned kernel entry. It does not make every index item, URL , or executable an entrypoint.
Not this An arbitrary file is not an entry point unless the system presents it as a supported start.
Reader rule The surrounding noun distinguishes these two common uses.
Other names, related terms and sources
Also shown as entries, entry point, entrypoint
Source refs doctrine module kernel_entry_paths (source_authority) standard std_agent_entry_surface (source_authority)
entry · public projection Generated from the governed public vocabulary for Plectis.
environment General or domain usage An environment is the surrounding technical, physical, and procedural conditions under which work runs or an observation is made.
In computing, an environment includes software , hardware, configuration , permissions , files, and services. In experimental work it also includes apparatus, physical conditions, sampling setting, and procedure. These surrounding conditions can change results even when the central instructions or source remain the same.
Environment means the surrounding conditions under which an activity occurs, not only software configuration . For computation it can include operating system, hardware, runtime , libraries, variables , locale, clock, network, permissions , files, and external services. For experiments it also includes apparatus, physical conditions, sampling setting, and procedural controls. Build and runtime environments may differ. When results change, hidden environmental differences are plausible inputs rather than mere noise. Reproducibility requires recording the conditions capable of affecting the outcome at the precision relevant to the claim .
Example A cold-clone check records the operating system and Lean toolchain used to build the public proof corpus .
Scope The technical, physical, and procedural conditions relevant to an execution or observation.
Not this The central source code or experimental instruction alone need not describe every surrounding condition that affects the outcome.
Reader rule A result should identify the environmental conditions capable of affecting it, at the level of detail needed for reproduction or comparison.
Other names, related terms and sources
Also shown as execution environment, runtime environment
Search handles local environment
environment · public projection Generated from the governed public vocabulary for Plectis.
epistemic control plane System-coined term The epistemic control plane is a proposed system layer that uses evidence and uncertainty to govern which actions may proceed.
belief-bound action control
“Epistemic” concerns what is known and how it is justified. The design connects a claim 's evidence status to permitted actions, review requirements, and conditions that should stop a change.
Its central idea is that changed evidence should change decisions. Recording uncertainty is useful only when the actions that depend on it respond appropriately.
Example The Workingness Instrument , written up as a paper module and a candidate standard , is the concrete artifact this term points at: the authored design that an epistemic control plane would one day run as live machinery. See it live: How it fits together (architecture map) see where this runtime layer would sit in the system
Meaning scope System-coined term. The epistemic control plane governs how evidence changes belief and permitted action; it is not an infrastructure control plane, a knowledge base, or a source of truth by itself.
Scope The term covers the runtime layer that would govern action by belief status across the system; a reader meets it in architecture and runtime descriptions and as the forward-looking name for the Workingness Instrument .
Not this An epistemic control plane is not an already-running gate that currently decides every action, and it is not a general phrase for the system's overall safety. It is one specific, still-to-be-built layer that would link belief status to permitted action.
Reader rule The phrase names a design target associated with the Workingness Instrument ; the relevant implementation evidence must be checked separately.
Other names, related terms and sources
Also shown as epistemic_control_plane, belief control plane
Search handles self-model control plane, workingness control plane
Source refs doctrine module workingness_instrument (paper_module)
epistemic_control_plane · runtime Generated from the governed public vocabulary for Plectis.
equality General or domain usage An equality states that two expressions represent the same value or mathematical object.
For example, 1 / 2 = 2 / 4 1 / 2 = 2 / 4 compares different expressions for the same number. Equality depends on the setting: two functions are equal when they agree as functions , not merely at a few tested inputs.
In Lean , equality is itself a proposition that can require a proof . Two expressions that simplify to the same form may be equal for a more direct reason than expressions requiring a substantial theorem .
Example The equality 1 2 = 3 × 4 12 = 3 × 4 witnesses that 3 divides 12.
Scope An equality covers the two expressions, domain, and assumptions stated around it.
Not this Two decimal approximations that look alike are not necessarily exactly equal.
Reader rule Distinguish equality from an approximation or a one-way implication .
Other names, related terms and sources
Also shown as equality statement
Search handles equal, equals
equality · mathematical concept Generated from the governed public vocabulary for Plectis.
equation General or domain usage An equation is a mathematical statement that two expressions are equal .
It can specify a relation, define a quantity, or ask which values make the equality true. For example, 𝑥 2 = 4 x 2 = 4 has solutions 𝑥 = 2 x = 2 and 𝑥 = − 2 x = − 2 over the real numbers .
Some equations are identities that hold for every allowed value; others hold only for particular values. A displayed equality in a proof may express a justified transformation rather than a problem to solve.
Example In a denominator argument, an equation obtained by assuming a series rational converts an infinite sum into an exact relation among integers .
Scope An equation covers the expressions, unknowns, domain, and constraints stated in its formulation.
Not this An inequality such as 𝑥 < 3 x < 3 compares ordered values; it does not assert equality and is not an equation.
Reader rule The permitted domain and assumptions determine what counts as a solution.
Other names, related terms and sources
Also shown as equation to solve
Search handles equations
equation · mathematical concept Generated from the governed public vocabulary for Plectis.
equidistribution General or domain usage A sequence is equidistributed in a region when the long-run proportion of its terms in each suitable subregion equals that subregion’s relative size.
Modulo one, equidistribution means that the proportion of fractional parts in every interval [ 𝑎 , 𝑏 ) [ a , b ) tends to 𝑏 − 𝑎 b − a as more terms are counted. An interval covering one tenth of [ 0 , 1 ) [ 0 , 1 ) therefore receives a proportion approaching one tenth; a finite sample need not divide exactly that way.
The cited passage describes the profile that an orbit under repeated doubling would have if an equidistribution argument succeeded. Elsewhere the manuscript warns that the needed theorem is delicate. The term therefore names a precise limiting-frequency property; its appearance in a proposed route does not assert that the property has been proved for the sequence at hand.
Example The standard modulo-one example asks whether fractional parts visit every interval [ 𝑎 , 𝑏 ) [ a , b ) with limiting frequency b-a.
Meaning scope General or domain usage. Equidistribution concerns limiting frequencies. A dense sequence need not spend the right proportion of its terms in each interval.
Scope Equidistribution is a limiting frequency statement over all test intervals or an equivalent test class. Density alone, visual scatter, or visiting every interval does not establish it; correlations can remain even when single-term frequencies are uniform.
Other names, related terms and sources
Also shown as equidistributed, uniform distribution modulo one
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 1009 (mathematical_source)
equidistribution · mathematical concept Generated from the governed public vocabulary for Plectis.
equivalence General or domain usage Two statements are logically equivalent when each implies the other under the same assumptions .
To establish 𝑃 ↔ 𝑄 P ↔ Q , one proves both 𝑃 → 𝑄 P → Q and 𝑄 → 𝑃 Q → P . Either statement can then replace the other within that setting, although one may be easier to understand or use.
The papers use equivalences to compare reformulations of open problems . An equivalent reformulation preserves the unresolved question ; proving the equivalence alone does not establish either side unconditionally.
Example An irrationality question may be equivalent to the impossibility of an eventually periodic digit pattern.
Meaning scope General or domain usage. Equivalence means that each of the two named statements implies the other under the same stated domain and hypotheses. It does not follow from similarity, shared examples, or a one-way implication .
Scope An equivalence covers the two named statements under their common hypotheses and domain.
Not this Similarity, shared examples, or a one-way implication does not establish equivalence.
Reader rule A single implication gives a reduction in one direction, not an equivalence.
Other names, related terms and sources
Also shown as equivalent to, if and only if
Search handles iff
equivalence · public projection Generated from the governed public vocabulary for Plectis.
Erdős problem Externally anchored An Erdős problem is a mathematical question associated with Paul Erdős ; this site uses the numbering of the Erdős Problems database.
Meaning scope Externally anchored. The number identifies an entry in an independently maintained database . It is not a ranking, and the database 's status label is its maintainer's current assessment.
Scope Covers the numbered problem labels and the database they point to; it does not cover Erdős 's wider biography, which has its own entry .
Not this A theorem about one special case of an Erdős problem does not settle the problem, and this site says so wherever it states one.
Reader rule Compare a paper 's exact statement with the original question before interpreting a result as a solution.
Other names, related terms and sources
Also shown as Erdős #n
Search handles Erdos problems, Erdős Problems, Erdős problems database
erdos_problem · public projection Generated from the governed public vocabulary for Plectis.
Euler characteristic General or domain usage A topological invariant computed on a finite surface decomposition as vertices minus edges plus faces.
Write 𝜒 = 𝑉 − 𝐸 + 𝐹 χ = V − E + F for a cell decomposition into vertices, edges and disc-shaped faces. Subdividing changes the individual counts but preserves 𝜒 χ . A sphere has 𝜒 = 2 χ = 2 ; a torus has 𝜒 = 0 χ = 0 .
The two-wall argument in #269 partitions a torus into convex polygonal faces. It combines 𝑉 − 𝐸 + 𝐹 = 0 V − E + F = 0 with the fact that each face has at least three sides and each edge borders two faces. The resulting incidence inequality forces an intersection involving exactly two wall families.
Meaning scope General or domain usage. The V−E+F formula here assumes a finite cell decomposition of the stated surface; the torus value differs from the sphere value.
Scope Count identified vertices and edges only once, and check that faces are discs. Applying the planar formula 𝑉 − 𝐸 + 𝐹 = 2 V − E + F = 2 directly to a torus gives the wrong conclusion.
Other names, related terms and sources
Also shown as Euler characteristic formula, Euler formula for surfaces
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:res:dp-two-walls (mathematical_source)
euler_characteristic · mathematical concept Generated from the governed public vocabulary for Plectis.
euler product General or domain usage An Euler product expresses a quantity as a product of factors associated with individual primes .
Other names, related terms and sources
Also shown as Euler product expansion
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 155 (mathematical_source)
euler_product · mathematical concept Generated from the governed public vocabulary for Plectis.
Euler's theorem (modular arithmetic) General or domain usage Euler's theorem says that if a is coprime to a positive integer n, then a raised to 𝜑 ( 𝑛 ) φ ( n ) is congruent to 1 modulo n.
The totient 𝜑 ( 𝑛 ) φ ( n ) counts integers from 1 through n that are coprime to n. For example, 𝜑 ( 1 0 ) = 4 φ ( 10 ) = 4 and 3 4 = 8 1 3 4 = 81 leaves remainder 1 modulo 10.
The exponent 𝜑 ( 𝑛 ) φ ( n ) gives a period but need not be the smallest one. The papers use such exponents to arrange modular repetition while separately proving any claim about the exact multiplicative order .
Other names, related terms and sources
Also shown as Euler congruence, Euler's congruence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 679 (mathematical_source)
eulers_theorem_modular · mathematical concept Generated from the governed public vocabulary for Plectis.
evaluator General or domain usage An evaluator is a tool or procedure that assesses something against chosen criteria.
In Plectis's component model , an evaluator observes inputs and reports its assessment without changing the material being assessed. A separate action is responsible for any repair or update.
For example, an evaluator may detect that a generated page disagrees with source data. Its report identifies the mismatch; it does not by itself decide that the page, source , or generation rule should be changed.
Example The term-layer evaluator measures vocabulary coverage across the site and writes reports; it changes no page.
Scope An evaluator establishes what it measured at the time it ran.
Reader rule The criteria determine what its result can establish.
Other names, related terms and sources
Also shown as evaluators
evaluator · public projection Generated from the governed public vocabulary for Plectis.
event listener General or domain usage An event listener is code registered to receive notification when a specified event occurs.
In the browser , a listener is usually a callback function , though an object with a handleEvent method can also serve as one. Events include clicks, key presses, and focus changes. The listener receives information about the event and can respond to it.
Registering a listener lets other code invoke it when an event is dispatched, instead of repeatedly checking for a change. Some browser events travel through capture and bubble phases , allowing a parent element to handle events from its children. Plectis uses this delegation for glossary terms across a page, sharing the interaction code rather than installing a separate set of handlers on every word.
Example A keydown listener dismisses the open definition card when the reader presses Escape.
Meaning scope General or domain usage. A listener receives dispatched events through a registration mechanism . In a browser it can be a function or an object with a handleEvent method.
Scope Check the event target, propagation phase , repeat behaviour, and cleanup rules when reasoning about a listener.
Not this A function that runs once during page parsing without any event registration is not an event listener.
Other names, related terms and sources
Also shown as event listeners, event handler
Source refs sites/microcosm/index.html (prerequisite_context)
event_listener · public projection Generated from the governed public vocabulary for Plectis.
eventual property General or domain usage An eventual property holds at every index after some finite threshold .
For a sequence indexed by natural numbers , “eventually 𝑃 ( 𝑛 ) P ( n ) ” means that there is an N such that 𝑃 ( 𝑛 ) P ( n ) holds for all 𝑛 ≥ 𝑁 n ≥ N . Any failures must occur before that threshold .
For example, being positive holds eventually for 𝑛 − 1 0 n − 10 , whereas being even never holds eventually for all integers n. The papers use this distinction when comparing recurring obstructions with consequences of rationality .
Scope This is stronger than holding infinitely often or at arbitrarily large indices .
Other names, related terms and sources
Also shown as eventually, for all sufficiently large indices
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 118 (mathematical_source)
eventual_property · mathematical concept Generated from the governed public vocabulary for Plectis.
evidence General or domain usage Evidence is information that supports or challenges a particular claim .
Scope Evidence covers only the claim , cases, source version, and conditions named by its producing record .
Not this A confident summary or repeated assertion is not evidence merely because it sounds precise.
Reader rule Evidence should be interpreted within the conditions under which it was obtained.
Other names, related terms and sources
Also shown as supporting evidence
Search handles evidence-backed
evidence · public projection Generated from the governed public vocabulary for Plectis.
evidence band System-local specialization An evidence band labels the kind of support attached to a statement in a mathematical working record .
The records use labels such as Lean for formal checking, Cert for a checked certificate , Math for mathematical argument, Cited for a referenced result, and Open for an unresolved obligation .
A separate scope description indicates whether the statement covers listed cases, a bounded range, arbitrarily large parameters, or all allowed parameters. Both the evidence and its reach matter.
Example A lemma tagged Cert was verified by exact arithmetic for the listed values only.
Meaning scope System-local specialization. The bands describe the kind of support a statement has in this project's records . They are not a grading of importance.
Scope Covers the tags used in the two long working records and mirrored on the problem pages.
Not this A Math-band statement is not machine-checked , even when a Lean lemma nearby looks similar.
Reader rule These labels describe different sources of support , not interchangeable levels of approval.
Other names, related terms and sources
Also shown as evidence bands
evidence_band · public projection Generated from the governed public vocabulary for Plectis.
evidence class System-coined term An evidence class identifies how a claim is supported, such as by a proof , test run , calculation, or citation.
type of support
Meaning scope System-coined term. An evidence class fixes what kind of support a record provides and which inferences it licenses; it is not a confidence score or a declaration that the underlying claim is true.
Scope Evidence class covers the typed backing attached to public results, cards, and packets . A reader meets it on result and component pages where a claim is shown alongside the category of support that stands behind it, and most directly on the evidence page that sets out what a pass proves.
Not this An evidence class is not a quality score or a rank that makes one result better than another, and a high or strong-sounding class is not proof of launch readiness , security, or whole-system correctness . It names the kind of support , not a verdict.
Reader rule The class must match the evidence attached to the particular claim .
Other names, related terms and sources
Also shown as evidence kind, evidence profile
Search handles evidence rank, proof consumer class
Source refs core/organ_evidence_classes.json (source_registry) tool build_microcosm_public_site (public_projection_builder)
evidence_class · evidence Generated from the governed public vocabulary for Plectis.
exact rational arithmetic General or domain usage Exact rational arithmetic calculates with integer numerators and denominators instead of rounded decimal values.
For example, 1 / 3 + 1 / 6 1 / 3 + 1 / 6 is stored and simplified to 1 / 2 1 / 2 using integer operations. Provided the implementation supports the required integer sizes, these operations introduce no rounding error.
The papers use it when a tiny difference or precise equality matters. It settles the computed rational expression, while an argument about an infinite limit may also need a proved bound on the omitted terms.
Example One third plus one sixth is stored as one half, not as 0.5000000001.
Scope Applies to computations over the rationals ; irrational quantities are not represented exactly this way.
Reader rule Exact calculation still depends on correct inputs, algorithms , and interpretation.
Other names, related terms and sources
Also shown as exact arithmetic, rational arithmetic
exact_rational_arithmetic · public projection Generated from the governed public vocabulary for Plectis.
executable cross-section System-coined term An executable cross-section is a selected part of a larger system that can be run and inspected on its own.
runnable bounded public slice
Plectis publishes components with the source , inputs, checks , and records needed to examine their behaviour. The selection aims to make a working mechanism available without requiring the entire private environment .
A successful run provides evidence about that public selection. Claims about the larger system need their own support , especially where unpublished components or interactions are involved.
Example Plectis is an executable cross-section because its public components can be cloned , run locally, and inspected through their result records .
Meaning scope System-coined term. Executable cross-section is a local ai_workflow/Plectis construct for the published runnable selection. No generally accepted external category, whole-system coverage , or equivalence with an unpublished system is claimed .
Scope The term covers the published runnable selection and its recorded checks . It excludes unpublished components , private data, and claims about whole-system behaviour.
Not this A video of a private application is not an executable cross-section because the viewer cannot run or inspect the demonstrated mechanism .
Reader rule Its scope is the included material and the dependencies declared for it.
Other names, related terms and sources
Also shown as runnable cross-section, runnable public slice
Search handles executable cross section, executable public slice
Source refs tool microcosm_public_narratives (public_narrative_owner) tool build_microcosm_public_site (public_projection_builder)
executable_cross_section · public projection Generated from the governed public vocabulary for Plectis.
execution General or domain usage Execution is the running of instructions or the actual performance of a planned operation.
Source code, a command, or a workflow description records intended work; execution is the event in which a computer or actor carries it out with particular inputs and conditions.
Execution occurs in a concrete environment and can differ from the plan because of inputs, configuration , permissions , dependencies , timing, or failure. It may finish successfully, stop partway, remain active, or complete with unwanted side effects . Logs and receipts can show which instructions ran, while outputs and state checks show what changed. A successful process exit establishes only the success condition defined by that process; it does not automatically prove semantic correctness, publication, deployment , or acceptance by another system.
Example Executing the builder reads source data and writes generated public files.
Scope The term covers command, program , workflow, test, and proof -checking runs.
Not this Displaying a command in a code block does not execute it.
Reader rule A plan or runnable artifact does not establish that execution began, reached its final step, or produced the intended result.
Other names, related terms and sources
Also shown as executions, execute, executes, executed, executing
execution · public projection Generated from the governed public vocabulary for Plectis.
existential quantifier General or domain usage An existential quantifier states that at least one element of a specified domain satisfies a property.
The symbol ∃ ∃ means “there exists.” To establish ∃ 𝑛 ∈ ℕ , 𝑛 2 = 4 ∃ n ∈ N , n 2 = 4 , the number 2 is a witness . “At least one” does not mean exactly one: a separate uniqueness claim is needed to exclude other witnesses.
In ∀ 𝑥 ∃ 𝑦 ∀ x ∃ y , the choice of y may depend on x. In ∃ 𝑦 ∀ 𝑥 ∃ y ∀ x , one y must work for all x. Lean statements preserve this distinction, which can make a conditional or uniform claim substantially stronger.
Scope A witness must satisfy every required condition; changing the domain can change whether a witness exists.
Other names, related terms and sources
Also shown as existential quantification
Source refs governed vocabulary term_registry (reading_context)
existential_quantifier · mathematical concept Generated from the governed public vocabulary for Plectis.
exit code General or domain usage An exit code is the small numeric status a process returns when it finishes.
By convention zero usually reports success and nonzero values distinguish kinds of failure, though each program defines its own meanings. Scripts and workflow engines use the code to decide whether to continue, retry , or stop. Output text and exit status are separate evidence .
An exit code is a process-level completion signal, usually an integer made available to the parent shell or orchestrator. Unix convention reserves zero for success and nonzero values for exceptional outcomes, but individual programs define the detailed mapping . Standard output and error text may explain the result yet remain separate from this status. Signals, crashes, wrappers, pipelines , and timeouts can transform what callers observe. Reliable automation therefore interprets codes through the command’s documented contract and preserves enough output to diagnose which condition actually occurred.
Example A tool documents exit 0 as success, exit 1 as a detected difference, and exit 2 as invalid invocation, allowing its caller to respond differently.
Scope An exit code reports one process completion status under that command’s documented convention; wrappers, signals, and orchestrators may map outcomes differently.
Not this A nonzero code is not universally the same failure, and exit 0 does not establish claims beyond the command’s stated check .
Reader rule An exit code must be interpreted using the producing command’s contract ; nonzero does not always mean the same failure, and zero does not validate claims beyond that command.
Other names, related terms and sources
Also shown as exit status
Search handles exit 1
exit_code · public projection Generated from the governed public vocabulary for Plectis.
exogenous General or domain usage Exogenous means originating outside the system or process under discussion.
An external observation, event, or judgement can be exogenous relative to the process being studied. The classification depends on the chosen boundary: a signal can be external to one component but internal to the organisation containing it.
Plectis uses the term when discussing evidence and criticism that do not arise solely from the workflow producing the work. The source 's expertise and dependencies still need assessment.
Example An expert saying the main lemma is a known result would be an exogenous report.
Scope Describes the source of a process or judgement. It does not mean true.
Not this A green Lean run on the author's machine is not an exogenous judgement of importance.
Reader rule Outside origin does not by itself guarantee accuracy or independence.
Other names, related terms and sources
Also shown as exogenously
exogenous · public projection Generated from the governed public vocabulary for Plectis.
exogenous truth General or domain usage “Exogenous truth” is this project's phrase for judgement brought in from outside the process being judged.
It refers to an independent reader examining the public evidence and forming their own assessment, including disagreement with the project's account. The phrase stresses an external source of criticism or correction.
The value lies in different evidence , expertise, or assumptions entering the discussion. A claim still needs to be assessed on its merits, whether it comes from inside or outside the project.
Example An expert reading one problem page and saying the main lemma is a known result would be exogenous truth, and would be welcome.
Meaning scope General or domain usage. Exogenous and endogenous keep their ordinary meanings: from outside and from inside a system. This compound names a judgement whose source is outside the process being judged. No technical claim about economics or biology is intended.
Scope Describes the source of a judgement about the project. It does not claim that every outside reaction is correct.
Not this A model , prompted by the author, declaring the work important is still endogenous .
Reader rule It does not mean that an outsider's judgement is automatically true.
Sources
exogenous_truth · public projection Generated from the governed public vocabulary for Plectis.
expected value General or domain usage Expected value is a random variable 's probability-weighted average , defined by integration against its probability measure .
For a finite distribution, E[X] is the sum of each possible value times its probability. A finite real expectation requires integrability; nonnegative variables may instead have extended expectation equal to infinity.
The #257 note computes a finite cutoff's expectation by averaging over a complete residue period. That mean diverges as the cutoff grows, so the finite identities do not supply a finite mean for the limiting observable.
Meaning scope General or domain usage. The probability-theoretic average is intended, distinct from an expected outcome in ordinary task reporting. Infinite or undefined expectations require explicit handling.
Scope Expected does not mean guaranteed, most likely, or observed. Always specify the variable and probability law , and whether the expectation is finite .
Other names, related terms and sources
Also shown as expected values, mathematical expectation, probabilistic expectation
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
expected_value · mathematical concept Generated from the governed public vocabulary for Plectis.
exponent General or domain usage An exponent specifies a power: in 𝑏 𝑛 b n , b is the base and n is the exponent.
For a positive integer n, 𝑏 𝑛 b n means multiplying n copies of b. With nonzero b, 𝑏 0 = 1 b 0 = 1 and 𝑏 − 𝑛 = 1 / 𝑏 𝑛 b − n = 1 / b n . Fractional and real exponents require further definitions and domain conditions.
The expression 2 𝑛 − 1 2 n − 1 subtracts one after taking the power. It differs from 2 𝑛 − 1 2 n − 1 , which lowers the exponent before calculating the power.
Example Erdős #257 sums 1/(2^n-1) over an infinite set of positive exponents n.
Scope Exponent covers the power index in the named expression, sequence , or support .
Not this The exponent n is not the same number as the power 2^n.
Reader rule In digit expansions and arithmetic series , check whether the exponent is restricted to integers .
Other names, related terms and sources
Also shown as positive exponent
exponent · public projection Generated from the governed public vocabulary for Plectis.
exponential backoff General or domain usage Exponential backoff is a retry schedule that increases the delay after each consecutive failure, usually by multiplying it by a fixed factor .
Growing delays reduce pressure on an unavailable or rate-limited service and give it time to recover. Practical schedules normally set maximum delays, attempt limits , and an overall deadline.
A common schedule waits roughly one unit, then two, four, and eight, capped at a maximum. Successful work resets the failure count. Exponential backoff controls retry timing; it does not make a non-idempotent operation safe to repeat or fix invalid input. Plectis provider -routing prose discusses backing off across services after rate limits , where bounded delays prevent a tight failure loop.
Example A client waits 1, 2, 4, then at most 8 seconds between retryable requests.
Meaning scope General or domain usage. A retry schedule whose delay grows multiplicatively after successive failures, usually subject to a maximum; constant immediate retries are outside this sense.
Scope Retry only failures that may recover, respect server guidance, and stop within a stated attempt or time budget.
Not this Immediately retrying forever at a constant rate is not exponential backoff.
Other names, related terms and sources
Also shown as backoff schedule
Source refs sites/microcosm/docs/paper-module-engine-room-annex-knowledge-router.html (prerequisite_context)
exponential_backoff · public projection Generated from the governed public vocabulary for Plectis.
exponential growth General or domain usage Exact exponential growth multiplies a positive quantity by the same factor greater than one at each step.
For example, 2 𝑛 2 n doubles with each unit increase of n and eventually exceeds every fixed power 𝑛 𝑘 n k . Papers also use exponential upper or lower bounds , such as 𝑎 𝑛 ≤ 𝐶 ⋅ 2 𝑛 a n ≤ C ⋅ 2 n ; such a bound does not say 𝑎 𝑛 a n itself doubles each step.
Moduli and carry barriers in the Mersenne -support work operate on exponential scales, making polynomial savings insufficient.
Meaning scope General or domain usage. Asymptotic growth. Not every rapidly growing function is exponential in the strict sense.
Scope The base, input variable , and direction of the bound matter; exponential growth is not a synonym for any rapid growth.
Other names, related terms and sources
Also shown as grows exponentially, exponential scale
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex::line 4287 (mathematical_source)
exponential_growth · mathematical concept Generated from the governed public vocabulary for Plectis.
exponential sum General or domain usage An exponential sum is a finite sum of complex phases , commonly ∑ 𝑎 𝑛 e x p ( 2 𝜋 𝑖 𝑓 ( 𝑛 ) ) ∑ a n exp ( 2 π i f ( n ) ) , used to measure cancellation or arithmetic regularity.
Each complex phase can be pictured as an arrow. Arrows pointing in different directions may nearly cancel, while aligned arrows reinforce one another. For 𝑛 > 1 n > 1 , all nth roots of unity sum to zero. Bounds on such cancellation are useful in number theory .
The paper proposes a weighted exponential sum of totient differences as a diagnostic for a binary word. A strong uniform bound could support distribution claims , while isolated numerical cancellation would not establish them.
Example If phases point in many directions, their vector sum can be much smaller than the sum of their lengths.
Meaning scope General or domain usage. An exponential sum has a specified range, coefficients , and phase . Its name alone gives no cancellation estimate.
Scope The coefficients , range, and phase function are part of the definition in each use. Calling an expression an exponential sum does not by itself supply a bound . It is distinct from an infinite exponential series .
Other names, related terms and sources
Also shown as trigonometric exponential sum
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 914 (mathematical_source)
exponential_sum · mathematical concept Generated from the governed public vocabulary for Plectis.
exposition Externally anchored Mathematical exposition explains a result, its proof , and why the argument works for its intended readers .
Good exposition states the assumptions , introduces notation, identifies the main idea, and distinguishes new work from earlier results. It makes a proof easier to assess and use without weakening its precise claim .
The site treats exposition as a separate task from obtaining a checked proof . A formal declaration may be valid while still needing an explanation that lets another mathematician understand or continue the work.
Example A long reasoning-surface PDF that keeps the failed routes beside the checked lemmas is an attempt at exposition of a still-open problem .
Scope The word is Tao's. The local use is: write the human-readable account that would let someone else give the talk. The local use is not: declare the talk given.
Not this A kernel -accepted proof with no account of the hard step is verification without exposition.
Reader rule Clear writing supports verification but cannot replace missing mathematical reasoning.
Other names, related terms and sources
Also shown as mathematical exposition
exposition · public projection Generated from the governed public vocabulary for Plectis.
F
factor General or domain usage A factor is one of the quantities multiplied together to make a product .
In 1 2 = 3 ⋅ 4 12 = 3 ⋅ 4 , both 3 and 4 are factors of 12. For integers , saying that d is a factor of n usually means that d divides n exactly.
In algebra, factors may be expressions: 𝑥 2 − 1 = ( 𝑥 − 1 ) ( 𝑥 + 1 ) x 2 − 1 = ( x − 1 ) ( x + 1 ) . The setting determines which factors count as irreducible and what uniqueness of factorisation means. Factoring can expose roots or divisibility conditions that are hidden in the expanded expression.
Example 3 and 4 are factors in the product 3 × 4 = 1 2 3 × 4 = 12 .
Scope Factor covers the product and algebraic domain named in context.
Not this A summand in 3 + 4 3 + 4 is not a factor because the operation is addition.
Reader rule Factorisation expresses an object as a product of its factors.
Other names, related terms and sources
Also shown as integer factor
Search handles factors
factor · mathematical concept Generated from the governed public vocabulary for Plectis.
factorial General or domain usage The factorial of a nonnegative integer n is the product of the integers from 1 through n, with the value at zero defined as 1.
For example, 4 ! = 2 4 4 ! = 24 . Factorials count arrangements of n distinct objects and also provide rapidly growing, highly divisible denominators in number-theory problems.
Expressions such as 𝑛 ! − 1 n ! − 1 and ( 𝑛 − 1 ) ! ( n − 1 ) ! have very different values and divisibility properties. The paper 's parentheses and order of operations are therefore part of the statement being studied.
Example 5 ! = 1 × 2 × 3 × 4 × 5 = 1 2 0 5 ! = 1 × 2 × 3 × 4 × 5 = 120 , so 1 / ( 5 ! − 1 ) = 1 / 1 1 9 1 / ( 5 ! − 1 ) = 1 / 119 .
Scope The usual whole-number factorial, not the gamma function unless a page says so.
Not this Calling a proof 'factorial' in the everyday sense of 'having many factors ' is not this term.
Reader rule The exclamation mark here is mathematical notation, not punctuation indicating emphasis.
Other names, related terms and sources
Also shown as n!
factorial · public projection Generated from the governed public vocabulary for Plectis.
factorisation General or domain usage Factorisation writes a number or algebraic expression as a product of simpler factors .
For example, 6 0 = 2 2 ⋅ 3 ⋅ 5 60 = 2 2 ⋅ 3 ⋅ 5 is the prime factorisation of 60. Every integer greater than 1 has a unique prime factorisation, apart from the order in which its factors are written.
The papers use factorisation to study divisibility , common factors , and the denominators of sums. A convenient factorisation can reveal constraints that are hard to see from a decimal value.
Example Euler's totient can be computed from the prime factorisation of its input.
Scope Factorisation covers the named integer , polynomial , or algebraic expression and the permitted factor class.
Not this Writing a number as 1 × n is formally a product but not the nontrivial factorisation usually sought.
Reader rule Uniqueness depends on the mathematical setting when the objects are more general than integers .
Other names, related terms and sources
Also shown as prime factorisation, factorization
Search handles prime factorization
factorisation · public projection Generated from the governed public vocabulary for Plectis.
fail-closed System-coined term Fail-closed means withholding an action when a required condition cannot be established.
For example, a publication gate may stop when a required check is missing or its result cannot be read. Plectis uses this behaviour where proceeding without evidence would wrongly treat uncertainty as permission .
Failing closed can prevent an unsupported action, but it does not prove the underlying artifact is faulty. The next step may be to obtain the missing evidence or repair the check .
Example AX-5: missing evidence defaults to blocked rather than silently passing. See it live: Doctrine AX-5 the fail-closed rule
Meaning scope System-coined term. Fail-closed means a composite is only as trusted as its weakest required part, and missing evidence blocks rather than silently passes.
Scope Doctrine AX-5 copy.
Not this Fail-closed is not a claim that the public site is a safety-certified product .
Reader rule The required conditions and the action being withheld must be explicit.
Other names, related terms and sources
Also shown as fail-closed monotone lattice
fail_closed · public projection Generated from the governed public vocabulary for Plectis.
failure class propagation System-coined term Failure-class propagation checks whether a discovered fault also affects other cases for the same reason.
bounded class repair
Plectis starts with the local failure, identifies its cause, and inspects related surfaces that share the relevant mechanism . Confirmed instances can then be repaired together through the common source or rule.
The aim is to fix a recurring cause without expanding the repair to unrelated work. A useful record states which cases were examined and where the explanation stops applying.
Example The Pattern Binding Contract is a concrete instance: it takes an observed pattern, binds it to the sibling surfaces where the same shape genuinely recurs, and fixes the extent of the binding so the repair neither stops at the first case nor spreads past where the pattern holds. See it live: Pattern Binding Contract open the component that binds a local pattern to its proven class with a stated boundary
Meaning scope System-coined term. Failure-class propagation tests whether one local break recurs across sibling surfaces before widening the repair; it is not permission to apply one fix everywhere.
Scope The term covers how the system turns a local defect into a bounded , checked repair across related surfaces. A reader meets it in the doctrine and in components such as the Pattern Binding Contract , where a local pattern is bound to its proven extent with a stated boundary rather than patched once or expanded without limit .
Not this Failure class propagation is not patching only the one spot that broke, and it is not turning a single bug into an unbounded sweep across the whole system. It is a bounded repair sized to the siblings that were actually checked .
Reader rule Similarity alone is not enough to assume that another case has the same fault.
Other names, related terms and sources
Also shown as failure_class_propagation, class of failure, failure class
Search handles patch the class, bounded class repair, local failure global pattern, local failure to global repair
Source refs doctrine skill local_to_general_propagation (skill)
failure_class_propagation · propagation Generated from the governed public vocabulary for Plectis.
failure modes General or domain usage Failure modes are the distinct ways something can fail to meet its intended purpose.
A check might accept bad input, reject good input, use stale data, or fail to run. These are different failure modes because their causes, evidence , and repairs can differ.
Plectis uses negative cases and recorded incidents to make such failures inspectable. Covering known modes improves a check , while new situations may still reveal modes that were not anticipated.
Example A proof assistant accepting a statement that is not the original problem is a failure mode of translation, even when the check is green.
Scope Names classes of break. It does not mean every failure is interesting or that the project has catalogued all of them.
Not this A deliberate refusal of unsafe input is successful protection, not a failure mode of the gate.
Reader rule Name the mechanism of failure, not just the fact that a result is wrong.
Other names, related terms and sources
Also shown as failure mode, modes of failure
Search handles failure-modes
failure_modes · public projection Generated from the governed public vocabulary for Plectis.
fallback General or domain usage A fallback is an alternative behavior used when a preferred route is unavailable, unsuitable, or fails.
A service may use cached data when a live provider is down, or switch to a simpler algorithm when resources are limited. The result can remain useful while losing freshness , accuracy, capacity, or assurance.
Fallbacks improve resilience when their reduced contract is explicit. A silent fallback can instead hide primary failures, make stale results look current, or produce inconsistent behavior across users. The alternative may fail independently or depend on the same underlying resource, so it is not automatically redundant. Systems often record fallback activation, expose degraded status, bound how long cached or approximate results remain acceptable, and test recovery. A fallback is a planned contingency, whereas arbitrary error swallowing merely conceals failure.
Scope Fallback behavior is defined by its trigger, alternative source or method, preserved capabilities, reduced guarantees, duration, and route back to normal operation.
Other names, related terms and sources
Also shown as fallback route, fall back
Source refs sites/microcosm/docs/lineage.html (reading_context) sites/microcosm/docs/paper-module-batch12-release-claim-language-gate.html (reading_context)
fallback · public projection Generated from the governed public vocabulary for Plectis.
falling factorial General or domain usage The falling factorial multiplies a fixed number of consecutive descending factors : 𝑥 ( 𝑥 − 1 ) ⋯ ( 𝑥 − 𝑘 + 1 ) x ( x − 1 ) ⋯ ( x − k + 1 ) .
For 𝑘 = 0 k = 0 its value is 1. For integer 𝑥 ≥ 𝑘 ≥ 0 x ≥ k ≥ 0 it equals 𝑥 ! / ( 𝑥 − 𝑘 ) ! x ! / ( x − k ) ! and counts ordered choices of k distinct items from x items.
The sparse-perturbations manuscript uses falling factorials of orders zero through 𝑑 − 1 d − 1 as a basis for polynomials of degree below d. Vanishing derivatives of an exponential generating function at 1 therefore imply vanishing weighted sums for every polynomial in that degree range, enabling the quotient-tail argument.
Other names, related terms and sources
Also shown as descending factorial, falling factorials
Source refs sites/microcosm/papers/source/plectis-erdos/paper/synthesis/optimal-sparse-perturbations.tex::capacity:sec:rational-jets (mathematical_source)
falling_factorial · mathematical concept Generated from the governed public vocabulary for Plectis.
falsifiable General or domain usage A claim is falsifiable when some possible evidence could count against it under stated assumptions .
Falsifiability makes disagreement operational: the claim states conditions under which evidence would count against it. It does not mean the claim is false, easily tested, or scientifically important, and a failed test may also expose faulty assumptions or measurement.
A falsifiable claim exposes at least one possible observation, experiment, counterexample , or result that would count against it under stated assumptions . This does not mean the claim is false, likely false, easy to test, or scientifically valuable. A negative result may challenge an auxiliary assumption , measurement method, or experimental setup instead of the central proposition , so interpretation still requires care. Conversely, repeatedly accommodating every outcome without changing the claim removes empirical content. Good statements identify both the conflicting evidence and the background conditions needed for that conflict to be meaningful.
Example A component 's claim is falsifiable because you can run its check and compare.
Scope Ordinary usage from philosophy of science, applied here to software claims .
Reader rule Falsifiable does not mean false; it means the claim states what evidence would conflict with it rather than accommodating every possible outcome.
Other names, related terms and sources
Also shown as falsifiability, falsify
falsifiable · public projection Generated from the governed public vocabulary for Plectis.
Farey sequence General or domain usage The Farey sequence of order N lists all reduced fractions between 0 and 1 whose positive denominators are at most N.
The fractions appear in increasing order, including 0 / 1 0 / 1 and 1 / 1 1 / 1 . For example, order 3 gives 0 / 1 0 / 1 , 1 / 3 1 / 3 , 1 / 2 1 / 2 , 2 / 3 2 / 3 , 1 / 1 1 / 1 .
The denominator bound makes the sequence finite . Its neighbouring fractions have useful arithmetic relationships, making Farey sequences a way to organise questions about rational approximation and the gaps between fractions .
Example The Farey sequence of order three is 0 / 1 0 / 1 , 1 / 3 1 / 3 , 1 / 2 1 / 2 , 2 / 3 2 / 3 , 1 / 1 1 / 1 .
Reader rule “Reduced” means that numerator and denominator have no common factor greater than 1.
Other names, related terms and sources
Also shown as Farey window
farey_sequence · public projection Generated from the governed public vocabulary for Plectis.
feedback loop General or domain usage A feedback loop occurs when a process's output influences its later behaviour.
Feedback can reinforce a change, counteract it, or create more complicated dynamics. In software , test results can guide revisions; in research, an interpretation can shape which evidence is sought next.
Plectis records evidence and invites external criticism to help distinguish correction from a loop that merely repeats the assumptions of its own earlier outputs.
Example Drafting with a model , then asking the same model whether the draft is important, is a feedback loop.
Scope Names a self-feeding process. Endogenous says the feed is from inside; circuit-break names the interruption.
Not this A stranger reading the public record and reporting an error is not another turn of that loop.
Reader rule Feedback is not inherently beneficial or self-confirming; its effect depends on what is measured and how it is used.
Other names, related terms and sources
Also shown as feedback loops
feedback_loop · public projection Generated from the governed public vocabulary for Plectis.
field extension General or domain usage A field extension 𝐿 / 𝐾 L / K is a larger field L containing a copy of a field K and using the same addition and multiplication on K.
Meaning scope General or domain usage. The notation L/K names a field containing another field, not a quotient obtained by division. Extension properties are relative to K.
Scope The notation 𝐿 / 𝐾 L / K names containment, not a quotient field. Properties such as finite , algebraic, normal, separable, and Galois are always relative to the chosen base K.
Other names, related terms and sources
Also shown as extension field
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 280 (mathematical_source)
field_extension · mathematical concept Generated from the governed public vocabulary for Plectis.
field of fractions General or domain usage The field of fractions F r a c ( 𝐴 ) Frac ( A ) of an integral domain A consists of ratios 𝑎 / 𝑏 a / b with 𝑎 , 𝑏 ∈ 𝐴 a , b ∈ A and 𝑏 ≠ 0 b ≠ 0 , identifying ratios that represent the same value.
The field of fractions of Z is Q. The construction works because an integral domain has no zero divisors , so ordinary fraction arithmetic is consistent. Every element of A appears as a/1.
Two ratios 𝑎 / 𝑏 a / b and 𝑐 / 𝑑 c / d represent the same element precisely when 𝑎 𝑑 = 𝑏 𝑐 a d = b c . Addition and multiplication then follow the usual fraction rules. For a prime ideal p, the quotient 𝑅 / 𝑝 R / p has no zero divisors , so its field of fractions exists and is the residue field 𝜅 ( 𝑝 ) κ ( p ) . If p is maximal, 𝑅 / 𝑝 R / p is already a field and no further elements need to be added.
Example The field of fractions of Z is Q.
Meaning scope General or domain usage. This construction applies to an integral domain. A ring with zero divisors does not have a field of fractions in this sense.
Scope A general ring with zero divisors does not have a field of fractions in this sense. For a prime ideal p, 𝑅 / 𝑝 R / p is an integral domain, so F r a c ( 𝑅 / 𝑝 ) Frac ( R / p ) exists even when 𝑅 / 𝑝 R / p is not already a field.
Other names, related terms and sources
Also shown as fraction field
Search handles Frac
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 287 (prerequisite_dependency)
field_of_fractions · mathematical concept Generated from the governed public vocabulary for Plectis.
field trace General or domain usage The field trace of an element in a finite field extension is the trace of the linear map that multiplies by that element.
Scope The ambient extension must be specified. Summing distinct roots of an element’s minimal polynomial can omit multiplicities when the element generates a proper subfield.
Other names, related terms and sources
Also shown as trace of a field element, field traces
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-trace (mathematical_source)
field_trace · mathematical concept Generated from the governed public vocabulary for Plectis.
finite General or domain usage A set is finite if its elements can be counted by a nonnegative integer .
In related uses, a finite calculation or sequence has only finitely many steps or terms. The count can be extremely large; finite does not mean practically small or easy to inspect .
The papers may verify many finite instances exactly. Extending that result to all instances requires a general argument, unless a theorem has already reduced the problem to those particular cases.
Example A computation checking all denominators up to a fixed bound is finite.
Scope Finite covers the collection, process, or bound named in the statement.
Not this A billion-element set is still finite despite being too large for convenient manual inspection .
Reader rule Distinguish one large finite case from a statement about every possible size.
Other names, related terms and sources
Also shown as finitely many
Search handles finite set, finite sequence
finite · mathematical concept Generated from the governed public vocabulary for Plectis.
finite Blaschke product General or domain usage A finite product of disc automorphism factors , multiplied by a complex constant of modulus one.
It has the form 𝐵 ( 𝑧 ) = 𝑒 𝑖 𝜃 ∏ ( 𝑧 − 𝑎 𝑗 ) / ( 1 − ――― 𝑎 𝑗 𝑧 ) B ( z ) = e i θ ∏ ( z − a j ) / ( 1 − a j ― z ) , with | 𝑎 𝑗 | < 1 | a j | < 1 . The zeros 𝑎 𝑗 a j are counted with multiplicity. On the unit circle its modulus is one, and its degree is the number of factors .
After a Riemann map , a regular polynomial lemniscate component becomes a finite Blaschke product whose degree is the number of roots in that component . An exterior version records the excluded roots and supplies the boundary-fibre identity in the capacity estimate.
Other names, related terms and sources
Also shown as finite Blaschke products
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 700 (mathematical_source)
finite_blaschke_product · mathematical concept Generated from the governed public vocabulary for Plectis.
finite computation General or domain usage A finite computation is a calculation that completes after finitely many steps.
Scope A finite computation covers its declared inputs, algorithm , numeric exactness, and execution record .
Not this Computing many cases is not a proof that every remaining case behaves the same way.
Reader rule The number of cases checked does not by itself extend the result beyond those cases.
Other names, related terms and sources
Also shown as finite calculation, computed finite case
Search handles finite check
finite_computation · public projection Generated from the governed public vocabulary for Plectis.
finite difference General or domain usage A finite difference measures a function ’s change over a fixed step; for a sequence , its forward difference is Δ 𝑎 𝑛 = 𝑎 𝑛 + 1 − 𝑎 𝑛 Δ a n = a n + 1 − a n .
Repeated differences apply the same operation again. A degree-d polynomial sequence has zero ( 𝑑 + 1 ) s t ( d + 1 ) st differences, just as its ( 𝑑 + 1 ) s t ( d + 1 ) st derivative vanishes.
In #243, the recurrence controls the first difference of the error. Three further differences show Δ 4 𝐶 𝑛 → 0 Δ 4 C n → 0 . Since these differences are integers , they eventually equal zero, and Newton interpolation gives an eventual cubic. The paper explicitly shows why its little-o precision cannot simply be weakened to big-O.
Scope A small error in the values need not have the required small differences. Eventual vanishing of a fixed-order difference is stronger than an approximate polynomial growth estimate.
Other names, related terms and sources
Also shown as forward difference, finite differences
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-extraction (mathematical_source)
finite_difference · mathematical concept Generated from the governed public vocabulary for Plectis.
finite field General or domain usage A finite field is a field with finitely many elements.
Its size is a prime power 𝑝 𝑟 p r . The simplest example is 𝔽 𝑝 F p , the integers modulo a prime p, where every nonzero residue has a multiplicative inverse.
The #243 square obstruction is stated in the prime field 𝔽 ℓ F ℓ for primes ℓ outside specified exceptions. The Galois argument shows the reduction of 𝛼 α lies in that field while a hypothetical square root does not. This separates a square in an extension field from a square in 𝔽 ℓ F ℓ itself.
Scope The ring of integers modulo 𝑝 𝑟 p r is not a field when 𝑟 > 1 r > 1 . A field with 𝑝 𝑟 p r elements is a different construction; its characteristic is p.
Other names, related terms and sources
Also shown as finite fields
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::eq:all-root-square (mathematical_source)
finite_field · mathematical concept Generated from the governed public vocabulary for Plectis.
finite truncation General or domain usage A finite truncation keeps a specified finite part of an otherwise longer or infinite object.
Scope A finite expression can be calculated exactly while still differing from the full object.
Other names, related terms and sources
Also shown as truncation, cutoff approximation
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 1186 (mathematical_source)
finite_truncation · mathematical concept Generated from the governed public vocabulary for Plectis.
fixture General or domain usage A test fixture supplies the inputs, state, or environment used for a test.
In Plectis's public examples, fixtures are often small stored datasets or files chosen to exercise particular behaviours. A negative fixture deliberately represents a case the mechanism should reject or report.
Using the same fixture helps comparison, but repeatability also depends on the program and environment . A fixture can test one failure mode well without representing the full range of real-world inputs.
Example A component that classifies evidence ships a fixture file of sample rows; running the check reads that file, writes a result record , and proves the classifier behaves as claimed on those rows.
Reader rule The fixture's role is to make the tested conditions explicit and repeatable.
Other names, related terms and sources
Also shown as input fixture, synthetic fixture
Search handles input fixtures
fixture · public projection Generated from the governed public vocabulary for Plectis.
flat torus General or domain usage A periodic Euclidean space formed by identifying points that differ by lattice translations.
The standard two-dimensional example is a square with opposite edges identified: crossing one edge returns at the opposite edge. More generally ℝ 𝑑 / Λ R d / Λ uses a full-rank discrete translation lattice Λ Λ . Its metric is inherited locally from Euclidean space, so its curvature is zero.
In #269 each coordinate is a real number modulo l o g 𝑞 log q . The product is a flat torus whose straight flow records prime -power crossings. A two-dimensional subtorus is used for an incidence count. The quotient keeps phase information while discarding whole periods.
Meaning scope General or domain usage. The paper uses a real translation torus with its flat metric ; an abstract torus need not carry that chosen metric .
Scope The familiar doughnut drawn in three-dimensional space has the same topology but a different metric , with varying curvature. Flat refers to intrinsic geometry, not to the visual embedding.
Other names, related terms and sources
Also shown as flat tori, translation torus
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:sec:flow (mathematical_source)
flat_torus · mathematical concept Generated from the governed public vocabulary for Plectis.
floor function General or domain usage The floor of a real number x, written ⌊x⌋, is the greatest integer less than or equal to x.
Thus ⌊ 3 . 8 ⌋ = 3 ⌊ 3.8 ⌋ = 3 and ⌊ − 1 . 2 ⌋ = − 2 ⌊ − 1.2 ⌋ = − 2 . The second example matters: floor rounds downward, not toward zero. It is constant between consecutive integers and jumps at each integer .
The paper partitions a parameter range according to which floor function changes. Its intervals are controlled by the jump points where an underlying real expression crosses an integer .
Example Thus ⌊ 3 . 8 ⌋ = 3 ⌊ 3.8 ⌋ = 3 and ⌊ − 1 . 2 ⌋ = − 2 ⌊ − 1.2 ⌋ = − 2 .
Meaning scope General or domain usage. Floor rounds toward negative infinity, so it differs from truncation toward zero on negative nonintegers.
Scope The defining inequalities are ⌊ 𝑥 ⌋ ≤ 𝑥 < ⌊ 𝑥 ⌋ + 1 ⌊ x ⌋ ≤ x < ⌊ x ⌋ + 1 . At an integer x the floor equals x. Floor differs from ceiling , nearest-integer rounding, and truncation of decimal digits.
Other names, related terms and sources
Also shown as floor, greatest-integer function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 509 (mathematical_source)
floor_function · mathematical concept Generated from the governed public vocabulary for Plectis.
focus management General or domain usage Focus management is the deliberate control of which interactive element receives keyboard input and where focus moves after an interface changes.
Good focus management makes dialogs, popups, navigation , and dynamic content predictable without trapping or losing the keyboard user. Visible focus styling shows the current target.
Browsers maintain one active element in a document. Scripts sometimes need to move focus when opening a dialog or return it to the control that opened a dismissed popup. Plectis glossary behaviour keeps focus on the mathematical expression after Escape and suppresses the focus event that would immediately reopen the card. Focus management complements semantic HTML; it cannot repair controls with missing names or incorrect roles.
Example Escape closes a notation popup and restores focus to the expression that opened it.
Meaning scope General or domain usage. Deliberate control of keyboard or programmatic focus so interaction order and context remain understandable; pointer movement alone should not arbitrarily move focus.
Scope Move focus only for a clear interaction reason, preserve a sensible return target, and avoid reopening dismissed content from the restoration event.
Not this Moving focus on every mouse movement is not useful focus management.
Other names, related terms and sources
Also shown as keyboard focus management
Source refs sites/microcosm/index.html (prerequisite_context)
focus_management · public projection Generated from the governed public vocabulary for Plectis.
forecasting General or domain usage Forecasting produces claims about unknown future outcomes, often with probabilities or ranges.
Good forecasting defines the event, resolution time, information cutoff, and scoring method before the outcome is known. Repeated forecasts can be assessed for calibration and discrimination. Scenarios and conditional forecasts answer different questions from unconditional probability estimates.
Forecasting states expectations about outcomes not yet known, ideally with a precise event definition, resolution rule, deadline, information cutoff, and probability or range. Evaluation across comparable resolved cases can measure calibration , discrimination, and scoring performance. Conditional forecasts describe what is expected if a premise holds; scenarios explore possibilities without necessarily assigning probabilities. One correct or incorrect prediction is weak evidence about skill . Forecast quality also depends on question selection, base rates, missing outcomes, revisions, and whether forecasters could observe information that later evaluators treat as unavailable.
Example Comparing a forecast against a benchmark and reporting whether the difference is larger than chance.
Scope Nothing here is investment advice or a claim about tradeable performance.
Reader rule A forecast is evidence of a reasoned expectation, not knowledge of the future; evaluate it over comparable resolved cases rather than one memorable outcome.
Other names, related terms and sources
Also shown as forecast skill
Search handles research and forecasting
forecasting · public projection Generated from the governed public vocabulary for Plectis.
formal General or domain usage Formal means expressed within explicitly specified rules; in mathematics , it usually concerns a precise logical language and inference system.
A formal statement identifies its objects and conditions in that language. A formal proof follows the system's rules to derive a conclusion from assumptions .
The papers connect formal statements with ordinary mathematical explanations so readers can examine both the validity of the derivation and whether the encoded result matches the claim being made.
Example A Lean theorem declaration is formal because its meaning is fixed by Lean 's language and kernel .
Scope Here the term covers rule-governed mathematical and software descriptions, not ceremonial or stylistic formality.
Not this Carefully worded prose is not formal merely because it sounds rigorous.
Reader rule Precision of form does not ensure that the statement expresses the intended question.
Other names, related terms and sources
Also shown as formally specified, formal method, formal methods
formal · public projection Generated from the governed public vocabulary for Plectis.
formal mathematics General or domain usage Formal mathematics expresses definitions, statements, and proofs in a language governed by explicit logical rules.
Proof assistants such as Lean can check the resulting derivations mechanically. Authors may use tactics and automation to construct proofs , while the accepted proof must satisfy the system's checking rules.
Formal checking reduces dependence on unchecked inference steps. It leaves separate work in choosing the right formulation, explaining the ideas, assessing significance, and ensuring that the formal statement corresponds to the intended mathematics .
Example A Lean library can contain formal definitions, theorem statements, and checked proofs alongside explanatory prose.
Scope Covers mathematical definitions, statements, and proofs expressed under explicit formal rules; formalisation names the process of producing them.
Reader rule The exact statement and assumptions determine what has been established.
Other names, related terms and sources
Also shown as formal math
formal_mathematics · public projection Generated from the governed public vocabulary for Plectis.
formal power series General or domain usage A formal power series is an infinite coefficient sequence written as powers of a symbol, with arithmetic defined coefficient by coefficient .
Scope Formal series do not require numerical convergence . Substitution into an infinite series needs its own algebraic condition, such as a substituted series with zero constant term.
Other names, related terms and sources
Also shown as formal series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 61 (mathematical_source)
formal_power_series · mathematical concept Generated from the governed public vocabulary for Plectis.
formal proof General or domain usage A formal proof is a derivation expressed in a logical system whose rules make each step precisely checkable.
Reader rule Distinguish a formal proof from a formalised statement with an unfinished proof . Also distinguish being formally expressible from having passed a recorded checker run.
Other names, related terms and sources
Also shown as machine-checked proof, formalised proof
Search handles formalized proof
formal_proof · public projection Generated from the governed public vocabulary for Plectis.
formal verification General or domain usage Formal verification uses logic and mathematical models to establish a stated property against a precise specification .
Reader rule Identify the specification , model , assumptions , and trusted checking method before interpreting the guarantee. Passing sample tests supports a different kind of conclusion.
Other names, related terms and sources
Also shown as formally verified, formal check
formal_verification · public projection Generated from the governed public vocabulary for Plectis.
formalisation General or domain usage Formalisation translates definitions, statements, or arguments into a language with explicit logical rules.
Meaning scope General or domain usage. The disciplinary process includes encoding statements and specifications as well as completed arguments. Lean is the main local example; a formalised statement alone does not imply a completed proof .
Scope Encoding the intended statement and proving that statement are separate parts of the work.
Not this Careful prose or familiar mathematical notation alone does not specify a formal language, and a formalised theorem statement is not yet a proof .
Reader rule Report the stage reached: formal definitions, an encoded statement, a finished proof , and an inspected correspondence with the informal claim are distinct achievements.
Other names, related terms and sources
Also shown as formalization, formalised, formalized
Search handles formalise, formalize, formalising, formalizing, formal source
formalisation · public projection Generated from the governed public vocabulary for Plectis.
forward-invariant set General or domain usage A set is forward invariant when trajectories starting in it remain there for as long as their forward evolution is defined.
For the differential equation 𝑥 ′ = − 𝑥 x ′ = − x , every solution starting in [ − 1 , 1 ] [ − 1 , 1 ] moves toward zero and remains in that interval. Hence [ − 1 , 1 ] [ − 1 , 1 ] is forward invariant, although reversing time can drive points outward.
Along regular Newton trajectories, the polynomial modulus decreases, so a polynomial sublevel set is preserved. This alone does not justify extending a trajectory through a critical point where the vector field -f/f′ is undefined.
Meaning scope General or domain usage. Dynamical systems. Distinct from a numerical invariant that stays exactly constant.
Scope Forward invariance means a trajectory stays in the set for every later time for which its evolution is defined. It depends on the chosen dynamics and makes no promise about backward motion or continuation through singular points.
Other names, related terms and sources
Also shown as forward invariant, positively invariant
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 635 (mathematical_source)
forward_invariant_set · mathematical concept Generated from the governed public vocabulary for Plectis.
fraction General or domain usage A fraction writes a quotient as 𝑎 / 𝑏 a / b ; for a rational number , a and b are integers and b is nonzero.
Scope Fraction covers the stated numerator-denominator representation, including whether it is reduced.
Not this A decimal approximation is not the exact fraction unless the equality is separately established.
Reader rule “In lowest terms” means that numerator and denominator are coprime .
Other names, related terms and sources
Also shown as reduced fraction
Search handles numerator
fraction · public projection Generated from the governed public vocabulary for Plectis.
fractional part General or domain usage For a real number x, its fractional part is x minus the greatest integer at most x, so it lies in [ 0 , 1 ) [ 0 , 1 ) .
For example, 3.7 has fractional part 0.7, while -1.2 has fractional part 0.8 because the floor is -2. Fractional parts record position modulo one and are central when a sequence is studied around the unit circle.
Here the paper studies fractional parts of factorially scaled numbers. Saying they vanish eventually means every sufficiently late scaled value is an integer . Bounds on fractional parts can force arithmetic conclusions even without proving that those parts are evenly spread.
Example For example, 3.7 has fractional part 0.7, while -1.2 has fractional part 0.8 because the floor is -2.
Meaning scope General or domain usage. The fractional part lies between zero and one, even for negative inputs; it is not generally the signed decimal tail.
Scope The fractional part { 𝑥 } = 𝑥 − ⌊ 𝑥 ⌋ { x } = x − ⌊ x ⌋ is zero exactly when x is an integer . Negative inputs still give a value in [ 0 , 1 ) [ 0 , 1 ) , unlike a signed decimal tail produced by truncation .
Other names, related terms and sources
Also shown as fractional parts
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos68-factorial-reasoning-surface.tex::line 1648 (mathematical_source)
fractional_part · mathematical concept Generated from the governed public vocabulary for Plectis.
freshness System-local specialization Freshness describes whether stored information still reflects the source or state it is meant to represent.
A generated page, cached result, or copied file may have been accurate when created and become outdated after its source changes. Plectis uses source versions and refresh rules to assess that relationship.
A useful freshness record identifies the source , the version examined, and the condition that requires another check . Different kinds of information can have very different refresh needs.
Example A count of remaining obligations is a cached read: it is only current while it carries its as-of time, its basis , and a refresh rule. See it live: The operating loop open the freshness question on the doctrine page
Meaning scope System-local specialization. Freshness here is whether a dated live reading is still current under its declared basis and refresh rule. It is not newness, recency of publication, or a quality judgement.
Scope Applies to dated live readings on doctrine , evidence , and generated pages, not to the age of a theorem or a paper .
Not this A Lean-checked theorem does not go stale because a week has passed. Freshness is a property of live readings, not of proved statements.
Reader rule A recent timestamp alone does not show that the right source was read.
Other names, related terms and sources
Also shown as freshness contract, refresh rule
freshness · public projection Generated from the governed public vocabulary for Plectis.
Frobenius automorphism General or domain usage In characteristic p, Frobenius sends x to 𝑥 𝑝 x p ; it is an automorphism when this power map is onto, as it always is for a finite field .
In 𝐹 4 F 4 , the map 𝑥 ↦ 𝑥 2 x ↦ x 2 fixes 0 and 1 and swaps the two other elements, so it is a nontrivial automorphism. More generally, if 𝑞 = 𝑝 𝑛 q = p n , the p-power Frobenius generates the cyclic Galois group 𝐺 𝑎 𝑙 ( 𝐹 𝑞 / 𝐹 𝑝 ) G a l ( F q / F p ) and has order n.
The binomial identity ( 𝑥 + 𝑦 ) 𝑝 = 𝑥 𝑝 + 𝑦 𝑝 ( x + y ) p = x p + y p in characteristic p makes Frobenius a field endomorphism. In characteristic p, a field is perfect precisely when this map is surjective and hence an automorphism; all finite fields are perfect because an injective self-map of a finite set is surjective . In number-field reduction , a Frobenius element at P above p acts on the upstairs residue field 𝜅 ( 𝑃 ) κ ( P ) by 𝑥 ↦ 𝑥 𝑞 x ↦ x q , where 𝑞 = | 𝜅 ( 𝑝 ) | q = | κ ( p ) | is the base residue-field size. That action is a field Frobenius automorphism, but the Frobenius element also records how it lifts into the number-field Galois group .
Example For 𝐹 8 / 𝐹 2 F 8 / F 2 , 𝑥 ↦ 𝑥 2 x ↦ x 2 is an automorphism of order 3, and applying it three times gives 𝑥 ↦ 𝑥 8 = 𝑥 x ↦ x 8 = x .
Meaning scope General or domain usage. Field theory in positive characteristic. The p-power Frobenius is always an injective field endomorphism and is an automorphism exactly for a perfect field; finite fields are perfect. This is distinct from a Frobenius element attached to a prime in a number-field extension .
Scope This is the power-map automorphism in characteristic p, distinct from a Frobenius element or conjugacy class attached to a prime .
Not this On 𝐹 𝑞 F q , the q-power map is the identity; calling it a nontrivial generator of 𝐺 𝑎 𝑙 ( 𝐹 𝑞 / 𝐹 𝑝 ) G a l ( F q / F p ) would confuse q-power and p-power Frobenius.
Reader rule On every field of characteristic p the p-power map is injective , but it need not be surjective on an infinite imperfect field. On 𝐹 𝑞 F q itself, 𝑥 ↦ 𝑥 𝑞 x ↦ x q is the identity. On 𝐹 𝑞 𝑚 F q m over 𝐹 𝑞 F q , the q-power map is an automorphism of order m and generates 𝐺 𝑎 𝑙 ( 𝐹 𝑞 𝑚 / 𝐹 𝑞 ) G a l ( F q m / F q ) .
Other names, related terms and sources
Also shown as field Frobenius, p-power Frobenius, q-power Frobenius
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 283 (prerequisite_dependency)
frobenius_automorphism · mathematical concept Generated from the governed public vocabulary for Plectis.
Frobenius element General or domain usage A Frobenius element is a field symmetry attached to an unramified prime in a finite Galois extension of number fields ; it describes a power map after reduction modulo a chosen prime above it.
Other names, related terms and sources
Also shown as Frobenius conjugacy class
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 283 (mathematical_source)
frobenius_element · mathematical concept Generated from the governed public vocabulary for Plectis.
frontend General or domain usage A front end is the part of a software system through which a user interacts with it.
It may present screens, controls, and views over data supplied by a back end . In the site's “Why” walkthrough, the term refers to the larger system's operator interface shown in the videos.
Both can present views of related source objects. Their appearance alone does not establish which actions or private data are available through each interface .
Example Three videos show the operator frontend at three lengths; the repository checks provide the validation records .
Scope Recordings establish what was on screen when they were made. They do not make the unpublished interface part of the public release .
Not this This public website is a frontend in the ordinary sense, but it is not the unpublished operator interface named in the Why section.
Reader rule That demonstrated interface has a different scope from the public website you are reading.
Other names, related terms and sources
Also shown as front end
front_end · public projection Generated from the governed public vocabulary for Plectis.
frontier System-local specialization Here, the mathematical frontier is the stated boundary between established results and unresolved questions for a problem.
A useful account identifies the strongest relevant results, the assumptions still needed, and the approaches that have been ruled out. It helps another researcher choose a next question without reconstructing all earlier work.
Moving the frontier requires a meaningful mathematical change, such as removing a hypothesis or proving a new obstruction . More declarations or a new presentation alone do not show that change.
Example The #249 frontier states a criterion exactly equivalent to irrationality and names the one ingredient it still lacks.
Meaning scope System-local specialization. On this site a frontier is a proved/open boundary, not a difficulty score, a ranking, or a claim that a solution is close.
Scope Covers the per-problem boundary on the problem pages and in the papers , and the project-level observation that those boundaries may move with new models . The agent workflow that starts from a frontier has its own entry , research shift .
Not this A long list of checked lemmas is not a frontier unless it also says what remains open .
Reader rule A convenient intermediate target is not automatically equivalent to the original problem.
Other names, related terms and sources
Also shown as results and remaining work
Search handles remaining work
frontier · public projection Generated from the governed public vocabulary for Plectis.
function General or domain usage A mathematical function assigns one output to each allowed input; a software function is a callable piece of code.
Mathematically, a function specifies a domain, a codomain , and an assignment: 𝑓 ( 𝑛 ) = 𝑛 2 f ( n ) = n 2 sends each integer to its square. A software function runs instructions when called and may return a value, change state, report an error, or fail to terminate.
Software behaviour can depend on arguments and surrounding state. Treating code as an implementation of a mathematical function requires specifying those inputs and checking the intended behaviour. A shared name does not establish that correspondence.
Example Euler's totient function assigns to n the number of positive integers up to n that are coprime to n.
Scope Distinguishes mathematical assignments from software callables; the local domain or programming contract fixes the details.
Not this A mathematical relation assigning two different outputs to the same input is not a function into that output space; returning a set as one output is a different construction.
Reader rule Different mathematical inputs may have the same output, but each input in the domain has exactly one output.
Other names, related terms and sources
Also shown as mathematical function, mapping
Search handles functions
function · mathematical concept Generated from the governed public vocabulary for Plectis.
function composition General or domain usage Function composition applies one function to the output of another.
The notation 𝑔 ∘ 𝑓 g ∘ f means “first f, then g,” so ( 𝑔 ∘ 𝑓 ) ( 𝑥 ) = 𝑔 ( 𝑓 ( 𝑥 ) ) ( g ∘ f ) ( x ) = g ( f ( x ) ) . If 𝑓 ( 𝑥 ) = 𝑥 + 1 f ( x ) = x + 1 and 𝑔 ( 𝑥 ) = 2 𝑥 g ( x ) = 2 x , then 𝑔 ∘ 𝑓 g ∘ f gives 2 𝑥 + 2 2 x + 2 , while 𝑓 ∘ 𝑔 f ∘ g gives 2 𝑥 + 1 2 x + 1 .
The same idea connects stages of a software pipeline , but effects, errors, and state may add conditions beyond a mathematical function 's domain. A valid sequence of individually defined operations still needs compatible inputs and outputs at each connection.
Scope The first function 's outputs must lie in the second function 's domain, and the order generally matters.
Other names, related terms and sources
Also shown as composition of functions, composite function
Source refs governed vocabulary term_registry (reading_context)
function_composition · mathematical concept Generated from the governed public vocabulary for Plectis.
function domain General or domain usage The domain of a function is the set of inputs on which that function is defined.
For 𝑓 ( 𝑥 ) = 1 / 𝑥 f ( x ) = 1 / x over the real numbers , zero must be excluded from the domain. The formula alone does not determine every permitted input: the same expression can be considered on integers , real numbers , or complex numbers with different restrictions.
Changing the domain changes the mathematical function and can change properties such as injectivity or continuity. In software , a function 's accepted arguments and preconditions play a related role; a website domain is a different meaning of the word.
Scope Statements about every input of a function quantify over its declared domain.
Other names, related terms and sources
Also shown as domain of a function, input domain
Source refs governed vocabulary term_registry (reading_context)
function_domain · mathematical concept Generated from the governed public vocabulary for Plectis.
G
Galois closure General or domain usage The Galois closure of a finite separable field extension is the smallest Galois extension containing it, inside a chosen algebraic closure.
It adjoins all conjugate copies of the original extension so its algebraic symmetries act within one field. For a number field , separability holds automatically.
In #243, a hypothetical nonsquare 𝛼 2 − 1 α 2 − 1 gives 𝐾 ( 𝛽 ) K ( β ) with 𝛽 2 = 𝛼 2 − 1 β 2 = α 2 − 1 . The proof takes its Galois closure over ℚ Q so the sign-changing automorphism can be expressed through Frobenius behavior at suitable primes . This produces the contradiction with the square condition in the prime field.
Scope The closure can be larger than the original extension. Its defining minimality is taken inside the chosen algebraic closure; it does not mean that every field extension is already Galois.
Other names, related terms and sources
Also shown as Galois closures
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-field (mathematical_source)
galois_closure · mathematical concept Generated from the governed public vocabulary for Plectis.
Galois extension General or domain usage A Galois extension 𝐿 / 𝐾 L / K is an algebraic field extension that is normal, so it contains every conjugate root required by its equations over K, and separable, so those roots are distinct.
For example, 𝑄 ( 𝑖 ) / 𝑄 Q ( i ) / Q is Galois: the polynomial 𝑥 2 + 1 x 2 + 1 splits into the two distinct roots i and − 𝑖 − i inside 𝑄 ( 𝑖 ) Q ( i ) . Its automorphisms fixing Q are the identity and complex conjugation. By contrast, 𝑄 ( 3 √ 2 ) / 𝑄 Q ( 2 3 ) / Q omits the two nonreal conjugates of 3 √ 2 2 3 , so it is not normal and therefore not Galois.
Normality says that if an irreducible polynomial over K has one root in L, then all of its roots lie in L. Separability says those roots are distinct rather than repeated. Together these conditions make the K-fixing automorphisms of L rich enough to form the Galois group G a l ( 𝐿 / 𝐾 ) Gal ( L / K ) , which permutes conjugate roots while preserving every arithmetic relation over K. The paper places several algebraic quantities inside one finite Galois extension so a chosen automorphism can later be realized as Frobenius behavior at suitable primes .
Example For example, 𝑄 ( 𝑖 ) / 𝑄 Q ( i ) / Q is Galois: the polynomial 𝑥 2 + 1 x 2 + 1 splits into the two distinct roots i and − 𝑖 − i inside 𝑄 ( 𝑖 ) Q ( i ) .
Meaning scope General or domain usage. The Galois property is relative to the chosen base field and combines normality with separability.
Scope Galois is relative to a named base field K. In characteristic zero, algebraic extensions are separable, but normality still must be checked . The equality | A u t ( 𝐿 / 𝐾 ) | = [ 𝐿 : 𝐾 ] | Aut ( L / K ) | = [ L : K ] characterizes the Galois property only for finite extensions; infinite Galois groups also carry a natural topology.
Other names, related terms and sources
Also shown as finite Galois extension
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 280 (mathematical_source)
galois_extension · mathematical concept Generated from the governed public vocabulary for Plectis.
Galois group General or domain usage The Galois group G a l ( 𝐿 / 𝐾 ) Gal ( L / K ) is the group of field automorphisms of L that fix every element of K.
For 𝑄 ( 𝑖 ) / 𝑄 Q ( i ) / Q the group has two elements: the identity and complex conjugation. Composition is the group operation. For a finite Galois extension , the group size equals the extension degree.
The paper selects an automorphism with prescribed action on algebraic quantities, then uses Chebotarev to realize its conjugacy class as Frobenius behavior at infinitely many primes .
Example For 𝑄 ( 𝑖 ) / 𝑄 Q ( i ) / Q the group has two elements: the identity and complex conjugation.
Meaning scope General or domain usage. The allowed automorphisms preserve field operations and fix the chosen base field. Arbitrary permutations of roots need not qualify.
Scope The base field is part of the notation and changes the group. Automorphisms must preserve addition and multiplication and fix K pointwise; arbitrary permutations of elements or roots do not qualify.
Other names, related terms and sources
Also shown as group of field automorphisms
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 281 (mathematical_source)
galois_group · mathematical concept Generated from the governed public vocabulary for Plectis.
gate General or domain usage A gate is a checkpoint that permits an action only when specified conditions are satisfied.
Plectis uses gates before changes or publication that require evidence , such as a successful check or a matching source version. The gate records which requirement determined its decision.
It cannot establish requirements that it never examines. A blocked gate can indicate missing evidence , a failing check , or an unavailable dependency , and those cases may require different next steps.
Example A link-integrity gate can block publication when an internal anchor does not resolve.
Scope A gate covers the input conditions and downstream permission declared by its rule.
Not this A warning with no effect on any action is not a blocking gate.
Reader rule A gate's pass means that its particular conditions were met.
Other names, related terms and sources
Also shown as quality gate, release gate
Search handles gates
gate · public projection Generated from the governed public vocabulary for Plectis.
Gaussian binomial coefficient General or domain usage A Gaussian binomial coefficient is the q-analogue of an ordinary binomial coefficient , written [n choose k ]_q and defined by a product of q-power differences.
Other names, related terms and sources
Also shown as q-binomial coefficient, Gaussian binomial polynomial
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 563 (mathematical_source)
gaussian_binomial_coefficient · mathematical concept Generated from the governed public vocabulary for Plectis.
generalise-up-propagate System-coined term Generalise-up-propagate means turning a supported local lesson into guidance that future relevant work will actually encounter.
local lesson becomes general
Plectis first identifies what the case teaches and how broadly the lesson applies. It then places the refinement in an existing rule, skill , standard , or other source used by the affected workflow.
The change should preserve the source case and its limits . Updating the shared owner can prevent repeated mistakes more effectively than adding another isolated note.
Example Axiom AX-8, provenance propagation and non-interference, is one such durable rule: a lesson about keeping a record of where a result came from, raised to a system-wide invariant with its own stated limits .See it live: Provenance propagation and non-interference open the doctrine rule this propagation produced
Meaning scope System-coined term. Generalise/up-propagate is the two-step move from a local lesson to its smallest honest durable owner; it does not promote every observation into doctrine or overwrite source authority .
Scope The term covers how knowledge moves from specific work into shared doctrine across the system. A reader meets it in the doctrine and propagation rules, where local findings are turned into bounded , reusable invariants .
Not this Generalise-up-propagation is not the same as simply saving or filing a note. It does not assume one case proves a universal truth: the broader rule is only valid with its applicability and not-when boundaries attached.
Reader rule A single example should not become a universal rule without an argument for that scope .
Other names, related terms and sources
Also shown as generalize_up_propagate, generalise-uppropagate, generalize-uppropagate
Search handles generalise up propagate, generalize up propagate, generalized up-propagation, generalised up-propagation
Source refs doctrine module local_to_general_propagation (paper_module)
generalise_up_propagate · propagation Generated from the governed public vocabulary for Plectis.
generating function General or domain usage A generating function encodes a sequence as coefficients of a power series ; the ordinary version is 𝐴 ( 𝑧 ) = ∑ 𝑛 ≥ 0 𝑎 𝑛 𝑧 𝑛 A ( z ) = ∑ n ≥ 0 a n z n .
Other names, related terms and sources
Also shown as ordinary generating function, generating functions
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::eq:weight-generating-function (mathematical_source)
generating_function · mathematical concept Generated from the governed public vocabulary for Plectis.
geodesic General or domain usage A curve that is locally straight according to the geometry of its surrounding space.
On a flat torus , geodesics lift to straight lines in Euclidean space. A line whose direction is proportional to a nonzero lattice vector gives a closed geodesic; an irrational direction on a two-dimensional torus instead gives a dense nonclosed line.
The #269 walls are closed geodesics because they are defined by integer linear equations modulo 1. Each wall family can have several components when its integer normal vector has a common factor . The proof counts their intersections and faces; it does not use a shortest-path claim .
Meaning scope General or domain usage. Local straightness depends on the metric ; the paper uses the flat quotient metric .
Scope A geodesic need not be the globally shortest route between its endpoints . A segment can wind around a torus before reaching an endpoint that is nearby by another route.
Other names, related terms and sources
Also shown as geodesics, closed geodesic, closed geodesics
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:res:dp-two-walls (mathematical_source)
geodesic · mathematical concept Generated from the governed public vocabulary for Plectis.
geometric majorant General or domain usage A geometric majorant bounds terms or their magnitudes by a geometric sequence with a fixed ratio.
If | 𝑎 𝑁 + 𝑘 | ≤ 𝐶 𝑟 𝑘 | a N + k | ≤ C r k for 𝑘 ≥ 0 k ≥ 0 and 0 ≤ 𝑟 < 1 0 ≤ r < 1 , the entire tail's absolute sum is at most 𝐶 / ( 1 − 𝑟 ) C / ( 1 − r ) . This turns infinitely many bounds into a usable finite estimate.
Rapidly growing factorial denominators can supply such comparisons. The starting index matters because a ratio bound may fail for early terms even when it holds for all later ones.
Scope The same ratio and initial bound must work throughout the claimed tail.
Other names, related terms and sources
Also shown as geometric upper bound, dominating geometric series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos68-factorial-reasoning-surface.tex::line 333 (mathematical_source)
geometric_majorant · mathematical concept Generated from the governed public vocabulary for Plectis.
geometric series General or domain usage A geometric series adds terms formed by repeatedly multiplying an initial value by a fixed number.
Its terms are a, ar, 𝑎 𝑟 2 a r 2 , and so on, where a is the initial value and r is the common multiplier. When | 𝑟 | < 1 | r | < 1 , the infinite sum is 𝑎 / ( 1 − 𝑟 ) a / ( 1 − r ) ; for example, 1 + 1 / 2 + 1 / 4 + … = 2 1 + 1 / 2 + 1 / 4 + … = 2 .
Geometric series and their differentiated forms give explicit bounds for analytic tails and their first and second derivatives in the lemniscate paper .
Scope For a nonzero initial value, the infinite sum converges exactly when | 𝑟 | < 1 | r | < 1 . With initial value zero, every term and the sum are zero.
Other names, related terms and sources
Also shown as geometric progression series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 698 (mathematical_source)
geometric_series · mathematical concept Generated from the governed public vocabulary for Plectis.
Git Externally anchored Git is a version-control system that records snapshots of files and the history connecting them.
A commit identifies a stored snapshot , its parent history, and a message. Branches name lines of development, and differences between commits show how tracked content changed.
The repositories use Git revisions to identify the source behind a paper , check , or generated page. Sharing a revision lets another person obtain the same tracked content rather than an unspecified current copy.
Example The audit rerun was pinned to plectis at commit 9539695.
Scope Git is maintained by its own community and is external to this work.
Reader rule Uncommitted edits are part of a working copy, not yet part of a recorded commit .
Sources
git · public projection Generated from the governed public vocabulary for Plectis.
Git branch General or domain usage A Git branch is a movable name that points to a commit and normally advances along one line of repository history.
Creating a branch gives new commits a separate history label so work can diverge and later be compared or merged. The branch itself is a reference , not a copied directory or complete second repository .
The word branch also names a decision path, a tree limb, or an organizational division, but a Git branch has precise reference semantics. It points to one commit and moves when new commits are added or the reference is explicitly changed. Several branches can point to the same commit , and deleting a branch name does not immediately erase reachable commits . Merging combines histories according to Git’s rules; it does not prove semantic compatibility. A worktree may provide separate files, but that checkout is not the branch itself.
Scope Git branch identity consists of a movable reference and its commit history; working directories and worktrees are separate checkouts that may point at branches or detached commits .
Other names, related terms and sources
Also shown as Git branches, repository branch, version-control branch
Source refs sites/microcosm/docs/paper-module-batch8-compliance-pipeline-capsule.html (reading_context) sites/microcosm/docs/paper-module-batch9-macro-engines-capsule.html (reading_context)
git_branch · public projection Generated from the governed public vocabulary for Plectis.
GitHub Externally anchored GitHub is a service for hosting Git repositories and tools for collaboration around them.
It provides interfaces for browsing files and history, discussing issues, reviewing changes, and publishing releases . GitHub Pages can serve static websites from a repository 's published content.
The links on this site lead to public source and related artifacts . A hosted file's presence establishes availability, while its correctness and evidence status must be assessed from the work itself.
Example The Plectis repository link opens the public source hosted on GitHub.
Scope GitHub covers the hosted repositories , pages, and account-controlled services explicitly linked from this site.
Not this A project being on GitHub does not mean it is peer-reviewed , secure, maintained, or correct.
Reader rule Git is the version-control system; GitHub is one service that hosts repositories using it.
Other names, related terms and sources
Also shown as GitHub repository
Search handles github.com, GitHub Pages
github · external service Generated from the governed public vocabulary for Plectis.
govern General or domain usage To govern a process is to define how its decisions are made, authorised , and checked .
In Plectis, this includes assigning source authority , setting rules for changes, and specifying evidence required before an action proceeds. The relevant rule should be discoverable where the action is performed.
To assess a governed process, inspect both its stated contract and the mechanism applying it. Recorded decisions can then show whether the rule had the intended effect in a particular case.
Example The term registry governs which definitions the public glossary projects.
Scope The term covers rules and authority relationships over vocabulary, evidence , artifacts , and mutations.
Not this A convention no process checks or follows does not effectively govern the work.
Reader rule A written rule and an enforced rule are different states of implementation .
Other names, related terms and sources
Also shown as governs, governed, governing, governance
govern · public projection Generated from the governed public vocabulary for Plectis.
gradient General or domain usage For a differentiable real-valued function in Euclidean coordinates, the gradient is the vector of its first partial derivatives .
For 𝑢 ( 𝑥 , 𝑦 ) = 𝑥 2 + 𝑦 2 u ( x , y ) = x 2 + y 2 , the gradient is ( 2 𝑥 , 2 𝑦 ) ( 2 x , 2 y ) . Where it is nonzero, its direction gives the steepest local increase per unit distance ; the opposite direction gives the steepest decrease. At a zero gradient there is no such preferred first-order direction.
The Newton-flow discussion relates trajectories to gradients of real-valued quantities formed from a complex polynomial , such as | 𝑝 | 2 | p | 2 . A gradient of such a quantity is different from the polynomial ’s complex derivative .
Meaning scope General or domain usage. Multivariable calculus and dynamics. Distinct from a visual color gradient.
Scope On more general geometric spaces, the gradient depends on the chosen metric , which specifies how directions and lengths are compared.
Other names, related terms and sources
Also shown as gradient field
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 2284 (mathematical_source)
gradient · mathematical concept Generated from the governed public vocabulary for Plectis.
Gram matrix General or domain usage The Gram matrix of vectors 𝑣 1 , … , 𝑣 𝑛 v 1 , … , v n has entries 𝐺 𝑖 𝑗 = ⟨ 𝑣 𝑖 , 𝑣 𝑗 ⟩ G i j = ⟨ v i , v j ⟩ , recording every pairwise inner product .
Other names, related terms and sources
Also shown as Gramian
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 1468 (mathematical_source)
gram_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
graph General or domain usage A graph can mean vertices joined by edges, or the set of input–output pairs of a function .
A dependency graph represents objects as vertices, also called nodes, and their relationships as edges. A function ’s graph instead consists of pairs ( 𝑥 , 𝑓 ( 𝑥 ) ) ( x , f ( x ) ) ; plotting those pairs draws a curve or surface when the setting permits it. The surrounding argument determines which meaning applies.
The website’s content graph uses the vertex-and-edge sense: pages, statements, and terms are objects connected by named relationships. A directed edge records an ordered relation, such as one statement depending on another. Drawing two vertices close together does not add an edge. In analysis, the graph of 𝑓 ( 𝑥 ) = 𝑥 2 f ( x ) = x 2 is the set of pairs ( 𝑥 , 𝑥 2 ) ( x , x 2 ) , a different construction from this relationship network. Neither meaning makes the display’s visual appearance a substitute for its underlying definition.
Scope An abstract graph need not be drawn, connected, or contain any edges. A function graph need not be a continuous curve.
Other names, related terms and sources
Also shown as graphs, directed graph, relationship graph
graph · public projection Generated from the governed public vocabulary for Plectis.
graph edge General or domain usage A graph edge connects vertices according to the graph ’s declared relation.
In a dependency graph , an arrow from A to B might mean that A depends on B. An undirected edge has no preferred direction. Graph conventions determine whether a vertex can connect to itself and whether several edges can share the same endpoints .
The site’s content graph distinguishes relations such as “defined in”, “depends on”, and “generated from”. Following an edge is meaningful only with its relation type: a citation is not automatically a proof dependency . Some mathematical graphs allow loops or multiple edges and others exclude them, so those conventions belong to the graph ’s definition. An edge can exist without being drawn as a visible line, and two displayed nodes need not be connected merely because they are close together.
Scope The endpoints , direction, and relation type determine what an edge asserts; a connection alone does not establish causation or logical implication .
Other names, related terms and sources
Also shown as graph edges, relationship edge
edge · public projection Generated from the governed public vocabulary for Plectis.
graph node General or domain usage A graph node, also called a vertex, is one of the objects that a graph ’s edges can connect.
A node can represent a page, person, theorem , machine, or other object. Its identity makes it distinguishable within the graph ; labels and other attributes are additional data. A node may have no incident edges and still belong to the graph .
The website uses node identifiers to connect statements, proof declarations , and public pages across several views. One mathematical object can have more than one representation when the graph intentionally distinguishes versions or roles, but those distinctions must be explicit. A diagram is one way to display the structure rather than the structure’s definition. In other computing contexts, a network node can be a participating device or process; the graph interpretation depends on the network being modelled.
Scope What a node represents comes from the graph ’s definition; a node’s visual position does not by itself give its relationships.
Other names, related terms and sources
Also shown as graph nodes, graph vertex
node · public projection Generated from the governed public vocabulary for Plectis.
greatest common divisor General or domain usage For integers not all zero, the greatest common divisor is the largest positive integer dividing every one of them.
Scope Signs do not affect the nonnegative gcd. By convention g c d ( 0 , 0 ) = 0 gcd ( 0 , 0 ) = 0 , and g c d ( 𝑎 , 0 ) = | 𝑎 | gcd ( a , 0 ) = | a | ; these cases require care when describing the gcd as a largest positive divisor .
Other names, related terms and sources
Also shown as gcd, greatest common factor, highest common factor
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 337 (mathematical_source)
greatest_common_divisor · mathematical concept Generated from the governed public vocabulary for Plectis.
Green function General or domain usage A harmonic function away from a specified pole, with a prescribed singularity there and prescribed boundary behaviour.
For a regular compact planar set K of positive capacity, the Green function of the unbounded component of its complement, with pole at infinity, vanishes on the boundary and behaves as l o g | 𝑧 | − l o g c a p ( 𝐾 ) + 𝑜 ( 1 ) log | z | − log cap ( K ) + o ( 1 ) . A finite pole instead has singularity − l o g | 𝑧 − 𝑎 | − log | z − a | in the positive planar convention.
The #1041 capacity refinement sums exterior Green-function values at roots outside the chosen component . These values encode how the excluded roots reduce the component capacity, making the geometric hypothesis more precise than its root count.
Meaning scope General or domain usage. The paper uses planar logarithmic Green functions; this is not a definition of every Green operator or every higher-dimensional kernel .
Scope State the domain, pole, normalization and boundary condition. Green functions need not exist on every domain, and continuous vanishing at every boundary point requires boundary regularity. A pole at infinity is different from a finite pole.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1427 (mathematical_source)
green_function · mathematical concept Generated from the governed public vocabulary for Plectis.
grounding General or domain usage Grounding connects a statement or decision to the information that gives it meaning and support .
For a factual claim , that may be a source or observation. For a system term, it may be the code and records defining its local use. Plectis expects important explanations to retain those connections.
A source link improves inspectability but does not settle interpretation by itself. The reader still needs to check that the source supports the wording and scope .
Example A definition grounded in the term registry can be traced to its registry row and public projection fields.
Scope The term covers evidence , source , and context links used to support public explanations and system decisions.
Not this Adding a citation that merely mentions the topic does not ground the specific claim .
Reader rule The source must be relevant to the actual claim , not merely related to its subject.
Other names, related terms and sources
Also shown as grounded, ground, evidence grounding
grounding · public projection Generated from the governed public vocabulary for Plectis.
guinea pig General or domain usage “Guinea pig” is an informal term for a person or case on which an experimental method is tried .
The phrase draws attention to who bears the uncertainty, inconvenience, or consequences of the trial. In descriptions of this project, it concerns the experience of trying an unfinished workflow or method.
The metaphor does not establish that a method works or that its effects generalise. A trial can reveal useful failures while leaving wider effectiveness and suitability unresolved.
Example Publishing failed routes and remaining obligations , rather than only the green checks , is what a guinea-pig record looks like.
Scope Names the experimental subject. It does not name a clinical trial, a product test panel, or a claim of representative sampling.
Not this Calling readers guinea pigs because they opened the site would invert the sentence on the page.
Reader rule An experimental use should be understood through its actual conditions and limits .
Other names, related terms and sources
Also shown as guinea pigs
Search handles guineapig
guinea_pig · public projection Generated from the governed public vocabulary for Plectis.
H
Haar measure General or domain usage A Haar measure is a nonzero translation-invariant regular Borel measure, finite on compact sets , on a locally compact Hausdorff group.
A left Haar measure assigns the same mass to a measurable set and any left translate of it, and is finite on compact sets . It is unique up to a positive scale; on a compact group it can be normalized to total mass one.
The #257 note uses normalized Haar measure on the compact additive group of profinite integers . Each finite residue quotient is uniform, letting divisibility events be evaluated without choosing a finite truncation as the permanent probability model .
Meaning scope General or domain usage. The locally compact Hausdorff group measure is intended. Compact -group normalization gives the local probability measure ; Haar measure on a general noncompact group is not automatically a probability law .
Scope Specify left or right invariance when it matters. On a noncompact locally compact Hausdorff group, Haar measure has infinite total mass and cannot be normalized to a probability measure .
Other names, related terms and sources
Also shown as Haar measures, Haar probability measure, Haar probability
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
haar_measure · mathematical concept Generated from the governed public vocabulary for Plectis.
Hankel determinant General or domain usage A Hankel determinant is the determinant of a matrix whose entries are constant along each anti-diagonal.
Scope Some versions shift the starting index . The determinant need not be positive for an arbitrary sequence ; positivity needs additional structure.
Other names, related terms and sources
Also shown as Hankel determinants
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex (mathematical_source)
hankel_determinant · mathematical concept Generated from the governed public vocabulary for Plectis.
hard-coded General or domain usage Hard-coded means a value or choice is written directly into code or content instead of being supplied through configuration , input, or a separate source .
Hard-coding can cause drift when the value represents changing state, because updates require another manual edit. It can also be the clearest correct choice for stable constants, protocol markers, fixed limits , test fixtures , or behavior intentionally owned by that code.
The defect is not literal syntax by itself. A mathematical constant, file signature, compatibility token, or deliberately fixed policy default may belong directly in source . Trouble arises when independently changing information is copied without provenance , validation , or regeneration, producing several apparent authorities . Alternatives include configuration , lookup, dependency injection, computed projection , or generated code, each carrying different complexity and failure modes . A sound design states who owns the value, how changes propagate, and whether divergence can be detected.
Example A protocol marker intended never to vary may be hard-coded appropriately; a live component count is safer when generated from its registry .
Scope Hard-coded describes where a value is owned, not whether that choice is good or bad.
Not this A value read from configuration or computed from an authoritative source is not hard-coded at the use site.
Reader rule Judge hard-coding by the value’s authority and expected rate of change: fixed ownership can be appropriate, while copied runtime facts need a refresh path.
Other names, related terms and sources
Also shown as hardcoded
hard_coded · public projection Generated from the governed public vocabulary for Plectis.
Hardy–Littlewood prime-tuple conjecture General or domain usage The Hardy–Littlewood prime-tuple conjecture predicts an asymptotic count of simultaneous prime translates of each fixed admissible set of shifts.
For a fixed nonempty admissible set 𝐻 = { ℎ 1 , … , ℎ 𝑘 } H = { h 1 , … , h k } of distinct integer shifts, it predicts # { 1 ≤ 𝑛 ≤ 𝑥 : 𝑛 + ℎ 𝑖 i s p r i m e f o r e v e r y 𝑖 } ∼ 𝔖 ( 𝐻 ) ∫ 𝑥 2 ( l o g 𝑡 ) − 𝑘 𝑑 𝑡 # { 1 ≤ n ≤ x : n + h i is prime for every i } ∼ S ( H ) ∫ 2 x ( log t ) − k d t as 𝑥 → ∞ x → ∞ . The singular series supplies the local congruence correction.
#251 discusses a version with 𝑘 ≤ ( l o g l o g 𝑥 ) 3 k ≤ ( log log x ) 3 , shifts in [ 0 , ( l o g 𝑥 ) 2 ] [ 0 , ( log x ) 2 ] , and error at most 𝐶 𝑥 1 − 𝛿 C x 1 − δ . Constants are chosen before the tuple. The paper assumes none of these hypotheses; the cited irrationality and normality results remain conditional .
Meaning scope General or domain usage. This row concerns the prime k-tuples conjecture , not the differently named second Hardy–Littlewood conjecture . Fixed-tuple and quantified uniform versions have distinct logical strength.
Scope The usual fixed-tuple asymptotic gives no uniform rate for tuples whose sizes or shifts grow with the parameter. Such uniform versions are stronger hypotheses.
Other names, related terms and sources
Also shown as Hardy-Littlewood prime-tuple conjecture, Hardy–Littlewood k-tuples conjecture, Hardy-Littlewood k-tuples conjecture
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::lines 487–497 (mathematical_source)
hardy_littlewood_prime_tuple_conjecture · mathematical concept Generated from the governed public vocabulary for Plectis.
harmonic extension General or domain usage A harmonic extension fills boundary data into a domain by a harmonic function that takes those boundary values, when the relevant Dirichlet problem is solvable.
On the unit disc , continuous boundary data can be extended using the Poisson integral. Constant boundary data extend constantly; oscillatory Fourier modes decay toward the center according to their frequency.
The paper extends boundary information harmonically so interior estimates can be derived from boundary averages and maximum principles . The extension acts as a controlled interpolant rather than introducing new independent analytic data.
Example On the unit disc , continuous boundary data can be extended using the Poisson integral.
Meaning scope General or domain usage. The boundary data and allowed function class determine the extension problem. Harmonicity alone does not guarantee existence or uniqueness.
Scope Existence and uniqueness depend on the domain and the function class. “Extension” means agreement in the appropriate boundary sense, which may be continuous or almost everywhere. Harmonic does not mean holomorphic , though real and imaginary parts of holomorphic functions are harmonic.
Other names, related terms and sources
Also shown as Poisson extension
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 425 (mathematical_source)
harmonic_extension · mathematical concept Generated from the governed public vocabulary for Plectis.
harmonic function General or domain usage A harmonic function has continuous second derivatives and a zero Laplacian, the sum of its pure second partial derivatives .
A harmonic function is locally balanced: its value at the centre of a sufficiently small ball equals its average over that ball or its boundary. For example, 𝑥 2 − 𝑦 2 x 2 − y 2 is harmonic on the plane because its pure second derivatives , 2 and − 2 − 2 , cancel.
A harmonic function u on an open region satisfies Δ 𝑢 = 0 Δ u = 0 , where the Laplacian adds the second derivative in every coordinate direction. Harmonic functions obey the mean-value property: the value at the centre of a sufficiently small ball equals the average on its boundary or interior. Consequently, a nonconstant harmonic function cannot attain a maximum or minimum strictly inside a connected domain. In two dimensions , the real and imaginary parts of holomorphic functions are harmonic. A harmonic conjugate exists locally, and globally on simply connected domains, but topology can obstruct a single global conjugate.
Example On the plane, 𝑢 ( 𝑥 , 𝑦 ) = 𝑥 2 − 𝑦 2 u ( x , y ) = x 2 − y 2 is harmonic because its two pure second derivatives cancel.
Meaning scope General or domain usage. Harmonic analysis is a larger subject; not every object described as a harmonic mode is itself a harmonic function in this sense.
Scope Check the domain and regularity; in the plane, real and imaginary parts of holomorphic functions are harmonic, but a general harmonic function need not be globally the real part of one on a domain with holes.
Not this The function x squared plus y squared is not harmonic because its Laplacian is 4.
Other names, related terms and sources
Also shown as harmonicity
harmonic_function · mathematical concept Generated from the governed public vocabulary for Plectis.
harmonic measure General or domain usage A measure describing how strongly different parts of a domain boundary influence a harmonic value at a chosen interior point.
For a sufficiently regular bounded domain D, continuous boundary data h determine a harmonic extension 𝑢 ( 𝑧 ) = ∫ ℎ ( 𝜉 ) 𝑑 𝜔 𝐷 ( 𝑧 , 𝜉 ) u ( z ) = ∫ h ( ξ ) d ω D ( z , ξ ) . The measure 𝜔 𝐷 ( 𝑧 , ⋅ ) ω D ( z , ⋅ ) depends on the base point z. At the centre of the disc it is uniform angular measure; elsewhere it is weighted by the Poisson kernel .
In #1041, pushing the uniform circle measure through a Blaschke product produces harmonic measure seen from 𝐵 ( 0 ) B ( 0 ) . Comparing its density with the inverse-branch boundary weights gives a bound on the capacity of the selected polynomial component .
Meaning scope General or domain usage. This row concerns planar boundary harmonic measure; continuous boundary-value formulas require the stated regularity, and uniform arclength is a special case.
Scope Harmonic measure is generally different from uniform boundary length. Conformal maps transport it, but an arc-length density needs boundary regularity and the appropriate derivative factor . The domain and base point must be specified.
Other names, related terms and sources
Also shown as harmonic measures, boundary harmonic measure
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1962 (mathematical_source)
harmonic_measure · mathematical concept Generated from the governed public vocabulary for Plectis.
harness General or domain usage A test harness is the code and setup that runs a test and captures its result.
It supplies inputs, prepares the environment , invokes the thing being tested, and records or compares outputs. Plectis uses harnesses to make a component 's advertised check executable.
Its own behaviour matters: a harness that runs the wrong command or ignores a failure can produce a misleading pass. Negative cases help check that relevant failures are actually detected.
Example A replay harness feeds a recorded scenario through a component and asserts the outcome.
Scope A harness establishes results for the scenarios it runs.
Reader rule The harness is separate from both the component and the claim being tested.
Other names, related terms and sources
Also shown as test harness
harness · public projection Generated from the governed public vocabulary for Plectis.
hausdorff measure General or domain usage Hausdorff measure measures a set by covering it with arbitrarily small pieces and summing powers of their diameters.
The one-dimensional version measures length: it agrees with arc length for a simple rectifiable curve , and also applies to connected sets with no chosen parametrisation.
For dimension s, first minimize 𝑐 𝑠 ∑ 𝑖 d i a m ( 𝑈 𝑖 ) 𝑠 c s ∑ i diam ( U i ) s over countable covers with diameters at most 𝛿 δ , then let 𝛿 δ decrease to zero; 𝑐 𝑠 c s fixes the standard normalization. The #1041 counterexample bounds one-dimensional Hausdorff measure of connecting sets, a statement distinct from a bound on a particular parametrised path.
Meaning scope General or domain usage. Geometric measure theory. Not Hausdorff distance and not the Hausdorff separation axiom .
Scope Specify the dimension and normalization. The measure of a curve’s image counts each location once; the length of a parametrised path counts retraced portions again.
Other names, related terms and sources
Also shown as Hausdorff length, one-dimensional Hausdorff measure
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 367 (mathematical_source) sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex (mathematical_source)
hausdorff_measure · mathematical concept Generated from the governed public vocabulary for Plectis.
Heine determinant identity General or domain usage An identity expressing a moment determinant as an integral or sum of a squared Vandermonde product .
For 𝑛 ≥ 1 n ≥ 1 and a finite positive measure 𝜇 μ on the real line with finite moments through degree 2 𝑛 − 2 2 n − 2 , d e t ( 𝜇 𝑖 + 𝑗 ) 𝑖 , 𝑗 < 𝑛 = 1 / 𝑛 ! ∫ … ∫ ∏ 𝑖 < 𝑗 ( 𝑥 𝑖 − 𝑥 𝑗 ) 2 𝑑 𝜇 ( 𝑥 1 ) … 𝑑 𝜇 ( 𝑥 𝑛 ) det ( μ i + j ) i , j < n = 1 / n ! ∫ … ∫ ∏ i < j ( x i − x j ) 2 d μ ( x 1 ) … d μ ( x n ) , where 𝜇 𝑘 = ∫ 𝑥 𝑘 𝑑 𝜇 μ k = ∫ x k d μ . For discrete weights, strictly increasing node indices remove the 1 / 𝑛 ! 1 / n ! factor ; pairwise distinct ordered tuples retain it.
In #1049 the nodes are powers of q and the weights are positive. The Heine expansion tracks displaced node tuples and shows why the initial tuple alone misses a nontrivial asymptotic constant. The identity is not Heine’s transformation of a basic hypergeometric series .
Meaning scope General or domain usage. The moment-determinant identity is intended; convergence and positivity depend on the stated moment measure or discrete weights.
Scope The moments and multiple integral must exist, with hypotheses justifying interchange. For a positive measure every summand is nonnegative, which is useful for limits and lower bounds . Signed weights remove that positivity advantage.
Other names, related terms and sources
Also shown as Heine moment identity, Heine expansion of a moment determinant
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 199 (mathematical_source)
heine_determinant_identity · mathematical concept Generated from the governed public vocabulary for Plectis.
hereditary property General or domain usage A property is hereditary under a specified restriction if every allowed restriction of an object retains that property.
Other names, related terms and sources
Also shown as hereditary criterion, hereditary support condition
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
hereditary_property · mathematical concept Generated from the governed public vocabulary for Plectis.
hessian matrix General or domain usage The square matrix of second partial derivatives of a scalar -valued function .
The Hessian records second-order change in a scalar -valued function . For 𝑓 ( 𝑥 , 𝑦 ) = 𝑥 2 − 𝑦 2 f ( x , y ) = x 2 − y 2 it has diagonal entries 2 and − 2 − 2 , showing upward curvature along one axis and downward curvature along the other at the origin.
For n variables , the Hessian is the 𝑛 × 𝑛 n × n matrix of second partial derivatives . Under continuous second differentiability , equality of mixed partials makes it symmetric. Its quadratic form, multiplied by one half, gives the second-order Taylor term. A semidefinite Hessian with zero directions needs further analysis: higher-order terms can change the classification. A singular Hessian can still be indefinite and establish a saddle , so singularity alone is not the classification rule.
Example For 𝑓 ( 𝑥 , 𝑦 ) = 𝑥 2 − 𝑦 2 f ( x , y ) = x 2 − y 2 , the Hessian is diagonal with entries 2 and -2, showing a saddle at the origin.
Meaning scope General or domain usage. A Hessian-scale model or Hessian bound refers to second-order behaviour even when the full matrix is not displayed.
Scope At a critical point of a twice continuously differentiable real function , positive or negative definiteness gives a strict local minimum or maximum, and indefiniteness gives a saddle .
Not this The Jacobian of a vector-valued map contains first derivatives and is not generally a Hessian.
Other names, related terms and sources
Also shown as Hessian
hessian_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
heuristic General or domain usage A heuristic is a practical rule or method that often finds a useful answer without guaranteeing the best or correct answer.
Heuristics reduce search or decision cost by using patterns, estimates, or experience. They are valuable when exact calculation is too expensive, but their limits should be tested against representative cases.
A heuristic may rank search results, choose a promising proof step, or estimate where to spend effort. It can be fast and useful while missing good answers on some inputs. A guaranteed algorithm also has assumptions ; the distinction is whether the claimed guarantee has been established for the case at hand. Plectis uses heuristic retrieval and planning to choose work, then checks the resulting evidence separately.
Example Ranking files by shared keywords is a heuristic for finding relevant source .
Meaning scope General or domain usage. A practical rule that guides search or choice without guaranteeing correctness or completeness.
Scope Treat a heuristic result as a candidate or ranking signal until a stronger check establishes the required claim .
Not this A Lean kernel accepting a proof is a formal check , not a heuristic guess.
Other names, related terms and sources
Also shown as heuristics, heuristic method
Source refs sites/microcosm/docs/paper-module-verifier-lab-kernel.html (reading_context)
heuristic · public projection Generated from the governed public vocabulary for Plectis.
hologram System-local specialization In Plectis, “hologram” means a structured, compressed view that preserves routes into the material it summarises.
compressed whole from parts
Meaning scope System-local specialization. Hologram is a local navigation metaphor for a source -derived multi-resolution graph . It is not an optical hologram and does not claim literal holographic storage.
Scope Names the portable compressed record (the JSON packets ) and the same compression idea in navigation . It is not an optical hologram.
Not this A screenshot of the landing page is not a hologram: it cannot be queried, and it does not carry the rest of the record .
Reader rule The term is a project metaphor, not a claim about optical holography.
Other names, related terms and sources
Also shown as portable hologram
Search handles Russian doll, holographic telescope
Source refs doctrine module navigation_hologram_theory (paper_module) doctrine module holographic_navigation_compression (paper_module)
hologram · navigation Generated from the governed public vocabulary for Plectis.
holomorphic function General or domain usage A complex-valued function that has a complex derivative at every point of an open domain.
Complex differentiation uses the same derivative regardless of the direction from which the increment approaches zero. Polynomials are holomorphic everywhere; complex conjugation is not. In one complex variable , being holomorphic on an open set is equivalent to having a convergent local power series .
In #1041 a local inverse is extended across a domain from which critical values have been removed. Global inverse sheets need the covering and topology arguments as well as holomorphic regularity. Even a biholomorphic change of coordinates can distort lengths: preserving angles does not preserve the metric estimate needed for a short connection.
Meaning scope General or domain usage. This is the ordinary one-complex-variable definition; local invertibility and global inverse-sheet conclusions have additional hypotheses.
Scope Real differentiability of the two coordinate functions is insufficient. A nonzero complex derivative gives a holomorphic inverse near that point, but does not make the map globally one-to-one .
Other names, related terms and sources
Also shown as holomorphic, complex analytic
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::res:component-local-covering (mathematical_source)
holomorphic_function · mathematical concept Generated from the governed public vocabulary for Plectis.
HTML Externally anchored HTML is the markup language used to describe the structure and meaning of web-page content.
Elements identify headings, paragraphs, links, lists, forms, and other parts that browsers and assistive technology can interpret. CSS controls presentation, while JavaScript can add behaviour.
The site's glossary references are links to definitions, enhanced with interactive previews. Keeping meaningful links in the page lets readers still reach an entry when the preview script is unavailable.
Example The glossary builder emits one HTML details element for each active term.
Scope HTML covers the markup and document semantics of the named page version.
Not this A PDF, JSON packet , or screenshot is not an HTML document.
Reader rule HTML structure affects how a page works as well as how it looks.
Other names, related terms and sources
Also shown as HyperText Markup Language
Search handles HTML page, HTML document
html · format Generated from the governed public vocabulary for Plectis.
HTTP and HTTPS General or domain usage HTTP is the web protocol for exchanging requests and responses; HTTPS is HTTP carried through an authenticated encrypted connection.
A client sends a method, URL , headers, and sometimes a body. A server returns a status, headers, and sometimes a body. HTTPS protects the connection against ordinary interception and identifies the server through certificates .
HTTP defines how web messages are structured and what methods and status codes mean. HTTPS adds Transport Layer Security , commonly called TLS , around that exchange. Encryption protects data while it travels between endpoints , but the destination can still store or misuse it. Plectis publishes HTTPS links and static files; the protocol delivers those bytes without deciding whether their scholarly or technical content is correct.
Example A browser sends an HTTPS GET request and receives an HTML page with status 200.
Meaning scope General or domain usage. The request-response application protocol used to exchange web resources; an in-process function call is not an HTTP exchange.
Scope Interpret the status, headers, body, method, URL , and connection security together; successful transport does not validate the claims inside a response.
Not this A local function call inside one program is not an HTTP exchange.
Other names, related terms and sources
Also shown as HTTP, HTTPS, Hypertext Transfer Protocol
Source refs sites/microcosm/index.html (prerequisite_context)
http · public projection Generated from the governed public vocabulary for Plectis.
hyperbolic distance General or domain usage In the unit-disc model , hyperbolic distance is the shortest path length measured with increasing stretching near the boundary.
With the usual curvature − 1 − 1 convention, a small Euclidean displacement | 𝑑 𝑧 | | d z | at z has hyperbolic length 2 | 𝑑 𝑧 | / ( 1 − | 𝑧 | 2 ) 2 | d z | / ( 1 − | z | 2 ) . The stretching grows without bound towards the unit circle; any path from an interior point to that boundary has infinite hyperbolic length.
Pairwise hyperbolic separation of selected points feeds packing and area estimates for critical-value connectors.
Meaning scope General or domain usage. Complex and hyperbolic geometry. Not the ordinary Euclidean distance drawn in the same disc.
Scope Some conventions rescale this metric by a constant, so numerical distance formulas must use the paper ’s normalization. Holomorphic disc self-maps do not increase hyperbolic distance.
Other names, related terms and sources
Also shown as Poincare distance, Poincaré distance, hyperbolic disc metric
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 192 (mathematical_source)
hyperbolic_distance · mathematical concept Generated from the governed public vocabulary for Plectis.
hypothesis General or domain usage A mathematical hypothesis is an assumption under which a statement is being considered or proved.
For example, “if n is prime and greater than 2, then n is odd” assumes both primality and the size condition. The conclusion is asserted for cases satisfying those assumptions.
In conditional research results, a particular hypothesis may remain unresolved. The proof then establishes what follows from it, rather than establishing that it holds.
Example Three exclusions in the #243 note hold under two analytic hypotheses assumed rather than derived.
Reader rule A hypothesis in a theorem need not be an unproved conjecture ; it may simply define the cases covered.
Other names, related terms and sources
Also shown as assumption
hypothesis · public projection Generated from the governed public vocabulary for Plectis.
I
IDE General or domain usage An IDE, or integrated development environment, is an application combining tools for working on software .
Scope Any combined editor-and-runner for source code, not a particular product .
Not this Uploading a JSON packet to an AI website is not using an IDE.
Reader rule An IDE is useful for local work but is not required to read the website.
Other names, related terms and sources
Also shown as integrated development environment
Search handles coding app
ide · public projection Generated from the governed public vocabulary for Plectis.
idempotency General or domain usage Idempotency is the property that repeating an operation with the same intended input has the same effect as performing it once.
Idempotent operations make retries safer when a caller cannot tell whether an earlier attempt completed. Implementations may use stable request keys, existing-state checks , or naturally repeatable assignments.
Setting a field to a fixed value is idempotent; incrementing it is not. A function from a set to itself is mathematically idempotent when 𝑓 ( 𝑓 ( 𝑥 ) ) = 𝑓 ( 𝑥 ) f ( f ( x ) ) = f ( x ) . For an API , the relevant question is whether repeating the same request accumulates an additional intended effect; responses and incidental logs may differ. Plectis queue fixtures check that repeated enqueue requests identify one job rather than creating duplicates.
Example Submitting the same request key twice creates one job and returns its existing identity.
Meaning scope General or domain usage. The property that repeating the same operation has no additional intended effect after the first successful application.
Scope Judge idempotency by observable effects, not merely by whether repeated calls return the same value.
Not this Charging a card again on every retry is not idempotent.
Other names, related terms and sources
Also shown as idempotent operation, idempotent
Source refs sites/microcosm/docs/rules-and-ideas.html (reading_context)
idempotency · public projection Generated from the governed public vocabulary for Plectis.
identifier General or domain usage An identifier is a name or code used to distinguish one object from others within a stated system.
Identifiers include database keys, route IDs, filenames, package names, and DOI strings. They support reference and lookup; they do not necessarily describe the object in ordinary language.
An identifier works only relative to rules that say what it identifies and whether it can change or be reused. Human-readable labels and identifiers may differ: a page title can change while its stable route ID remains fixed. Plectis preserves compatibility identifiers when renaming them would break links or tools. Possessing an identifier does not prove that the referenced object exists, is current, or is authoritative .
Example A DOI identifies a registered research object within the DOI system.
Meaning scope General or domain usage. A name or value used to distinguish an object within a stated system, rather than a merely descriptive phrase.
Scope Judge an identifier inside its naming system, including its namespace , case rules, and stability promises.
Not this The phrase “important result” describes something but does not uniquely identify it.
Other names, related terms and sources
Also shown as identifiers, stable identifier
Source refs sites/microcosm/docs/lineage.html (reading_context)
identifier · public projection Generated from the governed public vocabulary for Plectis.
image of a function General or domain usage The set of output values a function actually attains.
If 𝑓 ( 𝑛 ) = 𝑛 2 f ( n ) = n 2 on the integers , its image contains 0,1,4,9,… but not 2. The image may be smaller than the announced set of possible outputs.
Image language identifies which outputs a recurrence or map actually reaches. “Range” often means this image, but some sources use it for the declared codomain ; the source ’s convention matters. A function is surjective exactly when its image equals its stated codomain .
Meaning scope General or domain usage. Functions and maps. Distinct from a picture or generated media.
Scope For a subset A of inputs, 𝑓 ( 𝐴 ) f ( A ) means all 𝑓 ( 𝑎 ) f ( a ) with a in A.
Other names, related terms and sources
Also shown as function image
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 445 (mathematical_source)
image_of_function · mathematical concept Generated from the governed public vocabulary for Plectis.
immutable General or domain usage Immutable describes a value or record that cannot be changed after it is created.
An immutable object may be replaced by a new version, but its existing value remains fixed. Immutability simplifies comparison, caching, concurrency , and audit history when the boundary is real.
A language or storage system can prevent changes to an object, while an append-only policy can forbid them. A cryptographic hash serves a different purpose: changed bytes acquire a different hash, making a change detectable when identities are checked . Plectis records events as immutable history and builds changing views from them. New events can be added, and references can move, while the earlier records remain intact.
Example An append-only event log adds a correction event rather than editing the earlier event.
Meaning scope General or domain usage. The property that an existing value or record cannot be changed after creation; creating a replacement version can preserve immutability.
Scope Ask which object and boundary are immutable; a fixed record can still point to mutable external content.
Not this A file described as final but still writable by ordinary tools is not technically immutable.
Other names, related terms and sources
Also shown as immutability, unchangeable record
Source refs sites/microcosm/docs/paper-module-engine-room-metabolism-runtime.html (reading_context)
immutability · public projection Generated from the governed public vocabulary for Plectis.
implementation General or domain usage An implementation is a concrete realization of a design, specification , algorithm , interface , or policy.
Implementation may take the form of executable code, configured services, data structures, generated artifacts , hardware, or an operational procedure. Several implementations can satisfy the same contract while using different internal methods, performance trade-offs, and dependencies .
Specifications describe required relationships or outcomes; implementations choose concrete representations and steps. A correct algorithm can be implemented incorrectly, and a conforming implementation may still be insecure, slow, inaccessible, or unsuitable for a particular setting. Conversely, observed useful behavior without a stated contract makes conformance hard to judge. Source inspection explains how a realization is built, while tests , formal checks , and operational evidence address different aspects of whether it works. Version identity matters because implementation behavior can change without renaming the interface .
Example The site builder is the implementation that turns vocabulary rows into glossary HTML.
Scope The term covers source code, generated behaviour, and operational wiring that realizes described system features.
Not this A prose proposal with no working realization is a design, not yet an implementation.
Reader rule Evaluate an implementation against the requirements it claims to realize, the environment in which it operates, and evidence from its actual behavior.
Other names, related terms and sources
Also shown as implementations, implemented, implementing
implementation · public projection Generated from the governed public vocabulary for Plectis.
implication General or domain usage An implication says that if one statement holds, another follows.
The notation 𝑃 → 𝑄 P → Q means “if P, then Q”. P is a sufficient condition for Q, and Q is a necessary condition for P. This alone does not say that Q implies P.
The papers use implications to connect hypotheses and target results. To claim an equivalent reformulation , the reverse implication must also be proved under compatible assumptions .
Example A theorem may prove that a proposed analytic bound would imply the irrationality of a series .
Scope An implication covers the named antecedent and conclusion under the proof 's stated hypotheses.
Not this An implication does not assert its converse and does not establish its conclusion when the antecedent is unproved.
Reader rule Proving the implication does not establish P itself.
Other names, related terms and sources
Also shown as implies, if then
Search handles imply
implication · public projection Generated from the governed public vocabulary for Plectis.
independent events General or domain usage Events are mutually independent when the probability of every finite intersection is the product of its probabilities.
For two events A and B, this says 𝑃 ( 𝐴 ∩ 𝐵 ) = 𝑃 ( 𝐴 ) 𝑃 ( 𝐵 ) P ( A ∩ B ) = P ( A ) P ( B ) . A family needs the corresponding identity for every finite subfamily. Pairwise independence alone does not guarantee mutual independence.
For a Haar-uniform profinite integer , the #257 note treats divisibility of 𝑥 + 1 x + 1 by distinct primes as independent. The Chinese remainder theorem supplies the product probabilities for finite collections, supporting the stated almost-sure argument.
Meaning scope General or domain usage. The probability meaning is intended, distinct from linear independence or informal organizational autonomy. Mutual independence concerns all finite subcollections in one specified probability space .
Scope Independence depends on the chosen probability law . Disjoint positive-probability events are not independent, because their joint occurrence is impossible.
Other names, related terms and sources
Also shown as mutually independent events, event independence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
independent_events · mathematical concept Generated from the governed public vocabulary for Plectis.
index General or domain usage An index identifies a member of an indexed family or provides a lookup structure for locating information.
In a sequence 𝑎 𝑛 a n , n is the index and 𝑎 𝑛 a n is the term at that position. A search or database index instead records information that helps locate matching items efficiently. The site uses both mathematical indices and generated lookup indexes.
The paper ’s notation states which values an index can take, such as positive integers or elements of another set. Distinct indices can label equal values, so an index does not assert uniqueness of the value itself. A lookup index stores keys or references to selected content; it can omit items, become stale, or use approximate matching. The site’s declaration index helps locate proof declarations , while its coverage record states which source inventory was actually indexed.
Scope An index used as a label need not be a number; an index used for lookup is separate from the material it describes.
Other names, related terms and sources
Also shown as indexes, indices, indexed, sequence index, lookup index
index · public projection Generated from the governed public vocabulary for Plectis.
indicator function General or domain usage An indicator function is 1 on a specified set and 0 outside it.
Writing 1 𝐴 ( 𝑥 ) 1 A ( x ) means 1 if 𝑥 ∈ 𝐴 x ∈ A and 0 otherwise. Its sum over a finite index set counts the members of A in that set; multiplying a function by 1 𝐴 1 A restricts it to A.
The #257 identity uses 1 𝐴 1 A for a selected exponent support , while 1 𝑑 ∣ 𝑛 1 d ∣ n indicates a divisibility event. Summing the latter over a finite divisor set counts how many of its members divide n. Mathlib also names the restricted function itself an indicator: Set.indicator A f equals f on A and zero elsewhere.
Scope The set or condition being indicated must be specified. An indicator is a numeric function ; a predicate states whether the condition is true.
Other names, related terms and sources
Also shown as set indicator, membership indicator
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::eq:incidence (mathematical_source)
indicator_function · mathematical concept Generated from the governed public vocabulary for Plectis.
inductive type General or domain usage An inductive type is specified by constructors that build its values and rules for reasoning about those values.
Natural numbers have zero and successor constructors; lists have an empty-list constructor and a constructor adding an element to a list. The associated induction or recursion principles let proofs and functions follow these constructions.
The local Lean developments repeatedly use natural-number induction and finite structures built on such types. The logical mechanism explains why handling a base case and a successor case can establish a statement about every natural index .
Meaning scope General or domain usage. The type-theoretic constructor-based meaning is intended. It is distinct from mathematical induction as a proof method, although inductive types supply corresponding induction principles .
Scope Constructors must satisfy the proof system's formation rules. Writing a self-referential type equation is not enough to create a valid inductive type.
Other names, related terms and sources
Also shown as inductive types, inductive data type, inductive data types
inductive_type · mathematical concept Generated from the governed public vocabulary for Plectis.
inequality General or domain usage An inequality compares quantities using an order relation such as < , ≤ , > , o r ≥ < , ≤ , > , or ≥ .
The symbol ≤ ≤ means “less than or equal to”, so 𝑥 ≤ 𝑀 x ≤ M allows x to equal M. The strict inequality 𝑥 < 𝑀 x < M excludes equality .
Inequalities in the papers often control an error or bound a sum . Each manipulation must respect sign conditions: multiplying both sides by a negative number reverses the order.
Example A proof may derive 0 < 𝐸 < 1 0 < E < 1 while also showing E is an integer , producing the contradiction used in an irrationality argument.
Scope An inequality covers the compared expressions, order relation, and assumptions in its statement.
Not this An approximate numerical estimate is not automatically a proved inequality.
Reader rule The difference between strict and non-strict bounds can determine whether an endpoint is included.
Other names, related terms and sources
Also shown as comparison inequality
Search handles inequalities
inequality · mathematical concept Generated from the governed public vocabulary for Plectis.
infimum General or domain usage The largest number less than or equal to every member of a set.
The open interval (0,1) has infimum 0 even though it has no smallest member. The infimum is the best lower bound : every element is at least 0, while any larger proposed lower bound fails.
Optimization thresholds in cover and matrix arguments are expressed as infima when competitors approach an optimal value without attaining it. Proving a lower bound for every competitor bounds the infimum; producing examples approaching it gives the reverse bound .
Meaning scope General or domain usage. Order and optimization. Infimum and minimum differ by attainment.
Scope A minimum must belong to the set; an infimum need not. For an unbounded -below set the infimum may be − ∞ − ∞ in the extended real numbers , and an empty-set convention must be stated.
Other names, related terms and sources
Also shown as greatest lower bound, inf
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 352 (mathematical_source)
infimum · mathematical concept Generated from the governed public vocabulary for Plectis.
infinite General or domain usage An infinite set has more elements than any finite set ; no finite count exhausts it.
Infinite sequences and series specify a term for every index in an unending index set. Statements about them are expressed through definitions, quantifiers, and limits rather than by carrying out infinitely many steps.
For example, there are infinitely many even integers , but arbitrarily large odd integers remain. This distinction matters when interpreting the scope of a theorem .
Example The sequence of positive integers is infinite.
Meaning scope General or domain usage. Infinite means not finite in the mathematical sense appropriate to the named set, sequence , or process. It does not mean merely very large, long-running, or currently unbounded by a known estimate.
Scope Infinite covers the collection or process named by the statement and its definition of continuation.
Not this A very large but bounded list is not infinite.
Reader rule “Infinitely many” is weaker than “all” and can also be weaker than “all sufficiently large”.
Other names, related terms and sources
Also shown as infinitely many
Search handles infinite set, infinite sequence
infinite · mathematical concept Generated from the governed public vocabulary for Plectis.
injective map General or domain usage A function that never sends two different inputs to the same output.
𝑓 ( 𝑥 ) = 2 𝑥 f ( x ) = 2 x on the integers is injective; 𝑓 ( 𝑥 ) = 𝑥 2 f ( x ) = x 2 is not, because 2 and -2 both map to 4.
In the lemniscate arguments, an injective complex map gives different image points to different inputs. Having a nonzero derivative is only a local condition and does not by itself establish injectivity across the whole domain.
Meaning scope General or domain usage. Functions . Injective does not say every possible output is attained.
Scope To prove injectivity, assume 𝑓 ( 𝑥 ) = 𝑓 ( 𝑦 ) f ( x ) = f ( y ) and show 𝑥 = 𝑦 x = y .
Other names, related terms and sources
Also shown as injective, one-to-one
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 514 (mathematical_source)
injective_map · mathematical concept Generated from the governed public vocabulary for Plectis.
inner product General or domain usage An inner product pairs two vectors to measure their lengths and relative directions through an algebraic operation.
For real coordinate vectors, the usual dot product adds the products of matching coordinates: ( 𝑎 , 𝑏 ) ⋅ ( 𝑐 , 𝑑 ) = 𝑎 𝑐 + 𝑏 𝑑 ( a , b ) ⋅ ( c , d ) = a c + b d . Its value on a vector paired with itself is the square of that vector's length and is positive unless the vector is zero.
The Cauchy–Schwarz inequality bounds an inner product by the product of the two lengths. Function spaces can use integrals as inner products, allowing the same reasoning to compare functions rather than coordinate lists.
Scope An inner product is linear in one argument and symmetric over the reals ; over the complexes it is conjugate-symmetric, with conjugate scaling in the other argument.
Other names, related terms and sources
Also shown as inner products, dot product
Source refs governed vocabulary term_registry (reading_context)
inner_product · mathematical concept Generated from the governed public vocabulary for Plectis.
inspection System-local specialization Inspection means examining the actual material closely enough to assess a specific question about it.
Here that can involve reading a theorem statement, tracing its proof dependencies , examining a test, or comparing a result record with the command that produced it. The relevant depth depends on the question.
Plectis provides source and evidence routes to make that deeper reading possible. Inspection can reveal uncertainty as well as confirm a claim ; it need not end in approval.
Example The Why walkthrough treats the front end as an inspection layer over maps, files, traces, and evidence . See it live: With a coding agent a public path that still requires inspecting source and checks
Meaning scope System-local specialization. On this site, inspection means reading source , Lean , papers , traces, and check results rather than trusting a summary or UI. It is not a substitute for a Lean kernel acceptance or a recorded check .
Scope Covers the landing's inspection-layer claim and any page that invites a reader to open source or checks .
Not this A checklist item or a summary sentence is not inspection of the underlying record .
Reader rule Reading a summary is useful orientation but may leave the decisive detail unexamined.
Other names, related terms and sources
Also shown as inspect, inspecting
inspection · public projection Generated from the governed public vocabulary for Plectis.
instance resolution General or domain usage Instance resolution searches for declared implementations that satisfy a type-class requirement.
An instance may itself require other instances, so resolution can recursively assemble the needed structure. The search uses the language's declarations , priorities, and matching rules; it can fail when evidence is missing or parameters remain unknown.
In Lean 's finite -index proofs , Fintype instances make enumeration available to generic operations. Reproducing such a proof therefore depends on the imported instance environment as well as the visible theorem statement.
Meaning scope General or domain usage. The typed-language search mechanism is intended. The concrete rules cited are Lean 's instance synthesis, not a general search over every possible proof or model .
Scope Resolving an instance is not unrestricted theorem proving. A failed search can mean that a suitable declaration is absent rather than that the mathematical requirement is false.
Other names, related terms and sources
Also shown as typeclass resolution, type-class resolution, instance synthesis
Search handles type class synthesis
instance_resolution · proof infrastructure Generated from the governed public vocabulary for Plectis.
integer General or domain usage An integer is one of the numbers … , − 2 , − 1 , 0 , 1 , 2 , … … , − 2 , − 1 , 0 , 1 , 2 , … .
Integers have no fractional part . They include positive and negative whole numbers and zero, and are usually denoted collectively by ℤ.
Number-theory statements often restrict integers further, for example to positive or nonnegative values. Those restrictions matter for divisibility , factorials , and sequence indices , so they are part of the mathematical claim rather than optional wording.
Example Clearing denominators turns a question about a fraction into a question about whether one integer error term can vanish.
Scope An integrality argument covers the quantity it is proved for.
Reader rule Addition, subtraction, and multiplication preserve integers; division need not do so.
Other names, related terms and sources
Also shown as whole number
integer · public projection Generated from the governed public vocabulary for Plectis.
integer partition General or domain usage An integer partition writes a nonnegative integer as a sum of positive integers without counting different orders separately.
The partitions of 4 are 4, 3 + 1 3 + 1 , 2 + 2 2 + 2 , 2 + 1 + 1 2 + 1 + 1 , and 1 + 1 + 1 + 1 1 + 1 + 1 + 1 . They are often written as nonincreasing lists; trailing zeros may be added for indexing.
The #1049 proof indexes displaced moment nodes by partitions. Subtracting the baseline tuple ( 0 , 1 , … , 𝑁 − 1 ) ( 0 , 1 , … , N − 1 ) gives nonnegative increasing shifts, which become a partition after reversal. This puts the contributions for varying N on one index set so a common summable bound can justify passing to a limit .
Scope This is different from a composition, which counts order, and from a set partition, which groups elements of a set. The empty partition represents zero.
Other names, related terms and sources
Also shown as integer partitions, partition of an integer, partitions of an integer
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::eq:partition-summand (mathematical_source)
integer_partition · mathematical concept Generated from the governed public vocabulary for Plectis.
integer-valued polynomial General or domain usage An integer-valued polynomial is a polynomial whose values are integers at every integer input, even if its coefficients are rational .
Other names, related terms and sources
Also shown as integer valued polynomial, integer-valued polynomials
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::eq:normal-cubic (mathematical_source)
integer_valued_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
integrable function General or domain usage In Lebesgue integration, an integrable real or complex function is measurable and has finite integral of its absolute value .
The measure and domain are part of the claim . Scalar integrability allows a measurable representative agreeing almost everywhere. For a Banach space, a complete normed vector space , Bochner integrability requires almost-everywhere strong measurability and finite integral of the norm . Completeness ensures the integral lies in that space.
The #257 note keeps finite residue averages separate from a limiting profinite observable that is infinite almost everywhere. That limit cannot provide a finite integrable mean merely because selected integer inputs have finite values.
Meaning scope General or domain usage. Lebesgue and Bochner integrability relative to a specified measure are intended. Other integration theories have different criteria; integrable is not an unqualified agreement among all of them.
Scope Pointwise finiteness or existence of a conditionally convergent improper integral does not by itself establish Lebesgue or Bochner integrability.
Other names, related terms and sources
Also shown as integrable functions, Lebesgue integrable, Bochner integrable
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
integrable_function · mathematical concept Generated from the governed public vocabulary for Plectis.
integral basis General or domain usage An integral basis is a basis over the integers : every element of the relevant free abelian group has a unique finite integer linear combination of the basis vectors.
Other names, related terms and sources
Also shown as Z-basis, integer basis
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 258 (mathematical_source)
integral_basis · mathematical concept Generated from the governed public vocabulary for Plectis.
integral curve General or domain usage An integral curve of a vector field is a parametrised curve whose velocity agrees with that field at every point.
It solves 𝑥 ′ ( 𝑡 ) = 𝑉 ( 𝑥 ( 𝑡 ) ) x ′ ( t ) = V ( x ( t ) ) . For the constant field 𝑉 = 1 V = 1 on the real line, the curves are 𝑥 ( 𝑡 ) = 𝑡 + 𝑐 x ( t ) = t + c , with the starting value determined by c.
In the Newton-flow papers , the field is regular away from zeros of p′. A trajectory approaching an excluded point needs separate analysis before further continuation can be asserted.
Scope Existence and uniqueness require conditions on the field, such as local Lipschitz continuity for a standard uniqueness theorem .
Other names, related terms and sources
Also shown as flow line, flow trajectory
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 254 (mathematical_source)
integral_curve · mathematical concept Generated from the governed public vocabulary for Plectis.
intelligent General or domain usage Intelligent ordinarily describes an ability to learn, reason, understand, or adapt to a task.
The word covers several capacities rather than one universally agreed measure. Performance can vary with the problem, available context, tools, and time.
An actor may reason well while lacking access to the evidence needed for a particular claim . Conversely, permission to run commands gives an opportunity to gather evidence without guaranteeing good judgement about the results.
Example Asking whether a stronger model can help explain a proof is a question about intelligence as everyday capacity, not about actor type.
Meaning scope General or domain usage. Intelligent keeps its ordinary meaning. Type A and Type B on this site name substrate authority , not intelligence, model quality, or personal worth.
Scope Ordinary English in the why paragraph. Not a psychometric claim and not the Type A /B distinction.
Not this Calling a Type A agent more intelligent than a Type B reader would be a category error on this site.
Reader rule Plectis's Type A and Type B labels describe access and authority , not intelligence.
Other names, related terms and sources
Also shown as intelligence
Search handles more intelligent
intelligent · public projection Generated from the governed public vocabulary for Plectis.
interface General or domain usage An interface is a defined boundary through which a person, program , or component interacts with another system.
A user interface exposes controls and feedback to people, while a programming interface exposes operations, inputs, outputs, and errors to software . Both establish what can cross a boundary without revealing every implementation detail.
An interface gives one party a usable way to interact with another while hiding details that need not be shared. Screens, forms, command lines, functions , file formats, and network APIs are all interfaces, but they serve different participants and carry different contracts . A stable interface specifies valid operations, data shapes, responses, and errors closely enough for independent use. It does not guarantee that the underlying implementation is simple or unchanged. A physical boundary may also be called an interface, so context must establish whether the interaction involves people, software , or material systems.
Scope An interface is determined by its participants, available operations, accepted inputs, returned outputs, and failure behaviour; its implementation may change while that contract remains stable.
Other names, related terms and sources
Also shown as interfaces, user interface, programming interface
Source refs sites/microcosm/index.html (reading_context) sites/microcosm/docs/open-questions.html (reading_context)
interface · public projection Generated from the governed public vocabulary for Plectis.
invariant General or domain usage An invariant is a quantity or property preserved by specified transformations or steps of a process.
For example, repeatedly adding 2 preserves an integer 's parity. The unchanged property can connect distant stages without examining every intermediate operation separately.
The papers use preserved arithmetic relationships to constrain possible trajectories of a recurrence . Which transformation is allowed matters: a property invariant under one update need not survive a different operation or change of coordinates.
Scope An invariant is preserved exactly in the stated sense; a quantity merely increasing or decreasing is instead monotone.
Other names, related terms and sources
Also shown as preserved quantity, invariant property
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::line 658 (mathematical_source)
invariant · mathematical concept Generated from the governed public vocabulary for Plectis.
inverse branch General or domain usage A single-valued local choice of inverse for a map that may have several preimages globally.
Near 𝑤 = 1 w = 1 , one branch of the square root takes value 1 and another takes value − 1 − 1 . Each is a consistent single-valued local inverse of squaring. Choosing a branch specifies which preimage is followed as w changes.
If f is locally one-to-one near 𝑧 0 z 0 and 𝑤 0 = 𝑓 ( 𝑧 0 ) w 0 = f ( z 0 ) , an inverse branch is a function g on a neighbourhood of 𝑤 0 w 0 satisfying 𝑓 ( 𝑔 ( 𝑤 ) ) = 𝑤 f ( g ( w ) ) = w and 𝑔 ( 𝑤 0 ) = 𝑧 0 g ( w 0 ) = z 0 . For a holomorphic f with 𝑓 ′ ( 𝑧 0 ) f ′ ( z 0 ) nonzero, the inverse function theorem gives a holomorphic branch. A polynomial of degree greater than one has several possible preimages , so there is generally no single global inverse. Continuing a chosen branch can encounter a critical value or can return to another branch after travelling around a branch point .
Example Near 𝑤 = 1 w = 1 , the square-root branch with value 1 is a local inverse branch of z maps to z squared.
Meaning scope General or domain usage. This is a branch of an inverse function , not a branch in a version-control repository or a tree edge.
Scope For a holomorphic map , a nonzero derivative gives a local holomorphic inverse branch. Its domain and starting preimage matter, and extending the branch requires avoiding the relevant obstructions .
Not this The two-valued expression plus-or-minus square root of w is not a single-valued inverse branch until one choice and domain are fixed.
Other names, related terms and sources
Also shown as local inverse branch, analytic inverse branch, branch of the inverse
inverse_branch · mathematical concept Generated from the governed public vocabulary for Plectis.
inverse function General or domain usage An inverse function undoes a function , returning each output to the unique input that produced it.
The map 𝑓 ( 𝑥 ) = 2 𝑥 f ( x ) = 2 x on the reals has inverse 𝑦 ↦ 𝑦 / 2 y ↦ y / 2 . Squaring on all real numbers has no inverse function because 2 and − 2 − 2 have the same square; restricting the domain to nonnegative reals removes that ambiguity.
The notation 𝑓 − 1 ( 𝐵 ) f − 1 ( B ) can instead mean the preimage of a set B, which is defined even without an inverse function. The papers ' inverse branches make an inverse choice on a suitable restricted region.
Other names, related terms and sources
Also shown as inverse map
Source refs governed vocabulary term_registry (reading_context)
inverse_function · mathematical concept Generated from the governed public vocabulary for Plectis.
irrational General or domain usage A real number is irrational if it cannot equal 𝑎 / 𝑏 a / b for any integers a and nonzero b.
For example, √ 2 2 is irrational. In any fixed integer base greater than one, an irrational number's digit expansion never becomes permanently periodic .
An irrationality proof must rule out every possible rational representation. Computing many digits or checking many candidate denominators can provide evidence , but it does not on its own exclude all fractions .
Example Erdős #249 asks whether the sum of the totient function divided by powers of two is irrational.
Scope An irrationality result covers the specific number or family it names.
Reader rule An infinite expansion alone does not imply irrationality: 1 / 3 1 / 3 has an infinite repeating decimal expansion.
Other names, related terms and sources
Also shown as irrationality
Search handles irrational numbers
irrational · public projection Generated from the governed public vocabulary for Plectis.
irrationality criterion General or domain usage An irrationality criterion is a proved condition that can be used to establish that a number is irrational .
Other names, related terms and sources
Also shown as criterion for irrationality, irrationality test
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 500 (mathematical_source)
irrationality_criterion · mathematical concept Generated from the governed public vocabulary for Plectis.
irrationality exponent General or domain usage The irrationality exponent is the supremum of the approximation powers achieved infinitely often by rational approximations to an irrational number.
Meaning scope General or domain usage. Diophantine approximation. Distinct from merely proving irrationality .
Scope A supremum need not itself satisfy the defining inequality infinitely often, and a finite approximation sample cannot establish the exponent .
Other names, related terms and sources
Also shown as irrationality measure exponent
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 291 (mathematical_source)
irrationality_exponent · mathematical concept Generated from the governed public vocabulary for Plectis.
irreducible polynomial General or domain usage An irreducible polynomial over a field is a nonconstant polynomial that cannot be factored into two polynomials of positive degree over that field.
The polynomial 𝑇 2 − 2 T 2 − 2 is irreducible over ℚ Q but factors over ℝ R . Irreducibility therefore always refers to a specified coefficient field .
The #243 argument excludes a rational root of its cubic by reducing that root modulo suitable persistent primes and contradicting coprimality . The cubic root test then supplies irreducibility, allowing the proof to pass to a degree-three number field .
Scope For degrees two and three over a field, irreducibility is equivalent to having no root in that field. This root test is insufficient in higher degrees.
Other names, related terms and sources
Also shown as irreducible polynomials, polynomial irreducibility
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:reduction (mathematical_source)
irreducible_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
J
Jacobi matrix General or domain usage The tridiagonal matrix representing multiplication by the variable in an orthonormal polynomial basis .
For orthonormal polynomials on the real line, 𝑥 𝑝 𝑛 = 𝑎 𝑛 + 1 𝑝 𝑛 + 1 + 𝑏 𝑛 𝑝 𝑛 + 𝑎 𝑛 𝑝 𝑛 − 1 x p n = a n + 1 p n + 1 + b n p n + a n p n − 1 . The associated real symmetric matrix has 𝑏 𝑛 b n on the diagonal and positive 𝑎 𝑛 a n on neighbouring diagonals. Its finite truncations give quadrature nodes as eigenvalues.
The #1049 finite moment construction becomes a Jacobi matrix after choosing an orthonormal polynomial basis . The paper explicitly distinguishes this positive-node quadrature construction from a different coefficient matrix pencil whose roots can include negative values.
Other names, related terms and sources
Also shown as symmetric Jacobi matrix, Jacobi operator matrix
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2926 (mathematical_source)
jacobi_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
jacobian matrix General or domain usage The matrix of all first partial derivatives of a map between finite -dimensional coordinate spaces.
For 𝐹 ( 𝑥 , 𝑦 ) = ( 𝑥 + 𝑦 , 𝑥 𝑦 ) F ( x , y ) = ( x + y , x y ) , the Jacobian has rows ( 1 , 1 ) ( 1 , 1 ) and ( 𝑦 , 𝑥 ) ( y , x ) . When F is differentiable , this matrix represents the linear map describing its first-order local change; the existence of individual partial derivatives alone is not enough.
Each entry records how one output changes with one input coordinate. The inverse function theorem uses both local regularity and a nonzero determinant . A zero determinant does not exclude every kind of local inverse: 𝑥 ↦ 𝑥 3 x ↦ x 3 is invertible near zero, but its inverse is not differentiable there. Some prose uses “Jacobian” for the determinant ; the matrix and that scalar must be distinguished. Hessians instead collect second derivatives of a scalar -valued function .
Example For 𝐹 ( 𝑥 , 𝑦 ) = ( 𝑥 + 𝑦 , 𝑥 𝑦 ) F ( x , y ) = ( x + y , x y ) , the Jacobian has rows ( 1 , 1 ) ( 1 , 1 ) and ( 𝑦 , 𝑥 ) ( y , x ) .
Meaning scope General or domain usage. Some prose says Jacobian when it means the Jacobian determinant ; preserve the distinction unless the context clearly uses the scalar determinant .
Scope For n inputs and m outputs, the Jacobian is 𝑚 × 𝑛 m × n . A square Jacobian with nonzero determinant gives a local differentiable inverse when the map is continuously differentiable nearby.
Not this A list of partial derivatives that does not give the full linear approximation need not establish differentiability .
Other names, related terms and sources
Also shown as derivative matrix
jacobian_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
JavaScript General or domain usage JavaScript is a programming language used in web browsers and many server and tooling environments .
Browsers use JavaScript to respond to actions such as clicks, update a page, and communicate through web APIs . Other environments use the same language for servers , scripts, and development tools. Its core language is standardized as ECMAScript.
The host environment supplies facilities beyond the core language: a browser provides documents, events, and timers, while a server runtime can provide file or network access. Plectis uses JavaScript to add glossary previews, search, maps, and navigation controls to generated HTML. Direct links and readable content remain useful when those enhancements are unavailable. JavaScript and Java are separate languages.
Example A script listens for Escape and closes a glossary tooltip without reloading the page.
Meaning scope General or domain usage. The programming language used for browser and server scripts, distinct from HTML document structure and CSS presentation.
Scope JavaScript being enabled permits code to run; it does not establish that the code is safe, correct, or necessary.
Not this HTML that displays a paragraph is document markup, not JavaScript.
Other names, related terms and sources
Also shown as JS
Source refs sites/microcosm/index.html (reading_context)
javascript · public projection Generated from the governed public vocabulary for Plectis.
jitter General or domain usage Jitter is variation in timing. In a retry schedule, deliberate random variation spreads requests out so clients do not all retry together.
In networking, jitter often means unwanted variation in packet arrival times. Retry jitter deliberately varies waiting times: clients that failed together choose different delays, reducing another simultaneous traffic spike.
Retry jitter is often combined with exponential backoff . One scheme draws a delay anywhere between zero and the current backoff limit ; another varies around a planned delay. The variation need not be small. Plectis provider -routing discussions use this scheduling sense, where several clients may otherwise retry together after a shared rate limit . The delay changes timing; it does not make an unsafe operation safe to repeat.
Example One hundred workers each choose a different random delay within the next eight seconds.
Meaning scope General or domain usage. Jitter can be unwanted timing variation in a network or deliberate variation in a retry schedule. Random changes to message content are neither timing sense.
Scope Distinguish unwanted timing variation from the deliberate randomness used to spread retry attempts.
Not this Adding random data to a request payload is not retry jitter.
Other names, related terms and sources
Also shown as retry jitter, randomised retry delay, randomized retry delay
Source refs sites/microcosm/docs/paper-module-engine-room-annex-knowledge-router.html (prerequisite_context)
jitter · public projection Generated from the governed public vocabulary for Plectis.
jordan domain General or domain usage A Jordan domain is the bounded open region enclosed by a simple closed curve in the plane.
The inside of a circle or any non-self-intersecting closed loop is a Jordan domain. A figure-eight boundary is excluded because it crosses itself and encloses more than one lobe rather than one simple inside region.
When a polynomial sublevel component is a Jordan domain, conformal maps can transfer it to the unit disc and boundary behavior becomes tractable. The term is topological; the boundary need not be smooth, circular, or convex .
Meaning scope General or domain usage. Planar topology and complex analysis. Named for Camille Jordan; unrelated to Jordan normal form .
Scope A Jordan domain is the bounded open component enclosed by a simple closed plane curve. The Jordan curve theorem supplies exactly one inside and one outside component , sharing that curve as boundary.
Other names, related terms and sources
Also shown as Jordan region
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 416 (mathematical_source)
jordan_domain · mathematical concept Generated from the governed public vocabulary for Plectis.
JSON Externally anchored JSON is a text format for representing structured values as objects, arrays, strings, numbers, booleans, and null.
JSON stands for JavaScript Object Notation. People can inspect it as text, while programs parse its defined grammar. It is widely used beyond JavaScript . A separate schema or contract explains allowed fields, relationships, and version changes for a particular application.
JSON deliberately supports a small value vocabulary and has no native comments, dates, binary blobs, or object identity. Applications encode those ideas by convention. Member ordering usually has no semantic force, duplicate-name handling differs among parsers , and numbers may lose precision across implementations . A durable JSON interface therefore documents encoding, schema, required and optional fields, identifier stability, compatibility rules, and validation behavior. Human readability aids inspection but does not replace those contracts or establish the authority of the contained claims .
Example Result records , the site map , and the reader packets are all JSON.
Scope The format says nothing about whether the content is correct.
Reader rule JSON syntax being valid says nothing about whether its values are true, complete, safe, current, or meaningful for a particular consumer.
Other names, related terms and sources
Also shown as json file, json files
json_format · public projection Generated from the governed public vocabulary for Plectis.
K
kernel System-local specialization Here, kernel can mean Lean 's proof checker or the repository 's kernel.py command router.
repo control query spine
Reader rule Read proof acceptance as a Lean -kernel claim and navigation or status output as a repository -router response. Qualify the name when both appear together.
Other names, related terms and sources
Also shown as kernel.py, repo kernel, control spine
Search handles query spine
Source refs doctrine module kernel_entry_paths (paper_module)
kernel · runtime Generated from the governed public vocabulary for Plectis.
Koebe distortion theorem General or domain usage The Koebe distortion theorem gives explicit bounds on the size and derivative of a normalized univalent holomorphic function inside the unit disc .
If f is one-to-one on the unit disc with 𝑓 ( 0 ) = 0 f ( 0 ) = 0 and 𝑓 ′ ( 0 ) = 1 f ′ ( 0 ) = 1 , then points well inside the disc cannot be stretched or compressed arbitrarily; the bounds worsen as | 𝑧 | | z | approaches 1.
The paper applies a Koebe estimate to an inverse branch on a one-root lobe. Once univalence and the available disc radius are established, the theorem converts analytic normalization into quantitative control of the corresponding path pieces.
Example If f is one-to-one on the unit disc with 𝑓 ( 0 ) = 0 f ( 0 ) = 0 and 𝑓 ′ ( 0 ) = 1 f ′ ( 0 ) = 1 , then points well inside the disc cannot be stretched or compressed arbitrarily; the bounds worsen as | 𝑧 | | z | approaches 1..
Meaning scope General or domain usage. The theorem needs a globally one-to-one holomorphic function on the disc; a nonzero derivative alone is insufficient.
Scope Normalization matters: general univalent functions are reduced to the standard form by translating and scaling. The theorem controls interior distortion, not arbitrary behavior on the boundary, and it depends essentially on global injectivity on the disc.
Other names, related terms and sources
Also shown as Koebe distortion estimate
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 666 (mathematical_source)
koebe_distortion_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
Kronecker approximation theorem General or domain usage A theorem describing which simultaneous phases can be approached by a linear motion modulo integers .
For a continuous flow 𝑡 𝜔 t ω on ℝ 𝑑 / ℤ 𝑑 R d / Z d , its closure consists of the phases satisfying every integer relation 𝑘 ⋅ 𝑥 = 0 k ⋅ x = 0 modulo 1 for which 𝑘 ⋅ 𝜔 = 0 k ⋅ ω = 0 . In particular, if no nonzero integer relation among the frequencies exists, the flow is dense in the whole torus.
The #269 proof uses the continuous form to identify its orbit closure as a subtorus determined by the rational relations among reciprocal logarithms . It then searches inside that subtorus. Qualitative approximation gives arbitrarily close returns; a numerical return-time bound would require additional estimates.
Meaning scope General or domain usage. This is the simultaneous-approximation theorem , not the Kronecker–Weber theorem about abelian number fields .
Scope For a discrete orbit 𝑛 𝛼 n α , relations 𝑘 ⋅ 𝛼 k ⋅ α that are integers must also be respected. Full density then requires rational independence of 1 and the coordinates of 𝛼 α . The continuous and discrete forms must not be interchanged.
Other names, related terms and sources
Also shown as Kronecker's theorem, Kronecker theorem, Kronecker approximation
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:sec:flow (mathematical_source)
kronecker_approximation_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
L
laboratory System-local specialization In Plectis, a laboratory is a controlled setting for trying a proposed mechanism before relying on it in live work.
controlled experiment substrate
Meaning scope System-local specialization. Laboratory means a controlled disposable test substrate for system hypotheses. It does not imply a wet lab, accredited facility, or scientific validation beyond the recorded experiment.
Scope The term covers the experiment-and-evidence lane used when a new mechanism is being trialled before broad adoption. It appears on the architecture and component pages, where a specific laboratory, such as the certificate kernel execution lab, can be opened and inspected.
Not this A laboratory is not the live system itself, and it is not a final result or an approved standard . It is a contained trial whose findings still have to clear the system's gates before they count.
Reader rule Laboratory evidence covers the experiment that was actually run.
Other names, related terms and sources
Also shown as lab, system laboratory
Search handles system lab, laboratory probe, lab probe, laboratory packet, laboratory receipt, laboratory ledger, laboratory fixture
Source refs standard std_laboratory (standard) doctrine skill system_microcosm_probe (compatibility_skill) doctrine skill microcosm_autonomous_seed_plan (compatibility_skill)
laboratory · runtime Generated from the governed public vocabulary for Plectis.
Lambert series General or domain usage A Lambert series has the form ∑ 𝑎 𝑛 𝑥 𝑛 / ( 1 − 𝑥 𝑛 ) ∑ a n x n / ( 1 − x n ) , usually summed over positive integers n where it converges .
Scope A Lambert-series result covers the bases it names.
Reader rule A power series ∑ 𝑎 𝑛 𝑥 𝑛 ∑ a n x n is a different expression and is not automatically a Lambert series.
Other names, related terms and sources
Also shown as Lambert-type series
lambert_series · public projection Generated from the governed public vocabulary for Plectis.
large language model General or domain usage A large language model is a statistical model trained to predict and generate sequences of tokens from context.
Such models can write, summarize, reason, call tools, and transform information, but their outputs depend on training, prompting, context, sampling, and external tools. Fluent language does not by itself establish factual accuracy, understanding, authorship, or authority .
A large language model learns statistical regularities over token sequences and generates continuations conditioned on supplied context. Scale refers to training data, computation, and parameters rather than a guarantee of broad competence. Models can assist with language, code, search, and tool use, yet may fabricate details, inherit bias, follow malicious instructions, or reason inconsistently. Sampling settings and surrounding systems affect outputs. Therefore authority belongs to inspectable sources , executable checks , formal proofs , or accountable human decisions as appropriate; fluency and model identity alone do not validate a conclusion.
Example An agent saying it committed a fix is a sentence, not a commit .
Scope Describes the general class of model , not any one product .
Reader rule Judge an LLM-assisted result through its sources , checks , and reproducible artifacts ; the model name alone supplies no evidence for a claim .
Other names, related terms and sources
Also shown as LLM
large_language_model · public projection Generated from the governed public vocabulary for Plectis.
latency General or domain usage Latency is the elapsed time between the start of an action or request and a defined response or completion point.
Latency measures how long one operation waits, separately from throughput , which measures how much work a system handles per unit time. Queueing, network transfer, computation, storage, and rendering may all contribute .
Latency is an end-to-end delay between two specified events, such as sending a request and receiving its first byte or final response. Different endpoint choices produce different measurements. Total latency may contain queueing time, network travel, server computation, database access, and client rendering. Throughput and latency are related but not equivalent: a system can complete many jobs each second while an individual job waits in a long queue . Because delays are often skewed, median, high percentiles, maximum, and timeout rate can reveal behaviour that a simple arithmetic mean obscures.
Scope A latency measurement is defined by its start and end events, workload, environment , and summary distribution; percentiles expose slow cases that an average can conceal.
Other names, related terms and sources
Also shown as response latency
Source refs sites/microcosm/docs/components.html (reading_context) sites/microcosm/docs/reference.html (reading_context)
latency · public projection Generated from the governed public vocabulary for Plectis.
LaTeX Externally anchored LaTeX is a system for writing structured documents that a typesetting engine turns into formatted output, usually a PDF.
Reader rule The source file and rendered document serve different purposes and should correspond to the same version.
Other names, related terms and sources
Also shown as LaTeX source
Search handles TeX, tex file
latex · format Generated from the governed public vocabulary for Plectis.
lattice System-local specialization In Plectis, the lattice is the network of relationships between rules, skills , concepts , code, and evidence .
typed planes and edges
Meaning scope System-local specialization. Lattice means the repository 's typed governance or relation structure. It is not automatically a mathematical lattice unless the relevant order-theoretic laws are stated and checked .
Scope The lattice covers the relationships between all the named kinds of thing on this site, from components and paper modules to doctrine cards and routes. A reader meets it most directly on the architecture map , where the parts are shown joined together, and implicitly whenever one page links across to a different kind of artifact .
Not this A lattice is not a single diagram or a rigid hierarchy of layers stacked one above another. It is the typed web of relationships among the system's parts, where any kind of artifact can link to any other.
Reader rule This project usage does not assert the axioms of a mathematical lattice.
Other names, related terms and sources
Also shown as system lattice, governance lattice, doctrine lattice
Search handles typed plane lattice, plane lattice
Source refs doctrine module navigation_hologram_theory (paper_module) doctrine skill local_to_general_propagation (skill)
lattice · ontology Generated from the governed public vocabulary for Plectis.
lattice transposition System-coined term Lattice transposition moves a reusable lesson into the kind of system record that can apply it to future work.
portable invariant routing
A local failure may reveal a missing instruction, validation rule, or concept . Plectis retains the original case and places the general refinement in the narrowest existing skill , standard , or other owner that can carry it.
For example, a faulty glossary preview may justify changing the shared glossary rule. It does not automatically justify changing how every kind of document is written.
Example The doctrine card on provenance propagation and non-interference (AX-8) is a concrete instance: it is the rule that a lesson may move between planes only while carrying its origin and without contaminating the plane it enters, which is exactly the discipline lattice transposition follows. See it live: Provenance propagation and non-interference open the doctrine rule that governs how a lesson moves between planes
Meaning scope System-coined term. Lattice transposition re-expresses one governed meaning in another context while preserving its authority and relationships; it is not matrix transposition or unconstrained rewriting.
Scope The term covers how the system turns a one-off lesson into a durable, reusable rule routed to the right governing plane. A reader meets it in the doctrine and routing material, where rules are shown alongside the cases that produced them and the boundaries that limit them.
Not this Lattice transposition is not copying a snippet of code or text from one place to another, and it is not a vague claim that everything in the system is connected. It is the specific, accountable act of lifting a lesson to its underlying rule and routing that rule to the plane that owns it, with the source case kept on record .
Reader rule The lesson's scope must survive the move.
Other names, related terms and sources
Also shown as lattice-transposition, generalized up-propagation, generalised up-propagation
Search handles portable invariant routing, cross-plane up-propagation
Source refs doctrine skill local_to_general_propagation (skill)
lattice_transposition · propagation Generated from the governed public vocabulary for Plectis.
launch-scope decision System-local specialization A launch-scope decision determines what is ready and authorised to be published or made available.
It considers the intended audience, included material, evidence , and unresolved limitations. In Plectis, component checks provide information for this decision but do not independently grant publication authority .
The person responsible for the release must make the decision within the authorised scope . A published selection should then match the material and evidence on which that decision was based.
Example A step claiming a component is ready to host is refused with the release -overclaim finding code, even when the underlying check genuinely passes.
Meaning scope System-local specialization. A launch-scope decision is the separate operator or release -owner judgment to host, ship, or share something; no component check or passing fixture possesses that authority .
Scope Launch-scope decisions are outside every component 's authority on this site.
Reader rule A passing technical check answers its own conditions, not every question about release readiness .
Other names, related terms and sources
Also shown as launch-scope
Source refs standard std_microcosm (source_authority) src/microcosm_core/organs/batch12_release_claim_language_gate.py (source_authority)
launch_scope_decision · public projection Generated from the governed public vocabulary for Plectis.
lay person System-local specialization A lay person is someone who is not a specialist in the subject being discussed.
Meaning scope System-local specialization. Here a lay person is an intended collaborator on the public maths work, not a reader the site talks down to. The phrase does not certify lack of skill in every field.
Scope Hero and Why copy about who the public work is for.
Not this Lay person is not a claim that the mathematics has been simplified into a popularisation.
Reader rule The glossary aims to explain unfamiliar terms without requiring specialist training.
Other names, related terms and sources
Also shown as lay people
Search handles non-specialist, layperson
lay_person · public projection Generated from the governed public vocabulary for Plectis.
Lean General or domain usage Lean is a programming language and proof assistant used to state mathematics and check formal proofs .
Scope Lean establishes that a proof is valid for the statement as written, under the declared axioms .
Not this A carefully written paper argument is not a Lean result until the assistant has accepted a precise form of it.
Reader rule Successful checking applies to that precise formal statement.
Other names, related terms and sources
Also shown as Lean prover
lean · public projection Generated from the governed public vocabulary for Plectis.
Lean kernel Externally anchored The Lean kernel checks that a formal term has its declared type under Lean 's logical rules.
Reader rule Read acceptance together with the exact theorem and its axiom dependencies . An admitted statement can type-check because its gap is represented by an axiom .
Other names, related terms and sources
Also shown as kernel acceptance, pinned kernel
lean_kernel · public projection Generated from the governed public vocabulary for Plectis.
Lean's standard axioms General or domain usage The three usual mathematical axioms permitted here are propext, Quot.sound, and Classical.choice.
Propositional extensionality equates logically equivalent propositions ; quotient soundness identifies quotient representatives related by the defining relation; classical choice selects an element from a nonempty type. A theorem may use only some of them.
Lean 's manual also lists sorryAx among its standard implementation axioms , but it represents unfinished proofs and is excluded from finished results here. Native-evaluation proofs can introduce additional trust dependencies , which also need explicit treatment in an audit .
Example An audit reporting only propext and Quot.sound stays within this permitted set.
Reader rule Compare reported axiom dependencies with the project's allowed set. Here, 'no added axioms' means no dependencies beyond that set, not an axiom -free theorem .
Other names, related terms and sources
Also shown as propext, Quot.sound, Classical.choice
Search handles standard axioms, added axioms
lean_standard_axioms · public projection Generated from the governed public vocabulary for Plectis.
least common multiple General or domain usage For positive integers , the least common multiple is the smallest positive integer divisible by all of them.
For example, the least common multiple of 4 and 6 is 12. In prime factorisation , it keeps the highest exponent of each prime appearing in the inputs.
Least common multiples combine periodic conditions: an event repeating every 4 steps and one repeating every 6 steps align every 12 steps. Definitions involving zero or empty collections need their stated conventions.
Example Erdős #269 concerns the running least common multiples of numbers built from a fixed set of primes .
Scope A result about a least common multiple covers the set it is taken over.
Reader rule Positivity matters because zero is also a common multiple but is not the intended minimum here.
Other names, related terms and sources
Also shown as lcm
least_common_multiple · public projection Generated from the governed public vocabulary for Plectis.
Lebesgue measure General or domain usage Lebesgue measure generalises length on the real line, area in the plane, and volume in higher dimensions .
For an interval it gives the usual length, but it also applies to many fragmented or irregular sets. A set can contain infinitely many points and still have measure zero.
The papers use it to distinguish the size of a set from its number of points or its topological shape. Positive measure, containing an interval, and being infinite are different properties.
Example The rational numbers are dense in the line and have Lebesgue measure zero.
Scope A measure statement about a set is not a membership statement about a point in it.
Reader rule Claims using Lebesgue measure apply to measurable sets in the stated space.
Other names, related terms and sources
Also shown as measure zero
Search handles full measure
lebesgue_measure · public projection Generated from the governed public vocabulary for Plectis.
lemma General or domain usage A lemma is a proved statement introduced mainly to support another argument.
It has the same need for a valid proof as a theorem . The label describes its role in the exposition , not a lower standard of correctness or a guarantee that it is easy.
A lemma may isolate the main difficulty, provide a reusable technical fact, or organise a long proof . Counting lemmas therefore gives little information by itself about the number of distinct mathematical ideas.
Example A denominator lemma may prove the exact reduced form needed by the main irrationality argument.
Scope A lemma establishes its own stated proposition under its declared hypotheses.
Not this A useful observation is not a lemma until it has a stated proposition and proof .
Reader rule Read its hypotheses before applying it to a later step.
Other names, related terms and sources
Also shown as auxiliary theorem, supporting theorem
lemma · public projection Generated from the governed public vocabulary for Plectis.
lemniscate General or domain usage A polynomial lemniscate is a set defined by the size of a complex polynomial , commonly the curve | 𝑝 ( 𝑧 ) | = 𝑐 | p ( z ) | = c .
The term is also used, with qualification, for a sublevel region such as | 𝑝 ( 𝑧 ) | < 𝑐 | p ( z ) | < c or | 𝑝 ( 𝑧 ) | ≤ 𝑐 | p ( z ) | ≤ c . These regions can have several components surrounding the polynomial 's roots.
In the Erdős #1041 material, paths inside the open unit region | 𝑝 ( 𝑧 ) | < 1 | p ( z ) | < 1 are central. Being on its boundary is different from being inside it.
Example The set where the absolute value of z squared minus one equals one half.
Scope Polynomial lemniscate in the complex plane , not only the classical figure-of-eight curve.
Reader rule Check whether the paper means the level curve , the open region , or the filled closed region .
Other names, related terms and sources
Also shown as polynomial lemniscate
lemniscate · public projection Generated from the governed public vocabulary for Plectis.
length of a curve General or domain usage A curve’s length is the supremum of the lengths of polygonal paths through successive points on the curve.
A segment from (0,0) to ( 3 , 4 ) ( 3 , 4 ) has length 5. For a parametrised curve, each ordered partition gives a polygonal approximation. Curve length is the supremum over all these lengths; suitable successive partitions approach that supremum , whereas an arbitrary choice of samples need not.
Problem 1041 is quantitative: connecting roots is insufficient unless the path inside the lemniscate also meets a degree-dependent length bound .
Meaning scope General or domain usage. Metric geometry. Different parametrizations of the same traced curve have the same length under standard conditions.
Scope A continuous curve may have infinite length; finite -length curves are called rectifiable. Retracing a segment counts its length again, even though no new points are added.
Other names, related terms and sources
Also shown as arc length, rectifiable length
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 122 (mathematical_source)
curve_length · mathematical concept Generated from the governed public vocabulary for Plectis.
level curve General or domain usage A level curve is a curve along which a real-valued function has a constant value.
Contour lines on a height map connect points at the same height. For 𝑔 ( 𝑥 , 𝑦 ) = 𝑥 2 + 𝑦 2 g ( x , y ) = x 2 + y 2 , the level at 1 is the unit circle. For 𝑔 ( 𝑥 , 𝑦 ) = 𝑥 2 − 𝑦 2 g ( x , y ) = x 2 − y 2 , the level at 0 instead crosses at the origin, so a level set need not form one smooth curve.
The papers study curves where a polynomial ’s magnitude has a fixed value. Away from critical points , local regularity gives a well-defined tangent, perpendicular to the gradient of the real-valued magnitude function when that gradient is defined. Critical levels can have crossings or changes in the number of components . The general term level set also covers higher-dimensional surfaces and isolated points; calling something a level curve requires the curve geometry in the passage to be justified.
Other names, related terms and sources
Also shown as level curves, contour line
Source refs governed vocabulary term_registry (reading_context)
level_curve · mathematical concept Generated from the governed public vocabulary for Plectis.
level set General or domain usage All inputs at which a function takes one specified value.
For a real-valued function g, its level set at c is { 𝑥 : 𝑔 ( 𝑥 ) = 𝑐 } { x : g ( x ) = c } . The level 𝑥 2 + 𝑦 2 = 1 x 2 + y 2 = 1 is a circle; 𝑥 2 − 𝑦 2 = 0 x 2 − y 2 = 0 is two crossing lines. A level set can also be empty or contain isolated points.
In the lemniscate paper the function is 𝑔 ( 𝑧 ) = | 𝑝 ( 𝑧 ) | g ( z ) = | p ( z ) | , so | 𝑝 ( 𝑧 ) | = 𝑐 | p ( z ) | = c names the level and | 𝑝 ( 𝑧 ) | < 𝑐 | p ( z ) | < c names a region. At positive levels one can equally use the smooth function | 𝑝 | 2 | p | 2 . A critical point on the level can create a crossing and invalidate arguments that need a single tangent.
Meaning scope General or domain usage. Level sets require equality ; the local curve conclusion additionally requires regularity at the point under consideration.
Scope Smoothness of the function alone does not make every level a smooth curve. For a continuously differentiable planar function , a nonzero gradient gives a smooth local curve through that point.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::res:locus (mathematical_source)
level_set · mathematical concept Generated from the governed public vocabulary for Plectis.
limit General or domain usage “Limit” can mean a restriction or, in mathematics , the value approached by a sequence or function .
Reader rule The surrounding phrase determines which meaning applies.
Other names, related terms and sources
Also shown as evidence limit
Search handles evidence limits
limit · public projection Generated from the governed public vocabulary for Plectis.
limit inferior General or domain usage The limit inferior is the limiting lower bound obtained by discarding longer and longer finite beginnings of a sequence .
For the oscillating sequence 1,0,1,0,…, the limit inferior is 0 while the limit superior is 1. For 1/n, both equal 0, matching the ordinary limit . Thus liminf records persistent low behavior.
A finite liminf for consecutive prime gaps says gaps at most slightly above that level recur arbitrarily far out. It does not bound every sufficiently late gap, so large gaps may coexist with the bounded recurring subsequence .
Meaning scope General or domain usage. Real sequences . Stronger information than a one-time minimum, weaker than a full limit .
Scope Form the infimum of each tail { 𝑎 𝑘 : 𝑘 ≥ 𝑛 } { a k : k ≥ n } ; these tail infima increase, and their limit is liminf 𝑎 𝑛 a n , possibly infinite . No term needs equal the result, and a one-time early minimum is irrelevant.
Other names, related terms and sources
Also shown as liminf, limit infimum
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 1216 (mathematical_source)
limit_inferior · mathematical concept Generated from the governed public vocabulary for Plectis.
limit superior General or domain usage The limit superior is the limiting upper bound obtained by discarding longer and longer finite beginnings of a sequence .
For 1,0,1,0,…, the limit superior is 1 and the limit inferior is 0. If a sequence converges , both values equal its limit ; disagreement records lasting oscillation rather than a single early fluctuation.
The reciprocal -tail analysis uses limsup to control the worst ratios or jumps that recur arbitrarily late without assuming full convergence . A limsup bound is eventual in an approximate sense, not necessarily a pointwise bound at the limiting constant.
Meaning scope General or domain usage. Real sequences and asymptotic analysis. It need not equal any single late maximum.
Scope Take the supremum of each tail { 𝑎 𝑘 : 𝑘 ≥ 𝑛 } { a k : k ≥ n } ; these tail suprema decrease, and their limit is l i m s u p 𝑎 𝑛 lim sup a n , allowing infinite values. The limsup need not occur as an actual term.
Other names, related terms and sources
Also shown as limsup, limit supremum
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 612 (mathematical_source)
limit_superior · mathematical concept Generated from the governed public vocabulary for Plectis.
lineage General or domain usage Lineage records where an item came from and which transformations led to its present form.
For a generated page, it may identify source records , the builder, and the relevant versions. For a claim , it may connect an interpretation to earlier results or observations.
Plectis uses lineage to make copies and summaries inspectable. When a source changes, those connections help identify which derived artifacts may need to be rebuilt or reconsidered.
Example A generated glossary entry has lineage back to its registry row and the site builder.
Meaning scope General or domain usage. Lineage is the documented chain from an artifact or claim to its sources and transformations. A timestamp or source link alone is not complete lineage if it omits the relevant transformations.
Scope The term covers documented origin and transformation paths for files, concepts , results, and public pages.
Not this A timestamp alone is not lineage because it does not identify origins or transformations.
Reader rule Origin and correctness are separate questions: a traceable item can still contain an error.
Other names, related terms and sources
Also shown as lineages, source lineage, artifact lineage
lineage · public projection Generated from the governed public vocabulary for Plectis.
linear combination General or domain usage A linear combination is a finite sum of vectors multiplied by scalar coefficients .
Meaning scope General or domain usage. Linear algebra and function spaces. Linear refers to the operations, not a straight visual arrangement.
Scope The objects must belong to a common vector space , and coefficients must come from its scalar field, such as the rationals or reals. 'Nontrivial' means at least one coefficient is nonzero.
Other names, related terms and sources
Also shown as linear combinations
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 6358 (mathematical_source)
linear_combination · mathematical concept Generated from the governed public vocabulary for Plectis.
linear flow on a torus General or domain usage Motion at constant velocity with each coordinate read modulo its period.
On ℝ 𝑑 / ℤ 𝑑 R d / Z d it has the form 𝜃 ( 𝑡 ) = 𝜃 0 + 𝑡 𝜔 θ ( t ) = θ 0 + t ω modulo ℤ 𝑑 Z d . One coordinate behaves like a clock repeatedly wrapping around its circle. Rational relations among the velocity coordinates can confine the motion to a smaller subtorus.
The #269 flow Θ ( 𝑠 ) = ( 𝑠 m o d l o g 𝑞 ) Θ ( s ) = ( s mod log q ) simultaneously records phases for several primes . A crossing of the q-coordinate marks a power of q; changing the starting phase can interchange two crossings. The proof uses recurrence and density inside the actual orbit closure , without assuming density in the full product .
Meaning scope General or domain usage. This row concerns constant-velocity translation flows, not arbitrary nonlinear dynamics on a torus.
Scope Continuous time t and sampled integer time n give different density tests . A continuous flow can fill a torus even though its time-one map visits only part of it.
Other names, related terms and sources
Also shown as torus flow, linear torus flow, Kronecker flow
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:sec:flow (mathematical_source)
torus_flow · mathematical concept Generated from the governed public vocabulary for Plectis.
linear form General or domain usage A linear form is an expression 𝑎 1 𝑥 1 + ⋯ + 𝑎 𝑛 𝑥 𝑛 a 1 x 1 + ⋯ + a n x n , or equivalently a linear map from a vector space to its scalar field.
In two variables , 3x-2y is an integer linear form. Evaluating it at particular numbers can create a small nonzero quantity; irrationality proofs exploit that a rational target cannot admit certain integer linear forms that approach zero too quickly.
The paper constructs integer combinations of 1 and 𝐹 ( 𝑎 / 𝑏 ) F ( a / b ) whose absolute values tend to zero. If 𝐹 ( 𝑎 / 𝑏 ) F ( a / b ) were rational , clearing its fixed denominator would force every nonzero combination to stay a definite distance from zero.
Example In two variables , 3x-2y is an integer linear form.
Meaning scope General or domain usage. A linear form has no constant term; a constant term gives an affine form unless one of the listed variables is fixed to one.
Scope A homogeneous linear form has no constant term. Authors sometimes call 𝑎 0 + 𝑎 1 𝑥 1 + ⋯ a 0 + a 1 x 1 + ⋯ an affine linear form, while number-theory prose may include 1 among the variables and still say linear form. “Integral” describes the coefficients , not necessarily the value.
Other names, related terms and sources
Also shown as integer linear form, rational linear form
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 257 (mathematical_source)
linear_form · mathematical concept Generated from the governed public vocabulary for Plectis.
linear independence General or domain usage A family is linearly independent if no finite combination of its members equals zero unless every scalar coefficient is zero.
For example, 𝑎 ( 1 , 0 ) + 𝑏 ( 0 , 1 ) = ( 0 , 0 ) a ( 1 , 0 ) + b ( 0 , 1 ) = ( 0 , 0 ) forces 𝑎 = 𝑏 = 0 a = b = 0 , so those two plane vectors are independent. The vectors ( 1 , 0 ) ( 1 , 0 ) and ( 2 , 0 ) ( 2 , 0 ) are dependent because twice the first minus the second is zero.
Disjoint supports and nonsingular evaluation matrices certify that families of arithmetic sequences are independent.
Meaning scope General or domain usage. Vector spaces over a field. Stronger than objects merely being different.
Scope Always state the scalar field; rational independence can differ from real independence.
Other names, related terms and sources
Also shown as linearly independent
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos-269-three-prime-running-lcm.tex::line 182 (mathematical_source)
linear_independence · mathematical concept Generated from the governed public vocabulary for Plectis.
linear map General or domain usage A linear map preserves vector addition and multiplication by scalars .
Writing L for the map , 𝐿 ( 𝑢 + 𝑣 ) = 𝐿 ( 𝑢 ) + 𝐿 ( 𝑣 ) L ( u + v ) = L ( u ) + L ( v ) and 𝐿 ( 𝑐 𝑢 ) = 𝑐 𝐿 ( 𝑢 ) L ( c u ) = c L ( u ) . For example, 𝐿 ( 𝑥 , 𝑦 ) = ( 2 𝑥 , 2 𝑦 ) L ( x , y ) = ( 2 x , 2 y ) is linear over the reals ; adding a fixed nonzero translation produces an affine map instead.
Matrices represent linear maps after bases are chosen. The derivative of a differentiable function is also a linear map describing its first-order local change, even when the original function is nonlinear.
Scope The vector spaces and allowed scalar field are part of the definition, and every linear map sends zero to zero.
Other names, related terms and sources
Also shown as linear transformation, linear maps
Source refs governed vocabulary term_registry (reading_context)
linear_map · mathematical concept Generated from the governed public vocabulary for Plectis.
linear recurrence General or domain usage A linear recurrence expresses a sequence term as a linear combination of a fixed number of earlier terms, possibly with a separate forcing term.
Scope Linearity concerns the unknown sequence for fixed coefficients . A system whose coefficients themselves depend on another evolving sequence can need additional analysis beyond the linear recurrence.
Other names, related terms and sources
Also shown as linear recurrence relation, linear recurrences
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::eq:three-tail (mathematical_source)
linear_recurrence · mathematical concept Generated from the governed public vocabulary for Plectis.
linear span General or domain usage In linear algebra, the span of a set of vectors is the set of all finite linear combinations of them.
span
A linear combination scales vectors by allowed scalars and adds the results. For example, two nonparallel vectors in the ordinary plane span the plane; one nonzero vector spans a line through the origin.
The underlying field and vector space matter. Claims about dimension concern the amount of independent structure in the span, not merely how many vectors were listed.
Example The span of ( 1 , 0 ) ( 1 , 0 ) and ( 2 , 0 ) ( 2 , 0 ) is the horizontal axis.
Scope Linear-algebra sense over the rationals here, not a time span or a bridge .
Reader rule A spanning family may contain redundant vectors and need not be a basis .
Other names, related terms and sources
Also shown as span, spans
span · public projection Generated from the governed public vocabulary for Plectis.
little-o notation General or domain usage A comparison saying one quantity becomes negligible relative to another.
The function l o g 𝑛 log n is 𝑜 ( 𝑛 ) o ( n ) because l o g 𝑛 / 𝑛 log n / n tends to zero. Although both grow without bound , l o g 𝑛 log n becomes negligible on the scale of n. In contrast, 3 𝑛 3 n is 𝑂 ( 𝑛 ) O ( n ) but not 𝑜 ( 𝑛 ) o ( n ) .
A block length 𝑜 ( l o g l o g 𝑋 ) o ( log log X ) may still increase, but its ratio to l o g l o g 𝑋 log log X vanishes. The notation controls relative size only; it supplies neither a universal numerical cutoff nor a rate of convergence unless further estimates are given.
Meaning scope General or domain usage. Asymptotic analysis. Strictly stronger than Big-O at the same comparison scale.
Scope When g is nonzero near the stated limit , 𝑓 = 𝑜 ( 𝑔 ) f = o ( g ) means 𝑓 / 𝑔 → 0 f / g → 0 . The limit and fixed parameters are part of the assertion. Little-o is strictly stronger than Big-O at the same comparison scale.
Other names, related terms and sources
Also shown as little o
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 37 (mathematical_source)
little_o_notation · mathematical concept Generated from the governed public vocabulary for Plectis.
living system posture System-coined term Living system posture means treating claims about a changing system as statements about an identifiable state or version.
read with currentness
A report can remain a valid record of an earlier run after the implementation has changed. Plectis distinguishes that historical record from evidence about the system as it exists now.
This does not make every mathematical theorem time-dependent. It concerns facts such as which proof version was checked , which files were published, or which behaviour a particular run demonstrated.
Example The evidence page, "What the pass proves", is a concrete instance: it sets out what a given pass actually checked and found at the time it ran, which is the kind of dated record that living system posture asks you to read as evidence from that moment rather than as a standing guarantee. See it live: What the pass proves (evidence) see a dated record of what a pass actually checked and found
Meaning scope System-coined term. Living-system posture means maintaining the repository as an evolving, interdependent substrate whose feedback updates its records and routes; it does not claim biological life, autonomy, or production readiness .
Scope The term covers how every dated artifact on the site should be read, from recorded results and generated pages to doctrine and raw quotes. A reader meets it wherever a record states what a pass found or what the system once contained, and the live question is whether that record still describes the system today.
Not this Living system posture is not a claim that the system is unstable or that nothing on the site can be trusted, and it does not mean old records are discarded. It is the practice of reading each record as tied to a time and confirming current claims against the live source .
Reader rule The relevant source and refresh rule determine whether an old observation still applies.
Other names, related terms and sources
Also shown as living_system_posture, system is always changing
Search handles always-changing system, always changing system, change posture, currentness, currentness posture, regime-bound substrate, old regime
Source refs doctrine skill local_to_general_propagation (skill)
living_system_posture · posture Generated from the governed public vocabulary for Plectis.
locus General or domain usage A locus is a place where something occurs or is defined; in mathematics , it can mean all points satisfying a condition.
In the system documentation, a code locus identifies the file or function implementing a behaviour. In geometry, the locus of points at distance one from the origin is the unit circle.
Both uses help make a description precise: they replace an unspecified “somewhere” with a location or condition that can be examined directly.
Example The first-use underline rule has its styling locus in the public site's stylesheet.
Reader rule The subject determines whether the word means a source location or a mathematical set .
Other names, related terms and sources
Also shown as loci, code locus, source locus
locus · public projection Generated from the governed public vocabulary for Plectis.
log file General or domain usage A log file stores timestamped or ordered records produced while a program , service, or job runs.
Logs can record events, warnings, errors, identifiers , and diagnostic context. Their contents and retention depend on configuration , and absence of a log does not prove that nothing happened.
Log files help reconstruct execution after the fact, but they can be incomplete, delayed, rotated, altered, or lost. A useful log states time, event, source , and correlation identity without exposing credentials or private payloads . Plectis queue reconciliation checks whether a claimed job’s log is present and current. That supports a liveness diagnosis; it does not by itself establish the job’s full result.
Example A job log records its start, selected fixture , exit code , and completion time.
Meaning scope General or domain usage. A file recording events or execution observations over time, rather than source code that instructs a program what to do.
Scope Treat logs as scoped observations from the code that emitted them; correlate them with other evidence and protect sensitive data.
Not this A source file containing program instructions is not an execution log.
Other names, related terms and sources
Also shown as log files, execution log
Source refs sites/microcosm/docs/paper-module-metabolism-queue-reconciliation.html (reading_context)
log_file · public projection Generated from the governed public vocabulary for Plectis.
logarithm General or domain usage For a positive base b other than 1, the real logarithm l o g 𝑏 ( 𝑥 ) log b ( x ) is the exponent y satisfying 𝑏 𝑦 = 𝑥 b y = x , for 𝑥 > 0 x > 0 .
For example, l o g 2 ( 8 ) = 3 log 2 ( 8 ) = 3 because 2 3 = 8 2 3 = 8 . In advanced mathematics , l o g log without a base usually means the natural logarithm with base e.
The papers take logarithms of products and least common multiples to compare multiplicative growth efficiently using additive estimates and asymptotic scales.
Scope For positive inputs, logarithms turn products into sums and real powers into multipliers: l o g ( 𝑥 𝑦 ) = l o g 𝑥 + l o g 𝑦 log ( x y ) = log x + log y and l o g ( 𝑥 𝑎 ) = 𝑎 l o g 𝑥 log ( x a ) = a log x . Complex logarithms require separate branch choices.
Other names, related terms and sources
Also shown as natural logarithm
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 444 (mathematical_source)
logarithm · mathematical concept Generated from the governed public vocabulary for Plectis.
logarithmic capacity General or domain usage A notion of size for a compact planar set, defined through the smallest logarithmic interaction energy of measures supported on it.
For a compact set K, set c a p ( 𝐾 ) = e x p ( − i n f 𝐼 ( 𝜇 ) ) cap ( K ) = exp ( − inf I ( μ ) ) , where 𝜇 μ ranges over probability measures on K and 𝐼 ( 𝜇 ) = ∫ ∫ l o g ( 1 / | 𝑧 − 𝑤 | ) 𝑑 𝜇 ( 𝑧 ) 𝑑 𝜇 ( 𝑤 ) I ( μ ) = ∫ ∫ log ( 1 / | z − w | ) d μ ( z ) d μ ( w ) . A disc of radius r has capacity r. Sets with infinite minimum energy have capacity zero.
The #1041 paper bounds the capacity of a selected lemniscate component and then converts that bound into an area estimate. Its component -capacity hypothesis measures a geometric saving that is stronger than merely having few roots in the component .
Meaning scope General or domain usage. This is planar logarithmic capacity for compact sets ; it is distinct from other capacities in potential theory and from system resource capacity.
Scope Capacity differs from area, perimeter and diameter. Scaling a set by a complex number a scales its capacity by | 𝑎 | | a | , while area scales by | 𝑎 | 2 | a | 2 . A root count alone does not determine capacity.
Other names, related terms and sources
Also shown as logarithmic capacities, logarithmic cap
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1374 (mathematical_source)
logarithmic_capacity · mathematical concept Generated from the governed public vocabulary for Plectis.
lower semicontinuity General or domain usage Lower semicontinuity means a function ’s value at a limit point is no larger than the limit inferior of nearby values.
For real-valued functions on metric spaces , 𝑥 𝑛 → 𝑥 x n → x implies 𝐹 ( 𝑥 ) ≤ l i m i n f 𝐹 ( 𝑥 𝑛 ) F ( x ) ≤ lim inf F ( x n ) . A downward dip is allowed: 𝐹 ( 0 ) = 0 F ( 0 ) = 0 and 𝐹 ( 𝑥 ) = 1 F ( x ) = 1 elsewhere is lower semicontinuous. Reversing those values creates an upward spike and fails the condition.
It ensures the limiting polynomial competitor has path length no larger than the limiting lengths of approximating competitors.
Meaning scope General or domain usage. Analysis and optimization. Direction matters: upper semicontinuity reverses the inequality .
Scope The direction matters: lower semicontinuity helps minimise a function , because passing to a limit cannot increase its value above the limiting lower bound .
Other names, related terms and sources
Also shown as lower semicontinuous
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 1073 (mathematical_source)
lower_semicontinuity · mathematical concept Generated from the governed public vocabulary for Plectis.
M
machine-checked General or domain usage Machine-checked means software has verified a stated property of the supplied material.
The strength of that verification depends on the checker . A Lean kernel check concerns a formal proof ; a schema check concerns a file's structure; a test run concerns behaviour on particular inputs.
The phrase alone does not mean that every surrounding claim is true. The encoded statement, assumptions , source version, and connection to the informal explanation determine how far a mathematical checking result reaches.
Example A theorem proved for all bases at least two is machine-checked for that range, and for nothing wider.
Scope Machine checking establishes the checked statement only.
Reader rule Always identify what was checked and by which method.
Other names, related terms and sources
Also shown as Lean-checked
Search handles lean checked
machine_checked · public projection Generated from the governed public vocabulary for Plectis.
machine-readable General or domain usage Machine-readable information is structured so software can reliably parse and act on it.
JSON , CSV, typed records , and documented APIs can be machine-readable when their grammar and field meanings are explicit. Human-readable prose may still be processed by software , but ambiguity makes it a weaker contract . Machine readability concerns form, not truth or quality.
Machine-readable information has enough explicit structure for software to parse it consistently without relying on visual layout or open-ended human interpretation. Formats such as JSON , CSV, XML, typed records , and APIs can qualify when their syntax, encoding, field meanings, identifiers , and version rules are documented. Merely placing prose in a digital file does not provide the same contract . Successful parsing establishes structural acceptance, not truth, completeness, safety, or semantic agreement. Independent consumers also need evolution and compatibility rules when producers may add, remove, or reinterpret fields.
Example The claim registry and the semantic corpus are machine-readable; the papers describing them are not.
Scope Machine-readable form establishes nothing by itself; the content still has to be right.
Reader rule Consistent interpretation depends on an agreed syntax and field meanings; stable identifiers and version rules matter when records are referenced or the format evolves.
Other names, related terms and sources
Also shown as machine readable
machine_readable · public projection Generated from the governed public vocabulary for Plectis.
Mahler function General or domain usage A Mahler function satisfies a nontrivial linear functional equation with polynomial coefficients relating it to its successive power substitutions.
Meaning scope General or domain usage. The base integer and coefficient field are part of the definition. Functional classifications do not automatically transfer to arithmetic classifications of individual values.
Scope This is a functional equation for the entire series . It does not determine whether a particular value at a rational input is rational .
Other names, related terms and sources
Also shown as k-Mahler function, Mahler series, k-Mahler series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::lines 525–539 (mathematical_source)
mahler_function · mathematical concept Generated from the governed public vocabulary for Plectis.
manifest General or domain usage A manifest is a structured inventory of the files or objects included in a build, package , or release .
It may record paths, versions, content digests , sizes, and relationships. Plectis uses such inventories to describe what a published collection contains and to support consistency checks .
A manifest helps detect missing, unexpected, or changed artifacts . It does not itself establish the correctness of their contents, and its own source and generation process need to remain identifiable.
Example The site content manifest lists every generated public file and its source -bound metadata .
Reader rule The manifest's listed content should agree with the actual files.
Other names, related terms and sources
Also shown as content manifest, build manifest
Search handles manifests
manifest · public projection Generated from the governed public vocabulary for Plectis.
map General or domain usage A map presents a collection and the relationships that help someone navigate it.
Scope A map covers what it was generated over, as of its last build.
Reader rule In a mathematical passage, “map” commonly means a function instead.
Other names, related terms and sources
Also shown as maps
map · public projection Generated from the governed public vocabulary for Plectis.
mathematical continuity General or domain usage A function is continuous when sufficiently close inputs always produce sufficiently close outputs.
For a function between metric spaces , continuity at x means that every output tolerance 𝜀 > 0 ε > 0 has an input tolerance 𝛿 > 0 δ > 0 : whenever y is less than 𝛿 δ from x, 𝑓 ( 𝑦 ) f ( y ) is less than 𝜀 ε from 𝑓 ( 𝑥 ) f ( x ) . For real or complex functions , these distances are written | 𝑦 − 𝑥 | | y − x | and | 𝑓 ( 𝑦 ) − 𝑓 ( 𝑥 ) | | f ( y ) − f ( x ) | .
The lemniscate problem requires a path whose every point stays inside { | 𝑓 | < 1 } { | f | < 1 } ; continuity makes it one unbroken connection between the selected roots.
Meaning scope General or domain usage. This is continuity of a mathematical function or path, distinct from preserving work across interrupted sessions.
Scope Continuity allows bending and changing speed but forbids jumps. A continuous path is a continuous function from an interval into the space being studied.
Other names, related terms and sources
Also shown as continuous function, continuous path, continuous map
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 185 (mathematical_source)
mathematical_continuity · mathematical concept Generated from the governed public vocabulary for Plectis.
mathematical induction General or domain usage Mathematical induction proves a claim for every natural-number index by establishing a starting case and a valid step to the next case.
The step assumes the claim for an arbitrary index n and proves it for 𝑛 + 1 n + 1 . Together with the base case, that gives the claim throughout the stated range.
Strong induction allows the step to use all earlier cases. The papers use these methods to establish recurrence formulas, divisibility propagation, and finite identities later used in arguments about limits .
Scope The starting index and induction hypothesis must match the statement being proved.
Other names, related terms and sources
Also shown as induction, inductive proof
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 620 (mathematical_source)
mathematical_induction · mathematical concept Generated from the governed public vocabulary for Plectis.
mathematical limit General or domain usage A mathematical limit describes the value a sequence or function approaches as its index or input approaches a specified point or infinity.
Reader rule The limit and the value at a particular input are different concepts .
Other names, related terms and sources
Also shown as limit of a sequence, limit of a function
Search handles tends to
mathematical_limit · mathematical concept Generated from the governed public vocabulary for Plectis.
mathematical priority General or domain usage Mathematical priority concerns who first established or discovered a result, as supported by the scholarly record .
It can involve dated manuscripts, publications, communications, and careful comparison of what each source actually proved. Closely related results may have different hypotheses, conclusions, or forms of contribution .
When this site says it asks for no priority on someone else's solution, it means using the project as a starting point does not give the project authorship of that person's result.
Example If you solve a remaining obligation , the stated offer is that the result is yours.
Scope Mathematical recognition of discovery, not process or queue priority.
Not this A task marked high priority in a work tracker is not mathematical priority.
Reader rule The project's own contribution records cannot settle an unresolved priority question by declaration .
Other names, related terms and sources
Also shown as zero priority
mathematical_priority · public projection Generated from the governed public vocabulary for Plectis.
mathematician System-local specialization A mathematician studies mathematical structures and questions through definitions, reasoning, and proof .
The term covers many specialisms and forms of work, including research, teaching, exposition , and applications. Expertise relevant to one paper may differ from the expertise needed for another.
A contribution may clarify a proof , identify prior work, refute a proposed step, or find a new result. Its value depends on the work itself rather than on agreement with the project's current direction.
Example The hero offers mathematicians a place to collaborate and keep credit . See it live: Papers the public maths write-ups a collaborator would read
Meaning scope System-local specialization. On this site a mathematician is an invited reader and credit -bearing collaborator on the public Erdős -problem work, not a title the project awards.
Scope Landing copy about who the published maths is for.
Not this Calling someone a mathematician here is not a claim of academic appointment or peer review .
Reader rule The site invites mathematical judgement about correctness, context, significance, and useful next questions.
Other names, related terms and sources
Also shown as mathematicians
mathematician · public projection Generated from the governed public vocabulary for Plectis.
mathematics General or domain usage Mathematics studies patterns, quantities, structures, and relationships through precise definitions and logical reasoning.
Scope Mathematics here covers the published problems, definitions, proofs , computations, and explanatory papers .
Not this A numerical pattern observed in examples is not by itself a mathematical proof .
Reader rule That collection is one research programme within a much wider subject.
Other names, related terms and sources
Also shown as maths, math
Search handles mathematical work
mathematics · subject Generated from the governed public vocabulary for Plectis.
Mathlib Externally anchored Mathlib is the community-maintained library of mathematical definitions, theorems , and tools for Lean .
It supplies reusable material across many fields, along with notation and tactics that help authors build further proofs . A local project can import the relevant modules instead of developing all foundations itself.
Using a theorem from the library requires matching its assumptions and types. New declarations built on Mathlib should distinguish the project's contribution from results already supplied by the library.
Example A proof may import Mathlib's number-theory definitions before stating a project-specific theorem .
Scope Mathlib covers the library revision and modules imported by the named Lean project.
Not this Mathlib is not a collection of informal papers and does not make every mathematical claim on this site machine-checked .
Reader rule The Mathlib version is part of a formal project's reproducible environment .
Other names, related terms and sources
Also shown as Lean mathematical library
Search handles mathlib4
mathlib · external library Generated from the governed public vocabulary for Plectis.
matrix General or domain usage A matrix is a rectangular array of entries , often representing numerical data, simultaneous equations , or a linear map .
The matrix [[1,2],[3,4]] has two rows and two columns. Multiplying it by a coordinate vector forms prescribed linear combinations .
Evaluation matrices record arithmetic functions at selected inputs so modular diagonal patterns can certify independence.
Meaning scope General or domain usage. Linear algebra. Matrix can also mean an embedding material outside mathematics .
Scope Entries can be numbers or other elements of a specified algebraic system. Rows and columns have distinct roles; transposition interchanges them.
Other names, related terms and sources
Also shown as matrices
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 103 (mathematical_source)
matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
maximal ideal General or domain usage A maximal ideal is a proper ideal contained in no larger proper ideal. In a commutative ring with identity, quotienting by it gives a field.
In the integers , the maximal ideals are exactly the multiples of a prime p; the quotient is arithmetic modulo p. For a commutative ring with identity, an ideal is maximal exactly when its quotient is a field. The whole ring is excluded by the word proper.
At a maximal ideal, the general residue-field construction simplifies: 𝜅 ( 𝑚 ) = 𝑅 / 𝑚 κ ( m ) = R / m . This is why quotienting the ring of integers of a number field by a nonzero prime ideal directly produces a finite field .
Example In Z, the maximal ideals are exactly (p) for ordinary primes p.
Other names, related terms and sources
Also shown as maximal ideals
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 287 (prerequisite_dependency)
maximal_ideal · mathematical concept Generated from the governed public vocabulary for Plectis.
maximum principle General or domain usage A maximum principle says that a function satisfying specified equations or inequalities cannot have a strict interior maximum, and often places its largest value on the boundary.
For a nonconstant holomorphic function , the maximum modulus principle rules out an interior maximum of its absolute value . A harmonic function has an analogous principle for its value. On a closed disc, continuity at the boundary lets the corresponding maximum be located there.
Each version needs its own hypotheses, including the domain and the equation or regularity condition on the function . A boundary statement on an unbounded region also needs control at infinity. The papers use the holomorphic and harmonic versions to carry a boundary estimate into the interior. For 𝑓 ( 𝑧 ) = 𝑧 f ( z ) = z on the closed unit disc , the maximum modulus is 1, attained on its boundary.
Example On a closed disc, a holomorphic function continuous to the boundary reaches its maximum modulus on the boundary.
Other names, related terms and sources
Also shown as maximum modulus principle
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 977 (mathematical_source)
maximum_principle · mathematical concept Generated from the governed public vocabulary for Plectis.
mechanism System-local specialization A mechanism is the process or arrangement through which an outcome is produced.
system movement pattern
Explaining a mechanism means identifying relevant parts, inputs, steps, and interactions. In Plectis, that explanation connects a component ’s stated behaviour to its implementation and evidence .
For example, “detects drift ” becomes inspectable when the explanation identifies two sources , the comparison rule, and the record produced when they disagree. A mechanism can exist before it is fully understood or documented.
Example The Executable Doctrine Grammar component is a mechanism: it is the surface that requires a piece of doctrine to be run as actual steps before it is treated as authoritative , so the rule is bound to a working process rather than to wording alone. See it live: Executable Doctrine Grammar open the component that turns a rule into runnable steps
Meaning scope System-local specialization. Mechanism means a governed doctrine or implementation operator backed by local sources . It is not automatically a proven causal mechanism in the scientific sense.
Scope The term covers the "how it works" layer that connects concepts , principles , skills , standards , and code. A reader meets it across the doctrine pages, where each rule is expected to be backed by an explanation of the process that carries it out.
Not this Saying “it detects drift ” names a behaviour but leaves the mechanism unexplained.
Reader rule A label for an outcome does not explain the process that produces it.
Other names, related terms and sources
Also shown as mech, mech_*, doctrine mechanism
Source refs standard std_mechanism (standard) doctrine skill concept_mechanism_curation (skill)
mechanism · doctrine Generated from the governed public vocabulary for Plectis.
mechanism contract System-coined term A mechanism contract states what a component is expected to do and how that expectation can be checked .
Reader rule The contract states the expectation; source and execution evidence show whether it is met.
Other names, related terms and sources
Also shown as mechanism contracts
mechanism_contract · public projection Generated from the governed public vocabulary for Plectis.
meromorphic function General or domain usage A function holomorphic on its domain except at isolated poles.
Meaning scope General or domain usage. Meromorphicity is relative to a specified complex domain; infinitely many poles must have no accumulation point inside it.
Scope Poles cannot accumulate inside the domain. An essential singularity in the domain prevents meromorphicity there. A quotient may have removable points after common factors cancel, so its unreduced denominator alone does not locate genuine poles.
Other names, related terms and sources
Also shown as meromorphic, meromorphic functions
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2550 (mathematical_source)
meromorphic_function · mathematical concept Generated from the governed public vocabulary for Plectis.
Mersenne number General or domain usage A Mersenne number has the form 2 𝑛 − 1 2 n − 1 for a positive integer n.
The sequence begins 1, 3, 7, 15, 31. Some are prime , but many are composite; “Mersenne prime ” is the more specific term for a prime of this form.
The Erdős #257 material studies reciprocal sums involving these denominators . Expressions 𝑏 𝑛 − 1 b n − 1 use a similar construction at another base, but the unqualified name Mersenne conventionally refers to base two.
Example 31 equals two to the fifth minus one.
Scope Mersenne number here means two to the n minus one for any n, not only the prime ones.
Reader rule In base two, 2 𝑛 − 1 2 n − 1 is written as n consecutive ones.
Other names, related terms and sources
Also shown as Mersenne
mersenne_number · public projection Generated from the governed public vocabulary for Plectis.
metabolism System-local specialization “Metabolism” is Plectis's name for the recurring work that keeps stored knowledge and generated views in step with their sources .
governed substrate upkeep
The process identifies changes, queues bounded work, refreshes affected artifacts , and records the checks . It covers upkeep such as rebuilding an index or incorporating a supported lesson into an existing rule.
The process should have explicit owners and stopping conditions. A refresh that runs successfully still needs to preserve source meaning and satisfy the checks governing its output.
Example The Engine Room Metabolism Runtime is a concrete instance: the working machinery that runs these upkeep loops over the underlying material and keeps derived surfaces current. See it live: Engine Room Metabolism Runtime open the runtime that runs the upkeep loops
Meaning scope System-local specialization. Metabolism is a local metaphor for governed substrate upkeep and repeated state transitions. It is not biological metabolism and makes no biological claim .
Scope Metabolism covers the maintenance and refresh machinery beneath the system, spanning the lane that turns raw operator notes into structured records , the always-on runtime , and the periodic rebuilds of generated pages. A reader meets it whenever a page notes that a surface is generated, populated, or kept in sync rather than authored directly.
Not this Metabolism here is not biological metabolism and not a vague word for activity in general. It is the bounded machinery that refreshes derived surfaces and records what it changed.
Reader rule The biological word is a metaphor for maintenance and renewal in the software .
Other names, related terms and sources
Also shown as metabolic system, metabolism lane, generalized metabolism
Search handles generalised metabolism, surface metabolism, row metabolism, background metabolism, runtime metabolism, system metabolism, raw-seed metabolism
Source refs doctrine module continuous_runtime_layer (paper_module) doctrine module navigation_hologram_theory (paper_module) docs/metabolismd.md (runtime_doc) runtime module metabolism_governor (runtime_code)
metabolism · runtime Generated from the governed public vocabulary for Plectis.
metadata General or domain usage Metadata is information that describes other data, a file, a record , or an event.
Metadata can name a title, author, date, format, identifier , size, source , or status without containing the described material itself. It helps people and programs find, sort, validate , and interpret records .
Metadata ranges from simple file properties to structured catalogue records and run summaries. It can support discovery and checking, but its accuracy depends on how it was produced and maintained. Plectis pages use metadata for identifiers , source routes, dates, counts, and declared status. A metadata record is evidence about those fields, not a substitute for the source body or the event it describes.
Example A paper record lists its title, authors, DOI, publication date, and source URL .
Meaning scope General or domain usage. Whether information is metadata depends on what it describes; an abstract can serve as metadata in a catalogue even though it is prose.
Scope Read metadata as a description of an object or event; inspect the underlying content when the claim depends on that content.
Not this A paper ’s main argument or full dataset is content rather than metadata, even though an abstract may serve as descriptive metadata in a bibliographic system.
Other names, related terms and sources
Also shown as descriptive metadata, record metadata
Source refs sites/microcosm/index.html (reading_context)
metadata · public projection Generated from the governed public vocabulary for Plectis.
metadata-only System-local specialization Metadata-only means a record contains information about material or a run without including the underlying bodies themselves.
It may list counts, identifiers , classifications, digests , and outcomes while omitting the source text or inputs. This can make a record smaller or limit what it discloses.
A digest can identify a file but cannot reconstruct it. A metadata-only result therefore needs an appropriate source route if readers are expected to examine the evidence behind its verdict.
Example A classifier run over non-public rows writes counts and class labels; the rows themselves never enter the record .
Meaning scope System-local specialization. Metadata-only means a record carries declared shape, counts, digests , and verdicts without the input bodies; it is not a universal guarantee that no sensitive information exists or permission to publish.
Scope A metadata-only record establishes only the declared shape and outcome of its run. It neither exposes the underlying content nor proves that every possible private field was excluded unless the named leakage and public-safety checks also passed.
Reader rule The omitted content may still be necessary to independently inspect or repeat the work.
Other names, related terms and sources
Also shown as metadata-only result
Search handles metadata-only record
Source refs standards/std_microcosm_workingness_record.json (source_authority) src/microcosm_core/validators/source_module_boundary.py (source_authority)
metadata_only · public projection Generated from the governed public vocabulary for Plectis.
metric General or domain usage A metric is either a defined performance measure or, in mathematics , a distance function satisfying the metric axioms .
Response time and error rate are evaluation metrics. A mathematical metric assigns a distance 𝑑 ( 𝑥 , 𝑦 ) d ( x , y ) to each pair of points, with zero only for identical points, symmetry, and the triangle inequality .
The two senses should remain separate. Evaluation metrics summarize speed, accuracy, coverage , cost, or risk and can be useful without behaving like distances . A mathematical metric creates a geometry: it determines which points are near, which sequences converge, and which sets are open. Different metrics on the same objects can produce different numerical distances . Optimizing a performance metric can also worsen the underlying goal when the number is only a proxy, omits important cases, changes incentives, or hides trade-offs between groups.
Scope A performance metric has a formula, units, population, and interpretation; a mathematical metric instead defines distances and must satisfy non-negativity, identity, symmetry, and triangle inequality .
Other names, related terms and sources
Also shown as metrics, performance metric
Source refs sites/microcosm/docs/evidence.html (reading_context) sites/microcosm/docs/components.html (reading_context)
metric · public projection Generated from the governed public vocabulary for Plectis.
metric space General or domain usage A metric space is a set equipped with a distance satisfying the standard rules of separation, symmetry, and the triangle inequality .
A distance is zero exactly between identical points, gives the same answer in either direction, and is no greater than the sum of distances through a third point. The real line with distance | 𝑥 − 𝑦 | | x − y | is an example.
This lets analysis discuss closeness, continuity, convergence , and compactness beyond the ordinary plane. The lemniscate papers compare Euclidean and hyperbolic distances , whose lengths differ even when drawn using the same disc.
Scope The distance is part of the space: the same underlying points can carry different metrics .
Other names, related terms and sources
Also shown as metric spaces
Source refs governed vocabulary term_registry (reading_context)
metric_space · mathematical concept Generated from the governed public vocabulary for Plectis.
Microcosm Compatibility identifier Microcosm is an earlier public name for Plectis that remains in some technical paths and compatibility identifiers .
legacy compatibility name
Existing package names, schemas, files, and links may retain the old spelling to preserve compatibility and traceability. Current reader -facing descriptions use Plectis for the project.
An ordinary phrase such as “a microcosm of a larger system” has a different meaning: a small representative example. The glossary keeps that everyday sense separate from this historical project identifier .
Example A legacy URL , a microcosm-substrate source link, or a .microcosm/ result record may still use Microcosm.
Meaning scope Compatibility identifier. Microcosm is a legacy and compatibility identity in this repository . It is not the current public project name and not a second active product ontology.
Scope The historical name remains in technical identifiers and compatibility routes ; current project descriptions use Plectis.
Not this Do not present Microcosm as the current public brand or as a second active product name beside Plectis.
Reader rule The presence of the old name does not by itself identify a separate project or release .
Other names, related terms and sources
Also shown as microcosm-substrate, .microcosm state
Search handles public microcosm, flagship microcosm, public-safe microcosm
Source refs doctrine module microcosm_substrate (paper_module) standard std_microcosm (standard) README.md (product_root)
microcosm · compatibility identifier Generated from the governed public vocabulary for Plectis.
minimal polynomial General or domain usage The minimal polynomial of an algebraic element over a field is the monic polynomial of least positive degree over that field that vanishes at the element.
Over ℚ Q , √ 2 2 has minimal polynomial 𝑇 2 − 2 T 2 − 2 . Every polynomial over the same field that vanishes at √ 2 2 is divisible by it.
In #243, 𝑧 = 𝛼 + 𝛽 z = α + β generates the cubic field K. Its minimal polynomial over ℚ Q therefore has degree three. The proof writes it as 𝑇 3 + 𝑏 𝑇 2 + 𝑑 𝑇 + 𝑤 T 3 + b T 2 + d T + w and compares its coefficients with those of the polynomial for 𝑧 − 1 z − 1 .
Scope The base field is part of the definition: over ℚ ( √ 2 ) Q ( 2 ) , the same element has minimal polynomial 𝑇 − √ 2 T − 2 . Transcendental elements have no such nonzero polynomial .
Other names, related terms and sources
Also shown as minimal polynomials
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-trace (mathematical_source)
minimal_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
mining System-local specialization Here, “mining” means sustained searching through candidate arguments and experiments for useful mathematical results or failures.
Meaning scope System-local specialization. Outside this project, mining still means extracting minerals or, in cryptocurrency, expending computation to find a rare hash. Here the word is reused for a continuous search over AI reasoning traces, proofs , and drafts. The ordinary senses remain default outside that context.
Scope Local reuse of mining for AI-reasoning search on this site. Not a cryptocurrency, not mineral extraction, not a promise of yield.
Not this A single chat answer that is not checked , stored, or credited is not mining in this sense.
Reader rule The amount of computation does not determine the value of what is found.
Other names, related terms and sources
Also shown as mine
Search handles mined, mines, data mining
mining · public projection Generated from the governed public vocabulary for Plectis.
minor of a matrix General or domain usage A determinant obtained by selecting equally many rows and columns from a matrix .
Select two rows and two columns from a larger matrix ; the determinant of the resulting 2 × 2 2 × 2 square is a minor. Different selections can produce zero or nonzero minors of the same order.
The running-LCM paper constructs nonsingular minors of every order. Each such certificate supplies a finite independent family; having them for arbitrarily large k rules out any fixed finite -dimensional bound .
Meaning scope General or domain usage. Linear algebra. Minor can also mean the selected submatrix before its determinant , depending on convention.
Scope A nonzero 𝑘 × 𝑘 k × k minor proves matrix rank at least k. Depending on convention, 'minor' may name the selected square submatrix or its determinant , so formulas and context should disambiguate.
Other names, related terms and sources
Also shown as matrix minor, square minor
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos-269-three-prime-running-lcm.tex::line 46 (mathematical_source)
minor_of_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
möbius function General or domain usage The Möbius function 𝜇 μ assigns each positive integer a value determined by its prime factorisation : zero for repeated prime factors , otherwise a sign.
The Möbius function has 𝜇 ( 1 ) = 1 μ ( 1 ) = 1 . It is zero when a prime square divides n; otherwise 𝜇 ( 𝑛 ) = ( − 1 ) 𝑘 μ ( n ) = ( − 1 ) k for a product of k distinct primes . Thus 𝜇 ( 6 ) = 1 μ ( 6 ) = 1 , 𝜇 ( 3 0 ) = − 1 μ ( 30 ) = − 1 , and 𝜇 ( 1 2 ) = 0 μ ( 12 ) = 0 .
The totient -series work uses Möbius-square terms to select squarefree indices and translate arithmetic identities into coprimality -probability coordinates. This arithmetic function is unrelated to Möbius transformations from complex geometry.
Other names, related terms and sources
Also shown as Moebius function, mu function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 1340 (mathematical_source)
mobius_function · mathematical concept Generated from the governed public vocabulary for Plectis.
model General or domain usage A model is a representation used to describe, predict, or reason about something.
Here the word often refers to an AI model used by an agent . In mathematics , a model may instead be a structure satisfying a theory's axioms ; in software , a data model specifies how information is organised.
An AI model is only one part of an agent 's working setup. Tools, instructions, available evidence , and permissions also affect what the agent can do and what its answers can establish.
Example An AI model can propose code, while a validator independently checks the resulting artifact .
Scope A model covers the entities, assumptions , inputs, and output interpretation declared for that model.
Not this A model is not the represented system itself and is not automatically an authority on it.
Reader rule The surrounding qualifier identifies the intended meaning.
Other names, related terms and sources
Also shown as AI model, formal model
Search handles data model, models
model · public projection Generated from the governed public vocabulary for Plectis.
module General or domain usage A module is a unit of code or written material organised around a subject or responsibility.
Scope A module covers the material assigned to its named unit and declared responsibility.
Not this Every file is not automatically a coherent module.
Reader rule The module's dependencies determine what else is needed to understand or use it.
Other names, related terms and sources
Also shown as software module
Search handles modules
module · public projection Generated from the governed public vocabulary for Plectis.
modulus General or domain usage Modulus means the integer defining a modular-arithmetic relation, or the magnitude of a complex number .
Modulo 5, integers fall into five classes represented by 0, 1, 2, 3, and 4. Changing the modulus changes these classes and the divisibility information they retain.
Both meanings occur in these papers . A phrase such as “critical-value modulus” refers to a complex magnitude, while “modulo m” refers to arithmetic with integer remainders.
Scope In a complex-number passage, “modulus” instead means magnitude: | 𝑧 | | z | is the distance of z from zero.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::line 706 (mathematical_source)
modulus · mathematical concept Generated from the governed public vocabulary for Plectis.
moment sequence General or domain usage A moment sequence records integrals of successive powers against a measure, whenever those integrals are finite .
The nth moment is 𝜇 𝑛 = ∫ 𝑥 𝑛 𝑑 𝜇 ( 𝑥 ) μ n = ∫ x n d μ ( x ) . For point masses with weights 𝑤 𝑘 w k at nodes 𝑥 𝑘 x k , it becomes ∑ 𝑘 𝑤 𝑘 𝑥 𝑛 𝑘 ∑ k w k x k n . A positive measure need not have total mass one.
The #1049 paper rewrites coefficients as moments on geometric nodes 𝑞 𝑘 q k , with 0 < 𝑞 < 1 0 < q < 1 . Positivity of the weights allows a determinant expansion with nonnegative contributions and supports the subsequent asymptotic estimates.
Scope Specify the measure, nodes, weights, and range of finite moments. These are power moments, not necessarily moments about the mean of a probability distribution .
Other names, related terms and sources
Also shown as moments, geometric moments
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex (mathematical_source)
moment_sequence · mathematical concept Generated from the governed public vocabulary for Plectis.
monic General or domain usage A polynomial is monic if its leading coefficient is 1.
The leading coefficient multiplies its highest-degree nonzero term. For example, 𝑧 3 + 2 𝑧 − 7 z 3 + 2 z − 7 is monic, while 3 𝑧 3 + 2 𝑧 − 7 3 z 3 + 2 z − 7 is not.
In lemniscate questions, multiplying a polynomial by a constant changes sets defined by | 𝑝 ( 𝑧 ) | < 1 | p ( z ) | < 1 or | 𝑝 ( 𝑧 ) | = 1 | p ( z ) | = 1 . A monic hypothesis therefore matters to geometric statements about those sets.
Example 𝑧 2 − 1 z 2 − 1 is monic; 2 𝑧 2 − 2 2 z 2 − 2 has the same roots and is not.
Scope Monic in the leading-coefficient -1 sense, over the complex numbers unless a page says otherwise.
Not this A monic person or a monic inscription is not this term.
Reader rule This normalisation concerns the polynomial 's scale, not the positions of its roots alone.
Other names, related terms and sources
Also shown as monic polynomial
monic · public projection Generated from the governed public vocabulary for Plectis.
monodromy General or domain usage Monodromy describes how a locally defined branch changes when analytically continued around loops; the monodromy theorem gives path independence under suitable simply connected hypotheses.
A square root chosen near 1 returns with the opposite sign after continuation once around 0, showing nontrivial monodromy on the punctured plane. On a simply connected region avoiding 0, a consistent square-root branch can be chosen.
The paper invokes monodromy to turn a local inverse into one branch on a disc after excluding finite branch points and escape. The term names the global compatibility step, not merely the act of extending a function .
Example A square root chosen near 1 returns with the opposite sign after continuation once around 0, showing nontrivial monodromy on the punctured plane.
Meaning scope General or domain usage. Monodromy records the effect of following a loop. The monodromy theorem is a separate result giving conditions for path independence.
Scope Local uniqueness of analytic continuation need not give one branch around every loop. The monodromy theorem gives conditions for path independence; monodromy describes what happens when path independence fails as well.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 513 (mathematical_source)
monodromy · mathematical concept Generated from the governed public vocabulary for Plectis.
monodromy theorem General or domain usage The monodromy theorem says that a holomorphic function defined near one starting point extends to a single-valued function on a simply connected domain if it can be continued along every path there.
A logarithm chosen near 1 can be continued consistently throughout the slit plane ℂ ∖ ( − ∞ , 0 ] C ∖ ( − ∞ , 0 ] , which is simply connected and avoids 0. On the punctured plane ℂ ∖ { 0 } C ∖ { 0 } , going once around 0 changes a continued logarithm by 2 𝜋 𝑖 2 π i , so the conclusion fails because the domain has a hole.
A germ means a function specified near a point, with two such descriptions considered equivalent when they agree on some smaller neighbourhood . Continuations along paths deformable into one another with endpoints fixed give the same final germ, under the continuation hypotheses. In a simply connected domain, paths with the same endpoints are related this way, so the local functions agree and assemble into one holomorphic function . Singularities, escape of inverse branches , or failure of continuation along even one path can prevent the theorem from applying.
Example A local logarithm at 1 becomes a single-valued holomorphic logarithm on the slit plane after continuation along all paths there.
Meaning scope General or domain usage. Classical one-complex-variable analytic continuation . The theorem is a path-independence result under explicit continuation and simple-connectivity hypotheses; monodromy itself is the broader phenomenon it controls.
Scope Monodromy may be nontrivial; the monodromy theorem gives conditions under which analytic continuation is independent of the chosen path.
Not this Continuing a square root once around 0 in the punctured plane can reverse its sign, so no single-valued conclusion follows on that domain.
Reader rule Fix a base point and an initial holomorphic germ. One must know that analytic continuation exists along every path from that base point inside the domain. Simple connectivity then makes continuations along paths with the same endpoint agree. Local invertibility at the starting point alone supplies neither global continuation nor path independence.
Other names, related terms and sources
Also shown as analytic monodromy theorem
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 513 (mathematical_source) sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 2124 (mathematical_source)
monodromy_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
monotone sequence General or domain usage A monotone sequence is either nondecreasing at every step or nonincreasing at every step.
1,2,2,5 is nondecreasing; 5,3,3,0 is nonincreasing. 'Strictly increasing' requires each next term to be larger.
The papers use increasing sequences to list selected exponents in order. Strict increase additionally prevents repetitions. A proof using only monotonicity cannot silently assume this stronger condition.
Meaning scope General or domain usage. Ordered sequences . Some authors use increasing to mean strict, others nonstrict.
Scope State whether equality is allowed and whether the direction is increasing or decreasing.
Other names, related terms and sources
Also shown as monotonic sequence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex::line 1642 (mathematical_source)
monotone_sequence · mathematical concept Generated from the governed public vocabulary for Plectis.
Morse chart General or domain usage A Morse chart is a local coordinate system near a nondegenerate critical point in which a smooth function becomes a quadratic form with plus and minus squares.
Near a saddle on a surface, suitable coordinates make the function look like 𝑐 + 𝑥 2 − 𝑦 2 c + x 2 − y 2 . Its level set at c crosses at the critical point , while nearby levels form branches whose connections change across that value.
The paper uses a Morse chart around an index -one critical point to model the local saddle . The audit then notes that the local quadratic picture alone cannot determine how branches reconnect through a surrounding annulus .
Example Near a saddle on a surface, suitable coordinates make the function look like 𝑐 + 𝑥 2 − 𝑦 2 c + x 2 − y 2 .
Other names, related terms and sources
Also shown as Morse coordinate chart
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 738 (mathematical_source)
morse_chart · mathematical concept Generated from the governed public vocabulary for Plectis.
Morse saddle General or domain usage A Morse saddle is a critical point of a smooth real-valued function whose second-order form is nondegenerate and has both positive and negative directions.
In two dimensions , the local behaviour resembles 𝑥 2 − 𝑦 2 x 2 − y 2 after a suitable change of coordinates: the value rises in some directions and falls in others. Nondegeneracy rules out flat second-order directions.
The lemniscate arguments use this local geometry. It must be distinguished from the behaviour of a singular flow or a degenerate critical point , where additional analysis is required.
Example The origin is a Morse saddle for x squared minus y squared.
Reader rule At a planar saddle , the level set through the point has four local half-branches.
Other names, related terms and sources
Also shown as interior morse saddle
morse_saddle · public projection Generated from the governed public vocabulary for Plectis.
multinomial coefficient General or domain usage A multinomial coefficient counts ways to divide a finite set into labelled groups of prescribed sizes.
For nonnegative integers 𝑘 1 , … , 𝑘 𝑟 k 1 , … , k r with total n, it equals 𝑛 ! / ( 𝑘 1 ! ⋯ 𝑘 𝑟 ! ) n ! / ( k 1 ! ⋯ k r ! ) . For two groups this is the ordinary binomial coefficient .
In #68, writing 𝑛 = 𝑘 𝑑 + 𝑟 n = k d + r identifies 𝑛 ! / ( 𝑑 ! ) 𝑘 n ! / ( d ! ) k as 𝑟 ! r ! times the multinomial coefficient with k groups of size d and one of size r. This directly proves the channel weight is integral, an essential input before small-tail estimates can force an integer contradiction .
Scope The group labels matter, but the order within each group does not. The factorial quotient is an integer because it counts these allocations.
Other names, related terms and sources
Also shown as multinomial coefficients
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::sec:channels (mathematical_source)
multinomial_coefficient · mathematical concept Generated from the governed public vocabulary for Plectis.
multiple General or domain usage In arithmetic, a multiple of an integer d is a number d·k for some integer k.
For example, 12 is a multiple of 3 because 1 2 = 3 ⋅ 4 12 = 3 ⋅ 4 . A common multiple of several positive integers is divisible by every one of them.
In phrases such as “multiple root ”, it has a more specific algebraic role: a root occurs with multiplicity greater than one. The surrounding noun therefore matters when reading this word in a paper .
Example Multiple LLM providers means several providers , while 12 is a multiple of 3 because 1 2 = 3 × 4 12 = 3 × 4 .
Meaning scope General or domain usage. Plectis uses both ordinary senses of multiple: several items, and the mathematical divisibility relation. The surrounding grammar determines which one applies.
Scope This entry disambiguates the ordinary quantity sense from the mathematical integer -multiple relation.
Not this The phrase multiple providers is not a divisibility statement.
Reader rule The adjective “multiple” also means “more than one” in ordinary prose.
Other names, related terms and sources
Also shown as integer multiple
Search handles multiples
multiple · public projection Generated from the governed public vocabulary for Plectis.
multiple root General or domain usage A multiple root of a nonzero polynomial is a root appearing with multiplicity at least two.
For example, 𝑧 2 − 2 𝑧 + 1 = ( 𝑧 − 1 ) 2 z 2 − 2 z + 1 = ( z − 1 ) 2 has 1 as a double root. In general, multiplicity k means ( 𝑧 − 𝑎 ) 𝑘 ( z − a ) k divides the polynomial but the next power does not.
This changes local geometry and root counting. A polynomial 's degree counts roots over the complex numbers with multiplicity, while the number of distinct root locations can be smaller.
Other names, related terms and sources
Also shown as repeated root
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 95 (mathematical_source)
multiple_root · mathematical concept Generated from the governed public vocabulary for Plectis.
multiplicative function General or domain usage An arithmetic function f is multiplicative if 𝑓 ( 1 ) = 1 f ( 1 ) = 1 and 𝑓 ( 𝑚 𝑛 ) = 𝑓 ( 𝑚 ) 𝑓 ( 𝑛 ) f ( m n ) = f ( m ) f ( n ) whenever m and n are coprime .
Other names, related terms and sources
Also shown as multiplicative arithmetic function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 2000 (mathematical_source)
multiplicative_function · mathematical concept Generated from the governed public vocabulary for Plectis.
multiplicative order General or domain usage For b coprime to a positive modulus Q, the multiplicative order is the least positive k for which 𝑏 𝑘 ≡ 1 b k ≡ 1 modulo Q.
Scope Multiplicative order covers one specified base and modulus satisfying the needed coprimality condition.
Not this Any exponent producing remainder one is a period, but it need not be the multiplicative order unless it is minimal.
Reader rule Finding an exponent with remainder 1 gives a period, which need not be the least one.
Other names, related terms and sources
Also shown as modular order, order modulo
multiplicative_order · public projection Generated from the governed public vocabulary for Plectis.
mutable General or domain usage Mutable describes a value, object, or record that can change after it is created.
Mutation can be useful for updating live state, but readers need to know who may change it and how past versions or concurrent readers are handled.
Mutable state can change in place, so two observations at different times may disagree without either observation being fabricated. Programs manage this through ownership, locks, transactions , versioning, or immutable snapshots . Plectis rejects claims that treat a generated mutable projection as source authority . Mutability is not itself a defect; it becomes a problem when a consumer assumes stability that the producer does not promise.
Example A dashboard count updates as new events arrive and is therefore mutable.
Meaning scope General or domain usage. The property that an existing value or object can change after creation, distinct from creating a new version and retaining the old one.
Scope Do not use a mutable projection as permanent evidence unless the relevant version or source identity is fixed.
Not this Creating a new immutable version while preserving the old one does not mutate the old version.
Other names, related terms and sources
Also shown as mutability, changeable state
Source refs sites/microcosm/docs/paper-module-batch9-macro-engines-capsule.html (reading_context)
mutability · public projection Generated from the governed public vocabulary for Plectis.
N
named basis System-local specialization A named basis identifies the exact inputs, assumptions , or sources on which a claim rests.
Plectis uses the phrase to make a result reproducible and inspectable: the supporting material should be specified precisely enough for another checker or reader to examine it.
A path without a version may not identify the bytes used in an earlier run. Source revisions, content digests , and explicit hypotheses help preserve the intended basis as files and explanations change.
Example AX-1 requires a claim to carry a named basis, a derivation certificate , and a checker that accepts it. See it live: The operating loop open the claim questions that include named basis
Reader rule This is a statement of support , distinct from a vector-space basis in linear algebra.
Other names, related terms and sources
Also shown as claim basis
named_basis · public projection Generated from the governed public vocabulary for Plectis.
namespace General or domain usage A namespace is a scope within which names identify objects without colliding with the same names used elsewhere.
Two components can use the same local name without collision when each name belongs to a different namespace. Namespaces appear in programming languages, XML, package systems, and route registries .
Namespaces organise names rather than copying the objects those names identify. A qualified name usually combines a namespace with a local identifier . Plectis uses route and registry namespaces so stable IDs can be resolved by the correct owner. Changing a namespace or dropping its qualifier can break references even when the local text remains unchanged.
Example docs:quickstart and component:quickstart can remain distinct qualified identifiers .
Meaning scope General or domain usage. A naming scope that distinguishes otherwise identical names; a folder counts only when the naming system uses it that way.
Scope Interpret an identifier together with its namespace; the same text in another namespace may denote something else.
Not this A folder is not automatically a namespace unless a naming system uses it to scope identifiers .
Other names, related terms and sources
Also shown as namespaces, name scope
Source refs sites/microcosm/SOURCE_CONTRACT.md (reading_context)
namespace · public projection Generated from the governed public vocabulary for Plectis.
natural number General or domain usage A natural number is a counting number; in Lean , the natural numbers include zero: 0, 1, 2, 3, … .
Mathematical authors differ on whether their notation ℕ N starts at zero or one. Lean 's type Nat starts at zero, and positivity must be stated separately when needed.
This matters for factorials , denominators , and sequence indices . A theorem valid for positive n may need a separate hypothesis or a separate zero case when encoded over Nat.
Example In Lean , 0, 1, and 2 are natural numbers.
Scope Natural number covers the number type and zero convention declared by the source .
Not this − 1 − 1 and 1 / 2 1 / 2 are not natural numbers.
Reader rule Check the convention in a paper rather than inferring it from the phrase alone.
Other names, related terms and sources
Also shown as counting number
Search handles natural numbers, nonnegative integer
natural_number · mathematical concept Generated from the governed public vocabulary for Plectis.
navigable System-local specialization Material is navigable when a reader has usable routes from its summary to the relevant detail or next action.
has a route
In Plectis, these routes can be links, anchors, source references , or commands. They help a person or agent move from a term or result to the object being described.
The presence of a link alone does not ensure good navigation . Its label, destination, access requirements, and level of detail should fit the reader 's question.
Example The architecture map is a navigable surface: each area and component on it links through to the source files , standards , and checks it represents, so you can move from the overview down to the exact material behind any box. See it live: How it fits together (architecture map) follow a map whose every part routes to its source
Meaning scope System-local specialization. Navigable means a cold reader can discover, select, open, and verify an artifact through supported routes; it is stronger than merely being searchable or linked somewhere.
Scope The property applies to glossary rows, components , records , and pages throughout the site, and is most visible on the architecture map , where each part connects through to the source material it stands for.
Not this Navigable does not mean important, prominent, or well written. A heading can look significant and still be non-navigable if it offers no anchor, owner, or source reference to follow.
Reader rule A route must resolve to the intended material to be useful.
Other names, related terms and sources
Also shown as routable, discoverable
Search handles routeable, navigability
Source refs doctrine module navigation_hologram_theory (paper_module) sites/microcosm/content-graph.json (generated_public_graph)
navigable · navigation Generated from the governed public vocabulary for Plectis.
navigation System-local specialization Navigation is the process of finding and moving between relevant parts of a body of information.
browse choices before source
Plectis provides collections, summaries, search, links, and command routes to help a reader reach the source needed for a task. Different levels of detail let the reader narrow the question before opening large files.
A good route reduces unnecessary reading while keeping evidence accessible. It cannot replace the underlying material when the task requires checking a claim or changing an implementation .
Example The architecture and navigation area page is one instance: it lays out how the parts of the system fit together and links onward into the specific components and records beneath each part. See it live: Area: architecture & navigation see the navigation surface that maps the parts and links down to records
Meaning scope System-local specialization. Navigation means route selection across governed repository surfaces. It does not redefine physical navigation, web navigation generally, or graph search as a discipline.
Scope Navigation covers the orientation surfaces of the site: the architecture and area pages, contents listings, and the staged drilldowns from map to group to row to source . A reader meets it whenever they move between an overview and a specific component , paper module , or piece of evidence .
Not this Navigation is not a search box or a website menu bar bolted on for convenience. It is the staged map from overview to source that the system builds over its own files, and a row in it is a pointer to a record , not the record itself.
Reader rule Navigation should preserve the identity and meaning of the selected object across views.
Other names, related terms and sources
Also shown as navigate, nav, browse
Search handles choice surface, option surface
Source refs doctrine module navigation_hologram_theory (paper_module) doctrine skill navigation_seed (skill)
navigation · navigation Generated from the governed public vocabulary for Plectis.
necessary and sufficient General or domain usage A condition is necessary and sufficient for a statement when each implies the other.
Necessary means the statement cannot hold without the condition. Sufficient means the condition guarantees the statement. Together they give an equivalence , often written “if and only if ” or ↔ ↔ .
For example, divisibility by 4 is sufficient for an integer to be even but is not necessary: 6 is even. Distinguishing the directions prevents a stronger research target from being mistaken for the original problem.
Example Lean acceptance is treated here as necessary for a formal claim and not sufficient for digestion .
Scope Ordinary logical usage. Local examples include formal verification , not a redefinition of the logic.
Not this Calling a result sufficient because it feels convincing does not make the condition sufficient.
Reader rule A condition can have one of these roles without having the other.
Other names, related terms and sources
Also shown as necessary but not sufficient
Search handles necessary but not
necessary_and_sufficient · public projection Generated from the governed public vocabulary for Plectis.
negative case System-local specialization A negative case is a test input designed to exercise a failure or refusal that the system should detect.
It accompanies valid inputs so a checker cannot appear successful simply by accepting everything. Plectis may plant a forged result, missing action, or invalid condition and verify that the appropriate finding is produced.
Rejecting one planted error supports that detection path. It does not establish that every possible error will be detected, and valid inputs are also needed to check for inappropriate refusals.
Example A gate that must reject an overclaiming release note ships the overclaiming text as a negative case; a build in which that text passes is a failing build.
Meaning scope System-local specialization. A negative case is a deliberately invalid fixture that the check is expected to reject; it is not any failed run, undesirable outcome, or negative opinion.
Scope Negative cases bound what a check can catch. A check refuses the negatives it ships; it makes no claim about failures nobody wrote down.
Reader rule The expected response must be stated for the particular case.
Other names, related terms and sources
Also shown as expected negative
Search handles expected negatives
Source refs core/preflight_support/fixture_negative_case_matrix_v1.json (source_authority) src/microcosm_core/validators/acceptance.py (source_authority)
negative_case · public projection Generated from the governed public vocabulary for Plectis.
neighbourhood General or domain usage A set containing an open set around a specified point or subset .
For a point x in the plane, any set containing a small open disc centred at x is a neighbourhood of x. Its size may depend on x.
The paper needs neighbourhoods where analytic expansions converge and saddle geometry has a controlled local form before connecting it to global paths.
Scope Authors sometimes say neighbourhood for the open disc itself and sometimes for any set containing one; the common content is local room around the target.
Other names, related terms and sources
Also shown as neighborhood, open neighbourhood, open neighborhood
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 591 (mathematical_source)
neighbourhood · mathematical concept Generated from the governed public vocabulary for Plectis.
Newton flow General or domain usage For a complex polynomial p, the Newton flow studied here follows the differential equation 𝑧 ′ = − 𝑝 ( 𝑧 ) / 𝑝 ′ ( 𝑧 ) z ′ = − p ( z ) / p ′ ( z ) where 𝑝 ′ ( 𝑧 ) ≠ 0 p ′ ( z ) ≠ 0 .
It is a continuous analogue of Newton's root-finding iteration. Along a regular trajectory, the chain rule gives 𝑑 ( 𝑝 ( 𝑧 ( 𝑡 ) ) ) / 𝑑 𝑡 = − 𝑝 ( 𝑧 ( 𝑡 ) ) d ( p ( z ( t ) ) ) / d t = − p ( z ( t ) ) , so the polynomial value decays exponentially.
This limitation matters in the lemniscate arguments: local trajectories and their behaviour near critical points require separate justification. The decay identity applies only along intervals where the trajectory is defined and p′ does not vanish.
Example If a regular Newton-flow trajectory is defined for times from 0 to t and p′ does not vanish there, then 𝑝 ( 𝑧 ( 𝑡 ) ) = 𝑝 ( 𝑧 ( 0 ) ) 𝑒 − 𝑡 p ( z ( t ) ) = p ( z ( 0 ) ) e − t .
Reader rule The displayed vector field is undefined at critical points where p′ vanishes.
Other names, related terms and sources
Also shown as Newton field
newton_flow · public projection Generated from the governed public vocabulary for Plectis.
Newton identities General or domain usage Newton identities relate the sums of powers of a polynomial ’s roots to its coefficients , through the elementary symmetric sums.
If a monic polynomial begins 𝑇 𝑑 + 𝑐 1 𝑇 𝑑 − 1 + 𝑐 2 𝑇 𝑑 − 2 T d + c 1 T d − 1 + c 2 T d − 2 , and 𝑠 𝑗 s j is the sum of jth powers of its roots, then 𝑠 1 + 𝑐 1 = 0 s 1 + c 1 = 0 and 𝑠 2 + 𝑐 1 𝑠 1 + 2 𝑐 2 = 0 s 2 + c 1 s 1 + 2 c 2 = 0 .
In #243, the first three identities compute traces of z and 𝑧 − 1 z − 1 from their cubic minimal polynomials . Substituting 2 𝛼 = 𝑧 + 𝑧 − 1 2 α = z + z − 1 connects those coefficient equations to the known traces of 𝛼 α . These identities are distinct from Newton interpolation , which reconstructs a polynomial from values or differences.
Scope The identities themselves hold over commutative rings . Solving them by division requires the relevant integers to be invertible; characteristic-zero fields permit this.
Other names, related terms and sources
Also shown as Newton's identities, Newton’s identities
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-trace (mathematical_source)
newton_identities · mathematical concept Generated from the governed public vocabulary for Plectis.
Newton vector field General or domain usage The Newton vector field assigns the velocity − 𝑝 ( 𝑧 ) / 𝑝 ′ ( 𝑧 ) − p ( z ) / p ′ ( z ) to points where the polynomial derivative p′ is nonzero.
A vector field prescribes a direction and speed at each allowed point. Its integral curves solve the Newton-flow equation ; the field and the resulting trajectories are related but distinct objects.
Along a regular trajectory, the polynomial value satisfies 𝑤 ′ = − 𝑤 w ′ = − w . This explains its exponential decay, while the existence, endpoints , and length of a global trajectory require additional arguments in the lemniscate papers .
Scope The quotient is undefined where p′ vanishes, even if a special case allows a separately defined extension.
Other names, related terms and sources
Also shown as complex Newton field
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 254 (mathematical_source)
newton_vector_field · mathematical concept Generated from the governed public vocabulary for Plectis.
nonsingular matrix General or domain usage A square matrix over a field is nonsingular when it has an inverse, equivalently when its determinant is nonzero.
The identity matrix is nonsingular. A square matrix with two equal columns is singular because different input vectors can collapse to the same output. Over the chosen field, nonsingularity means a two-sided inverse exists.
Nonsingular minors of every order certify arbitrarily large independent arithmetic families in the running-LCM paper . The term concerns algebraic invertibility; it is different from a singularity where a function blows up or ceases to be analytic.
Meaning scope General or domain usage. Linear algebra. Here singularity is algebraic, not a blow-up of a function .
Scope For a square matrix over a field, the following are equivalent: nonzero determinant , full rank, independent columns, independent rows, and invertibility. The field matters because a determinant may be nonzero in one characteristic and zero in another.
Other names, related terms and sources
Also shown as invertible matrix, non-singular matrix
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos-269-three-prime-running-lcm.tex::line 46 (mathematical_source)
nonsingular_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
norm General or domain usage A norm measures a vector’s size, is zero only at zero, scales with absolute scalar size, and satisfies the triangle inequality .
For the vector ( 3 , 4 ) ( 3 , 4 ) , the Euclidean norm is 5 while the supremum norm is 4, the largest absolute coordinate. Functions and matrices can also be vectors in a vector space and have norms that measure different aspects of their size.
A norm satisfies | | 𝑎 𝑥 | | = | 𝑎 | ⋅ | | 𝑥 | | | | a x | | = | a | ⋅ | | x | | and | | 𝑥 + 𝑦 | | ≤ | | 𝑥 | | + | | 𝑦 | | | | x + y | | ≤ | | x | | + | | y | | , with | | 𝑥 | | = 0 | | x | | = 0 exactly when 𝑥 = 0 x = 0 . It gives the distance | | 𝑥 − 𝑦 | | | | x − y | | . In a fixed finite -dimensional real or complex vector space , all norms give the same convergent sequences , although numerical bounds differ. That equivalence can fail in infinite -dimensional spaces. A field norm in algebraic number theory is a different construction and need not be nonnegative.
Example The Euclidean norm of ( 3 , 4 ) ( 3 , 4 ) is 5, while its supremum norm is 4.
Meaning scope General or domain usage. For a complex number , norm often means its absolute value ; in algebraic number theory norm can instead mean a field norm, a different construction.
Scope The norm must be specified. Some names coincide in a setting: the Frobenius and Hilbert–Schmidt norms agree for finite matrices .
Not this The squared Euclidean length is not itself a norm because scaling by a doubles the exponent , producing | 𝑎 | | a | squared.
Other names, related terms and sources
Also shown as vector norm, function norm, matrix norm
norm · mathematical concept Generated from the governed public vocabulary for Plectis.
normal extension General or domain usage An algebraic extension 𝐿 / 𝐾 L / K is normal when every irreducible polynomial over K having one root in L splits completely into linear factors over L.
𝑄 ( √ 2 ) / 𝑄 Q ( 2 ) / Q is normal because the conjugate roots ± √ 2 ± 2 both lie in the field. 𝑄 ( 3 √ 2 ) / 𝑄 Q ( 2 3 ) / Q is not normal because its two nonreal conjugate roots are missing.
Normality ensures that every embedding of L into an algebraic closure which fixes K carries L back onto itself. Equivalently, once an irreducible polynomial over K has a root in L, all of its roots lie there. Combined with separability, normality makes an algebraic extension Galois; in the finite case the number of K-fixing automorphisms equals the extension degree.
Example 𝑄 ( √ 2 ) / 𝑄 Q ( 2 ) / Q is normal because the conjugate roots ± √ 2 ± 2 both lie in the field.
Meaning scope General or domain usage. Normality is relative to the base field. A normal extension need not have all its intermediate fields normal over that base.
Scope Normality is relative to K and requires an algebraic extension. It says that L contains every K-conjugate of each of its elements, not that every subfield or intermediate extension is automatically normal.
Other names, related terms and sources
Also shown as normal field extension
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 280 (prerequisite_dependency)
normal_extension · mathematical concept Generated from the governed public vocabulary for Plectis.
normal form General or domain usage A normal form is a specified standard representation of an object, expression, statement, or record .
Scope Covers mathematical, logical, and data representations under their stated transformation rules.
Reader rule The transformation must preserve the properties it claims to preserve, and uniqueness needs its own justification.
Other names, related terms and sources
Also shown as normal forms
normal_form · public projection Generated from the governed public vocabulary for Plectis.
normal number General or domain usage A real number is normal in an integer base 𝑏 ≥ 2 b ≥ 2 when every finite digit block appears in its base-b expansion with its expected limiting frequency.
A length-k block must have frequency 𝑏 − 𝑘 b − k . Equal frequencies of individual digits alone establish only simple normality, not the full condition for every block length.
The #251 reasoning surface reports conditional normality for a prime -based series under explicit prime -pattern hypotheses. Changing b changes the value of that series as well as its expansion. The cited conditional result should not be read as unconditional normality of the dyadic number or absolute normality of one fixed number.
Other names, related terms and sources
Also shown as normality in a base, base-b normality
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::line 475 (mathematical_source)
normal_number · mathematical concept Generated from the governed public vocabulary for Plectis.
normalised vanishing General or domain usage Normalised vanishing means that a quantity tends to zero after division by a specified nonzero scale.
For example, n divided by 𝑛 2 n 2 tends to zero although n itself grows. The property describes relative size, often written 𝑎 𝑛 / 𝑏 𝑛 → 0 a n / b n → 0 , with the denominator 's allowed values and sign specified.
In the reciprocal -tail work, a centred error is compared with an arithmetic scale. This relative smallness can combine with discrete constraints or lower bounds , but it does not alone imply that the unscaled error eventually equals zero.
Scope Changing the normalising scale changes the statement.
Other names, related terms and sources
Also shown as normalized vanishing, vanishing after scaling
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::line 96 (mathematical_source)
normalized_vanishing · mathematical concept Generated from the governed public vocabulary for Plectis.
nowhere dense General or domain usage A set is nowhere dense if its closure has empty interior.
On the real line, this means that even after adding all limit points, the set contains no nonempty open interval. Every open interval therefore contains a smaller open interval avoiding the closure.
The papers distinguish this topological property from measure. A nowhere-dense set can have positive Lebesgue measure , so the word does not simply mean “small in length”.
Example The Cantor set is nowhere dense.
Reader rule Having empty interior alone is weaker: the rational numbers contain no interval, but their closure is the whole real line.
Other names, related terms and sources
Also shown as nowhere-dense
nowhere_dense · public projection Generated from the governed public vocabulary for Plectis.
number field General or domain usage A number field is a field containing the rational numbers with finite dimension as a vector space over them.
The dimension [ 𝐾 : ℚ ] [ K : Q ] is its degree. For example, ℚ ( √ 2 ) Q ( 2 ) has basis 1,√ 2 2 and degree two. Its elements can be added, multiplied, and divided by any nonzero element.
In #243, irreducibility of the cubic 𝑓 ( 𝑇 ) = 𝑇 3 − 𝑇 + 𝜂 f ( T ) = T 3 − T + η makes 𝐾 = ℚ ( 𝛼 ) K = Q ( α ) a number field of degree three. The proof studies a possible square root inside K and computes traces back to ℚ Q ; the degree controls both calculations.
Scope A number field need not be contained in the real numbers . Its degree concerns dimension over ℚ Q , rather than the number of its elements.
Other names, related terms and sources
Also shown as number fields
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-field (mathematical_source)
number_field · mathematical concept Generated from the governed public vocabulary for Plectis.
number theory General or domain usage Number theory studies integers and their arithmetic relationships, including primes , divisibility , and congruences .
Scope Number theory covers the integer and arithmetic questions in the published problem statements and proofs .
Not this Ordinary data counting is not automatically a number-theory problem.
Reader rule The precise assumptions determine which arithmetic setting a theorem concerns.
Other names, related terms and sources
Also shown as elementary number theory
number_theory · subject Generated from the governed public vocabulary for Plectis.
numerator General or domain usage The numerator is the quantity being divided in a fraction : the a in 𝑎 / 𝑏 a / b .
For example, 3 is the numerator of 3 / 4 3 / 4 . For rational numbers written as integer fractions , cancelling a factor common to numerator and denominator can give a simpler expression for the same value.
Thus 1 / 2 1 / 2 and 2 / 4 2 / 4 have different written numerators but represent the same number. Arithmetic arguments often use the reduced numerator, with the fraction in lowest terms and a positive denominator .
Example For 𝑆 𝐹 ( 𝑏 ) = 𝑃 / 𝑄 S F ( b ) = P / Q in lowest terms, P is the numerator and Q is the denominator checked by the certificate .
Reader rule The numerator depends on the representation unless a normalisation is specified.
Other names, related terms and sources
Also shown as top of a fraction
Search handles numerators
numerator · mathematical concept Generated from the governed public vocabulary for Plectis.
O
OBS Studio Externally anchored OBS Studio is a free, open-source application for video recording and live streaming.
It can combine sources such as a screen, camera, and microphone into a recorded scene. The project uses recording tools to present demonstrations and explanations of work that readers can inspect elsewhere.
Source links and runnable instructions complement a demonstration by letting viewers inspect the implementation and repeat the relevant steps in their own environment .
Example The five-minute walk-through was recorded on the Demo Take Console rather than on OBS.
Scope OBS Studio is external open-source software and is not part of this work.
Reader rule A video shows the captured session rather than every possible behaviour of the system.
Other names, related terms and sources
Also shown as OBS
obs_studio · public projection Generated from the governed public vocabulary for Plectis.
observability General or domain usage Observability is either unique state reconstruction from outputs in control theory or the practical ability to investigate a running system from recorded signals.
In control theory, a system is observable when its internal state can be uniquely recovered from known inputs and outputs over time. In operations, logs, metrics , traces, and status records provide evidence for investigating behaviour and causes.
For a dynamical system, observability asks whether two different internal states can produce the same measured outputs under the known inputs. If not, the observations determine the initial state over an appropriate interval. Software operations use the same word more broadly for the signals available to inspect a running service: logs describe events, metrics summarize quantities, and traces connect work across components . Rich telemetry can improve operational diagnosis without satisfying the control-theory definition. Neither sense guarantees correctness or active monitoring; it describes what state can be inferred from the evidence that the system exposes.
Scope Control-theoretic observability is a mathematical identifiability property; operational observability depends on whether exposed evidence is sufficient for the questions and incidents being investigated.
Other names, related terms and sources
Also shown as observable state, observability signal
Source refs sites/microcosm/docs/doctrine.html (reading_context) sites/microcosm/docs/architecture.html (reading_context)
observability · public projection Generated from the governed public vocabulary for Plectis.
observe System-local specialization In Plectis, observe is the step that gathers and records information without changing the material being examined.
gather evidence before deciding
It can read files, run a read-only probe, or inspect a response and turn the findings into a structured record . That record supplies evidence for a later decision or proposed change.
The observation should state its source , scope , and time or version where relevant. Those details determine whether a later action can still rely on it.
Example The Tactic Portfolio Availability Probe is one concrete observe: it inspects which proof tactics are available for a target and reports what it found, without itself attempting the proof . See it live: Tactic Portfolio Availability Probe see what an observe pass actually records and proves
Meaning scope System-local specialization. Observe names the repository 's evidence -gathering lane when used as a noun; it does not redefine the ordinary verb or imply neutral measurement without a stated method.
Scope Observe is a runtime activity in the system's observe/apply cycle. A reader meets it wherever the pages describe how a pass gathers evidence , runs probes, or proves a point before any application step, including the evidence and architecture surfaces.
Not this An observe is not the change itself and not a finished decision. It collects and records evidence ; the separate apply step is where anything is altered.
Reader rule Observation and application have different responsibilities: collecting evidence does not itself authorise a write.
Other names, related terms and sources
Also shown as observe pass, observe plan, evidence pass
Search handles probe
Related terms precedes apply Observe normally precedes mutation. may_delegate_to bridge Observe can dispatch bridge groups.
Source refs doctrine skill observe (skill) standard std_observe_plan (standard)
observe · runtime Generated from the governed public vocabulary for Plectis.
omission receipt System-coined term An omission receipt records what a shortened view leaves out and how to recover the fuller material.
named missing context
Plectis uses it when a summary or packet intentionally excludes detail to fit a reading or context budget. The record explains the omission's reason and provides a route to the source .
For example, a short result card can omit a lengthy proof while preserving the theorem 's assumptions . The reader should be able to open that proof when its details become relevant.
Example The doctrine card "Preserve provenance across every boundary" is a concrete instance: it holds the rule that a compressed surface must always keep a path back to the source it summarises, which is exactly what an omission receipt records on an individual row. See it live: Preserve provenance across every boundary open the doctrine rule that an omission receipt enforces on each row
Meaning scope System-coined term. An omission receipt records what detail was deliberately excluded, why, and where to recover it; it is not an excuse for forgotten work or evidence that omitted material is irrelevant.
Scope The term covers row-level truth boundaries throughout the system's compressed navigation , browse listings, and summary cards. A reader meets it wherever a short row stands in for fuller source material and carries a pointer back to that material.
Not this An omission receipt is not an error message, a disclaimer, or an admission that something is broken. It is a deliberate, structured record of what a compressed row leaves out and how to recover it.
Reader rule Omitting detail must not silently change the meaning of the retained claim .
Other names, related terms and sources
Also shown as omission_receipt, omission boundary
Search handles omitted context receipt, named missing context, row omission receipt
Source refs runtime module standard_option_surface (code) standard std_navigation_contract (standard) doctrine skill profile_governed_compression (skill)
omission_receipt · navigation Generated from the governed public vocabulary for Plectis.
open cover General or domain usage An open cover of a set is a collection of open sets whose union contains that set.
The covering sets can overlap, and some can extend beyond the set being covered. For example, the intervals ( − 1 , 0 . 6 ) ( − 1 , 0.6 ) and ( 0 . 4 , 2 ) ( 0.4 , 2 ) together cover [ 0 , 1 ] [ 0 , 1 ] . A subcover selects some of the original covering sets while still covering every point.
The universal word “every” matters: finding one finite cover does not establish compactness . Covers let the papers turn statements valid near individual points into statements covering an entire region when the required hypotheses hold.
Other names, related terms and sources
Also shown as open covering
Source refs governed vocabulary term_registry (reading_context)
open_cover · mathematical concept Generated from the governed public vocabulary for Plectis.
open obligation System-local specialization An open obligation is a precise requirement that remains to be established in an argument or workflow.
In the mathematical records , it is often a lemma or hypothesis needed by a conditional result . Naming it makes the remaining work available for scrutiny and further attempts.
The record should state its logical role: equivalent target, sufficient condition, or supporting task. Proving a conditional theorem does not automatically discharge the obligation it assumes.
Example For #251, one open obligation is that the actual prime -gap tails are non-integral at infinitely many of the stated positions.
Meaning scope System-local specialization. An obligation is a precise statement still to be proved. Listing one is not an estimate of its difficulty or a promise that it is true.
Scope Covers the remaining-work statements on problem pages and in the problem notes .
Not this 'Prove the conjecture ' is a goal, not an open obligation, because it names no intermediate statement.
Reader rule An obligation needed by one approach may be stronger than, or unrelated to solving, the original problem directly.
Other names, related terms and sources
Also shown as open obligations, obligation
Search handles obligations, remaining obligation, surviving obligation
open_obligation · public projection Generated from the governed public vocabulary for Plectis.
open problem General or domain usage An open problem is a mathematical question for which no accepted resolution is known in the relevant literature.
Its statement specifies what would count as a solution or refutation. Related theorems , special cases, and computations can clarify the problem while leaving the full question unresolved.
The project distinguishes its own unfinished work from the wider field's open questions. A result missing from this repository may already be known elsewhere, and a newly published claim may still require review.
Example Every Erdős problem represented in the paper corpus is recorded as open.
Scope Open problem covers the exact question and formulation named by the cited problem source .
Not this A theorem proving one finite case or a stronger conditional statement does not automatically close the original problem.
Reader rule Open status is a fact about current knowledge and should be checked against up-to-date sources .
Other names, related terms and sources
Also shown as unsolved problem, unresolved question, remain open
Search handles remains open
open_problem · public projection Generated from the governed public vocabulary for Plectis.
open set General or domain usage A set containing a small neighbourhood around each of its points.
The open unit disc { 𝑧 : | 𝑧 | < 1 } { z : | z | < 1 } is open: every point inside has some positive-radius disc still contained in it. Boundary points with | 𝑧 | = 1 | z | = 1 are excluded.
Strict inequalities such as | 𝑓 ( 𝑧 ) | < 1 | f ( z ) | < 1 define open regions in which the paper seeks paths between polynomial roots .
Scope Openness is relative to the surrounding space. In a metric space , each point must have a whole ball of some radius lying in the set.
Other names, related terms and sources
Also shown as open subset, open region
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 63 (mathematical_source)
open_set · mathematical concept Generated from the governed public vocabulary for Plectis.
open-world System-coined term An open-world approach treats missing information as unknown rather than automatically false.
If a record does not contain a proof or observation, the system cannot conclude that none exists. Plectis uses this distinction when reasoning over incomplete evidence and public or private collections.
For a declared finite collection that has been fully checked , absence can settle a bounded question. Outside that boundary, “not found here” and “does not exist” remain different claims .
Example AX-6 says failing to prove something does not establish its negation. See it live: Doctrine AX-6 the open-world rule
Meaning scope System-coined term. Open-world here is the doctrine rule that absence of proof is unknown, not false, unless the domain was declared finite and fully covered.
Scope Doctrine AX-6 copy.
Not this Open-world is not a licence to treat every conjecture as possible forever after a complete finite check .
Reader rule A negative conclusion requires an appropriate completeness argument or a separate source of evidence .
Other names, related terms and sources
Also shown as open-world epistemics
open_world · public projection Generated from the governed public vocabulary for Plectis.
operator proxy System-coined term An operator proxy carries out a bounded task on the operator's behalf using supplied instructions and context.
bounded operator-intent proxy
Plectis uses the term for an outside worker receiving a prepared packet . That worker can produce an answer or artifact within the assigned task, while the receiving side checks the result and decides how to incorporate it.
The packet should state the purpose, limits , and expected output. Any access to tools or live material remains a separate part of the worker's permissions .
Example A concrete instance is a chat model that receives a packet defining one message-writing mission, drafts the message inside those limits , and returns it for the owning side to check and admit, never acting beyond that brief. See it live: With a coding agent see a worker run a prepared task on the operator's behalf
Meaning scope System-coined term. An operator proxy performs one bounded task from prepared intent and context; it does not impersonate the operator or acquire the operator’s wider authority .
Scope The term covers the bounded delegation role used when the system routes a task to an external worker such as a chat model or coding agent . A reader encounters it on the pages describing how the system works with coding agents and runs prepared missions.
Not this An operator proxy is not the operator and not an autonomous agent that sets its own goals or changes the system's rules. It is a worker running one prepared task within fixed limits , whose results take effect only once the owning side admits them.
Reader rule Acting on someone's behalf does not confer all of that person's authority .
Other names, related terms and sources
Also shown as operator_proxy, subconscious bridge, message mission proxy
Search handles bridge proxies the operator, bridge operator proxy, operator-proxy bridge
Source refs doctrine module bridge_operator_proxy (paper_module) doctrine module bridge_operating_system (paper_module)
operator_proxy · runtime role Generated from the governed public vocabulary for Plectis.
operator voice System-local specialization Operator voice is the preserved record of what the human operator actually said or wrote.
direct operator expression
Plectis keeps it distinct from an agent 's paraphrase, inference, or interpretation. That distinction makes it possible to revisit the original intent when a later summary is unclear or disputed.
Agent -authored analysis belongs in its own attributed record . Keeping both layers allows the system to learn from interpretation while retaining evidence of which claims and expressions came from the person.
Example The Voice To Doctrine Self Improvement Loop is a concrete instance: a component that takes the operator's recorded voice and distils it into doctrine while preserving the original wording, so you can see the raw human input on one side and the compressed rule on the other. See it live: Voice To Doctrine Self Improvement Loop open the component that turns recorded operator voice into doctrine
Meaning scope System-local specialization. Operator voice is preserved direct human input that outranks later agent synthesis on intent; it is not a writing style, inferred preference, or agent -authored paraphrase.
Scope Operator voice covers the raw seeds , voiced paragraphs, and direct instructions that seed the system. A reader meets it behind the doctrine and component pages, which are projections drawn from it, and most directly in the loop that turns this voice into doctrine .
Not this Operator voice is not the polished doctrine , standards , or agent -written summaries on the site. Those are projections compressed from it. It is also not a Bridge proxy speaking on the operator's behalf: it is only what the operator himself said directly.
Reader rule Preserving the words does not remove the need to interpret context and changes of mind carefully.
Other names, related terms and sources
Also shown as will voice, direct voice
Search handles voice authority
operator_voice · posture Generated from the governed public vocabulary for Plectis.
option surface System-coined term An option surface is a structured view of the items or actions available within a category.
selectable row surface
Meaning scope System-coined term. An option surface enumerates stable selectable rows for one artifact kind before handing off to source authority ; it is not merely a UI page, search result list, or command menu.
Scope The term covers the standard -owned row-and-card browse mechanism used across the system's navigable kinds. A reader meets it wherever the public pages present a list of components , paper modules , or doctrine cards that can be opened one at a time.
Not this An option surface is not a keyword search box and not the source files themselves. It is a fixed catalogue of rows you select from by id, sitting one layer above the authority it links to.
Reader rule The view should distinguish items that exist from actions currently permitted or supported.
Other names, related terms and sources
Also shown as option_surface, standard option surface
Search handles standard-owned option surface, row surface, selectable row surface, row set
Source refs runtime module standard_option_surface (code) standard std_navigation_contract (standard) standard std_kind_atlas (standard) governed vocabulary term_registry (registry)
option_surface · navigation Generated from the governed public vocabulary for Plectis.
orbit General or domain usage An orbit is the path of an object under repeated application of a rule or continuous evolution through time.
For iteration, it starts at x and continues 𝑓 ( 𝑥 ) f ( x ) , 𝑓 ( 𝑓 ( 𝑥 ) ) f ( f ( x ) ) , and so on. For a flow, the parameter is continuous and the orbit follows a trajectory.
An orbit may repeat, approach a limit , or behave otherwise. In modular arithmetic the state space is finite , but further hypotheses determine whether repetition starts immediately or only after an initial segment.
Example Starting at 6 and repeatedly halving even numbers gives the orbit 6, 3.
Scope Discrete-dynamics sense: iterating one map . Not the astronomical sense, and not a group orbit unless the paper says so.
Reader rule The starting point and evolution rule determine which orbit is meant.
Other names, related terms and sources
Also shown as orbits, infinite orbit
orbit · public projection Generated from the governed public vocabulary for Plectis.
orbit closure General or domain usage The orbit together with all points that can be approached arbitrarily closely by points of that orbit .
The closure of a set is the smallest closed set containing it. A periodic orbit is already closed; an irrational circle rotation has the entire circle as its orbit closure even though it visits only countably many points.
In #269, 𝑇 0 T 0 is the closure of the one-parameter logarithmic flow. The crossing interchange is constructed inside 𝑇 0 T 0 , the part the orbit can actually approach. This avoids requiring an unproved independence statement that would identify 𝑇 0 T 0 with the full product torus.
Meaning scope General or domain usage. Topological closure describes accessible limit points; density in that closure is weaker than density in the ambient torus.
Scope An orbit is always dense in its own closure. That statement does not say its closure is the whole surrounding space, and does not give a rate or frequency of visits.
Other names, related terms and sources
Also shown as closure of an orbit
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:sec:flow (mathematical_source)
orbit_closure · mathematical concept Generated from the governed public vocabulary for Plectis.
organ (source identifier) Compatibility identifier Organ is the source -code term for a bounded unit that the public site usually calls a component .
source-level runtime unit
Meaning scope Compatibility identifier. Organ is a retained source /storage compatibility identifier . It is not the preferred public object name, a biological claim , or proof that a storage rename has completed.
Scope The term covers every bounded unit the system is assembled from. A reader meets it in source paths and identifiers such as organ_registry.json , and meets the same units as components throughout the public pages, where each can be opened on its own.
Not this An organ is not a biological metaphor and not a marketing feature. It is a unit of running code with a stated boundary.
Reader rule The biological word is internal terminology; it does not add a separate guarantee or capability.
Other names, related terms and sources
Also shown as source organ, organ id
Search handles runtime organ, organ registry
Source refs core/organ_registry.json (source_registry) core/organ_atlas.json (source_atlas)
organ · compatibility identifier Generated from the governed public vocabulary for Plectis.
orientation General or domain usage Orientation gives a new reader the context needed to understand what they are looking at and where to go next.
It introduces the subject, scope , main objects, and available routes. On this site, overviews and reader packets help visitors choose a paper , component , or evidence record without first reading everything.
A useful introduction answers the reader 's first questions and leaves deeper detail accessible. It should not require learning the project's internal vocabulary before the subject itself makes sense.
Example The concise guide is orientation for an assistant that cannot accept a file upload.
Scope Orientation describes the system. It establishes nothing about it.
Reader rule Orientation should point to evidence while keeping its own summary role clear.
Other names, related terms and sources
Also shown as orientation guide, concise guide
orientation · public projection Generated from the governed public vocabulary for Plectis.
orphan General or domain usage An orphan is an item that exists but lacks the expected connection to its index , parent, or related records .
In Plectis's navigation , this can mean source material that the generated map fails to place. The item may be valid and useful while remaining difficult to discover.
Repair may involve adding the appropriate source relationship or correcting an index builder. Removing the orphaned item is not automatically the right response, because absence from a map does not imply that the source is unwanted.
Example A declaration present in the source corpus but absent from the semantic index is an orphan of that index build.
Scope An orphan count describes the index , not the source .
Reader rule The expected relationship determines whether the missing connection is actually a fault.
Other names, related terms and sources
Also shown as orphans, orphaned
orphan · public projection Generated from the governed public vocabulary for Plectis.
orthogonal polynomials General or domain usage Polynomials of successive degrees whose pairwise inner products vanish with respect to a specified measure or weight.
For real polynomials and a positive measure 𝜇 μ on the real line, a family 𝑝 𝑛 p n of degree n is orthogonal when ∫ 𝑝 𝑛 𝑝 𝑚 𝑑 𝜇 = 0 ∫ p n p m d μ = 0 for 𝑛 ≠ 𝑚 n ≠ m and its squared norms are positive. Orthonormal polynomials have norm one; monic polynomials have leading coefficient one.
The #1049 work compares orthogonal-polynomial Padé constructions and constructs an eight-node quadrature from certified moment matrices . This finite result does not supply an infinite orthogonal family for all coefficient moments ; that would require an all-rank positive representation.
Other names, related terms and sources
Also shown as orthogonal polynomial, orthogonal-polynomial family
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 3002 (mathematical_source)
orthogonal_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
P
p-adic valuation General or domain usage The p-adic valuation of a nonzero integer counts its factors of a specified prime p.
For example, 𝑣 2 ( 1 2 ) = 2 v 2 ( 12 ) = 2 because 1 2 = 2 2 ⋅ 3 12 = 2 2 ⋅ 3 . For nonzero rational 𝑎 / 𝑏 a / b , 𝑣 𝑝 ( 𝑎 / 𝑏 ) = 𝑣 𝑝 ( 𝑎 ) − 𝑣 𝑝 ( 𝑏 ) v p ( a / b ) = v p ( a ) − v p ( b ) , so denominators can give negative values.
In a finite sum , a unique term of smallest valuation prevents cancellation at that prime and fixes the sum ’s valuation. If several terms share the minimum, cancellation can increase it. In #257, valuations define the P-part ℎ ( 𝑎 ) = ∏ 𝑝 ∈ 𝑃 𝑝 𝑣 𝑝 ( 𝑎 ) h ( a ) = ∏ p ∈ P p v p ( a ) used in the support weight.
Scope Valuations add under multiplication and satisfy 𝑣 𝑝 ( 𝑥 + 𝑦 ) ≥ m i n ( 𝑣 𝑝 ( 𝑥 ) , 𝑣 𝑝 ( 𝑦 ) ) v p ( x + y ) ≥ min ( v p ( x ) , v p ( y ) ) . The extended mathematical convention assigns + ∞ + ∞ to zero; finite -valued implementations may use a different zero convention.
Other names, related terms and sources
Also shown as prime-adic valuation, p-valuation, p-adic valuations
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos68-factorial-reasoning-surface.tex::line 123 (mathematical_source) sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
p_adic_valuation · mathematical concept Generated from the governed public vocabulary for Plectis.
P-part General or domain usage The P-part of a positive integer is its largest divisor whose prime factors all belong to the specified prime set P.
If 𝑃 = { 2 , 3 } P = { 2 , 3 } and 𝑎 = 3 6 0 = 2 3 ⋅ 3 2 ⋅ 5 a = 360 = 2 3 ⋅ 3 2 ⋅ 5 , the P-part is 72. The remaining cofactor 5 has no prime factor in P.
The #257 paper weights each exponent a through ℎ ( 𝑎 ) h ( a ) . Large powers of primes in P can make its weight much smaller than 1/a, even when the ordinary reciprocal sum diverges .
Scope The prime set is part of the definition. For positive a, ℎ ( 𝑎 ) = ∏ 𝑝 ∈ 𝑃 𝑝 𝑣 𝑝 ( 𝑎 ) h ( a ) = ∏ p ∈ P p v p ( a ) ; ℎ ( 𝑎 ) = 1 h ( a ) = 1 when no prime in P divides a.
Other names, related terms and sources
Also shown as prime-set part, P-smooth part
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
prime_set_part · mathematical concept Generated from the governed public vocabulary for Plectis.
package General or domain usage A package groups related material so it can be distributed, installed, or used as a unit.
In software , it may contain code and dependency information. A research or release package may instead collect source , documents, checks , and metadata needed for a particular submission or public version.
Packaging makes material easier to transfer, but it does not verify its contents. Its evidence , licences, and dependencies still need to match the intended use.
Example A Lean project pins a Mathlib package revision, while tactic -routing work can produce a separate submission package for review.
Scope Covers installable dependency units, assembled submission units, and explicitly preserved package identifiers ; the surrounding operation determines the sense.
Not this Any compressed directory is not automatically a managed software package.
Reader rule The package's manifest and instructions determine what is included and how to use it.
Other names, related terms and sources
Also shown as software package
Search handles dependency package, packages
package · public projection Generated from the governed public vocabulary for Plectis.
packet General or domain usage A packet is a selected bundle of information prepared for a particular reader or task.
On the public site, a packet is often a downloadable JSON file containing summaries, identities, links, and selected content. An assistant can read it without reconstructing the site through separate page requests.
It remains a generated view and can become stale. Source references let a reader verify the underlying material and recover detail that was not included in the download.
Example The landing page's 'Download the reviewer brief ' button is the small packet.
Scope A downloadable public JSON bundle . Not a proof , not a clone , not a verification run.
Not this Pasting a few quotes from the website into a chat is not a packet.
Reader rule The packet's declared scope determines which parts of the public record it includes.
Other names, related terms and sources
Also shown as JSON packet, AI review packet
Search handles JSON handoff, AI packet, reader packet
packet · public projection Generated from the governed public vocabulary for Plectis.
Padé approximation General or domain usage Approximation by a rational function chosen to match as many initial power-series coefficients as specified degrees allow.
A type-( 𝑚 , 𝑛 ) ( m , n ) approximant 𝑃 / 𝑄 P / Q has numerator degree at most m and denominator degree at most n. With 𝑄 ( 0 ) = 1 Q ( 0 ) = 1 , it satisfies 𝑄 ( 𝑧 ) 𝑓 ( 𝑧 ) − 𝑃 ( 𝑧 ) = 𝑂 ( 𝑧 𝑚 + 𝑛 + 1 ) Q ( z ) f ( z ) − P ( z ) = O ( z m + n + 1 ) at zero, equivalently matching those coefficients formally.
The #1049 comparison discusses little-q-Legendre Padé constructions for integer -base Lambert values. Their remainder and denominator estimates establish the value theorem ; sharing an approximated function does not extend the construction automatically to a noninteger rational base .
Meaning scope General or domain usage. The normalized coefficient -matching definition is used; a formal approximant alone supplies no global error estimate or irrationality conclusion.
Scope The degrees can be defective, and a prescribed normalized approximant need not exist in every case. Coefficient matching is a local or formal condition; convergence of a sequence of approximants and control of special values require separate estimates.
Other names, related terms and sources
Also shown as Pade approximation, Padé approximant, Pade approximant
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 4818 (mathematical_source)
pade_approximation · mathematical concept Generated from the governed public vocabulary for Plectis.
Palomar Externally anchored Palomar is an external registry used to present formally checked mathematical results with identifiable source and checking records .
Meaning scope Externally anchored. Palomar is an external service with its own rules. This site describes how the project uses it; it does not speak for Palomar.
Scope Covers references to Palomar submissions, records and the showcase ranking on this site.
Not this A family listed in the showcase file has not thereby been registered or reviewed by Palomar.
Reader rule Preparation, submission, successful checking, and public registration are distinct states.
Other names, related terms and sources
Also shown as Palomar record, Palomar records
Search handles Palomar submission, Palomar showcase
palomar · public projection Generated from the governed public vocabulary for Plectis.
paper System-local specialization A mathematical paper presents a question, argument, or result in a form intended for readers to study and assess.
It normally states definitions and hypotheses, explains the proof or method, and identifies relevant prior work. This site offers papers as PDFs and web reading views, with source links where available.
A paper may contain formal results, ordinary mathematical arguments, experiments, or unresolved questions . Those roles should remain clear in the text rather than be inferred from the presence of equations or a polished layout.
Example Each of the six covered Erdős problems has its own paper describing what is formalized and what remains open .
Meaning scope System-local specialization. A paper can appear as a rendered PDF write-up or an equivalent web reading view. The format does not confer peer review , and a research paper is distinct from a Plectis subsystem paper module .
Scope A paper covers the project, problem, method, result, and limitations stated in that rendered version. It is a reader -facing PDF write-up, not an ai_workflow paper module and not proof of academic publication.
Not this A paper is not the same as a paper module , which is an internal subsystem map , and it is not proof authority by itself.
Reader rule The file format does not determine the work's evidence or review status.
Other names, related terms and sources
Also shown as research paper, standalone paper
Search handles mathematical paper, PDF paper
Source refs sites/microcosm/papers/papers-source-manifest.json (source_authority) tool plectis_scholarly_corpus (source_authority)
paper · public projection Generated from the governed public vocabulary for Plectis.
paper module System-coined term A paper module is Plectis's maintained explanation of one subsystem or recurring mechanism .
subsystem ontology packet
It connects the subsystem's purpose, structure, rules, source locations, and evidence . The aim is to give a reader enough understanding to act without reconstructing the design from scattered files.
Its explanation should remain linked to the implementation it describes. Source changes can require a refresh, while historical notes may remain useful if their earlier scope and version are explicit.
Example The Verifier Lab Kernel paper module is one such packet : it explains the subsystem that runs proof and verification checks , summarising what that area does, where its code sits, and what state it is in. See it live: Verifier Lab Kernel open one subsystem packet in full
Meaning scope System-coined term. Paper module is ai_workflow's internal subsystem-orientation packet . It is not a scholarly paper , manuscript, publication, peer-review object, or proof merely because 'paper ' appears in its name.
Scope Paper modules cover the named subsystems of the system, one packet each, and a reader meets them on the paper modules pages where each area is laid out as its own entry .
Not this A paper module is not the source code of a subsystem and not the authority over how it behaves. It is a structured description of one area that points to the source , and it can fall out of date until it is refreshed.
Reader rule A paper module is system documentation and need not be a scholarly research paper .
Other names, related terms and sources
Also shown as paper_module, subsystem paper, ontology packet
Search handles subsystem ontology
Source refs standard std_paper_module (standard) doctrine module README (index)
paper_module · artifact Generated from the governed public vocabulary for Plectis.
parser General or domain usage A parser reads input according to a grammar and produces a structured representation or a syntax error.
A JSON parser turns characters such as {"x":1} into an object with a field and number. Successful parsing shows that the text fits accepted syntax, not that its claim is meaningful, true, safe, or authorized .
Parsers handle source code, commands, markup, configuration , and data formats. Lexing may first group characters into tokens; parsing then relates tokens according to grammar. Different parsers can accept different extensions or recover malformed input differently. The resulting syntax tree preserves structure but does not necessarily resolve names, check types, validate business rules, or execute instructions. Treating untrusted parsed content as commands creates a separate security boundary. A parse error locates a structural mismatch, though recovery can make its reported position differ from the original cause.
Scope Parser behavior is determined by the grammar, encoding, error recovery, ambiguity rules, accepted extensions, and structured output supplied to later stages.
Other names, related terms and sources
Also shown as parsers, parse, parsing
Source refs sites/microcosm/docs/paper-module-work-landing-control-spine.html (reading_context) sites/microcosm/docs/rules-and-ideas.html (reading_context)
parser · public projection Generated from the governed public vocabulary for Plectis.
Parseval identity General or domain usage Parseval’s identity says that the squared norm of a function equals the sum of squared magnitudes of its orthogonal Fourier coefficients , with normalization fixed by convention.
For a 2 𝜋 2 π -periodic square-integrable function , one common convention gives 1 2 𝜋 ∫ | 𝑓 ( 𝑡 ) | 2 𝑑 𝑡 = ∑ | 𝑐 𝑛 | 2 1 2 π ∫ | f ( t ) | 2 d t = ∑ | c n | 2 . It is the infinite -dimensional analogue of the Pythagorean theorem for perpendicular coordinates.
In the paper , Parseval converts an integral over circles or radial slices into a coefficient -energy sum . That translation lets analytic coefficient information feed directly into geometric length estimates.
Example For a 2 𝜋 2 π -periodic square-integrable function , one common convention gives 1 2 𝜋 ∫ | 𝑓 ( 𝑡 ) | 2 𝑑 𝑡 = ∑ | 𝑐 𝑛 | 2 1 2 π ∫ | f ( t ) | 2 d t = ∑ | c n | 2 .
Meaning scope General or domain usage. Completeness turns the coefficient bound in Bessel’s inequality into equality . Numerical constants depend on the Fourier normalization.
Scope The exact constants depend on the Fourier normalization. Parseval requires an orthonormal complete system and suitable square integrability; Bessel’s inequality is the corresponding one-sided statement before completeness is used.
Other names, related terms and sources
Also shown as Parseval theorem, Parseval formula
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 514 (mathematical_source)
parseval_identity · mathematical concept Generated from the governed public vocabulary for Plectis.
partial sum General or domain usage A partial sum adds finitely many terms from the beginning of a series .
For a series ∑ 𝑎 𝑛 ∑ a n starting at 𝑛 = 1 n = 1 , its Nth partial sum is 𝑆 𝑁 = 𝑎 1 + ⋯ + 𝑎 𝑁 S N = a 1 + ⋯ + a N . The infinite sum , if it exists, is the limit of these finite sums .
Computing a partial sum gives an approximation only when the remaining tail is controlled. An exact value for the finite sum does not by itself give the exact infinite sum . A proved error estimate connects the approximation with the limiting value.
Example Adding the first thousand reciprocal terms gives a partial sum, not the completed infinite sum .
Scope A partial sum covers the terms included up to its declared cutoff or finite support .
Not this A decimal printed from a partial sum is not proof of the infinite series ' arithmetic type.
Reader rule The unadded terms form the tail of the series .
Other names, related terms and sources
Also shown as finite partial sum, truncated sum
partial_sum · public projection Generated from the governed public vocabulary for Plectis.
passion System-local specialization In Plectis's description of judgement, passion means keeping the purpose and human importance of the work in view.
vision activates work
It asks an agent to understand why a task matters, so routine execution does not lose the aim that made the work worth doing. It works alongside care and proportionate judgement.
The practical effect should be a better choice of action or useful follow-through. Enthusiastic prose alone adds nothing, and commitment to an idea must leave room for correction when the evidence changes.
Example A clear instance is the doctrine card on typed partiality and refusal, which holds a strong, motivated position while still pinning that position to evidence and an explicit boundary, showing stake and discipline operating together. See it live: Typed partiality and refusal open one doctrine card where motivated judgment is held to evidence and a stated boundary
Meaning scope System-local specialization. Passion is an operational vision-and-stake trait in the Type A register. The term does not claim emotion, consciousness, or a psychological measurement.
Scope Passion appears wherever the system describes how human judgment and operator intent are preserved through disciplined process: in its doctrine on partiality, refusal, and authority , and in the surfaces that turn live intent into source -backed, navigable work rather than enthusiasm asserted without backing.
Not this Passion is not hype, enthusiasm for its own sake, or permission to assert something without backing. It is motivated judgment that still answers to the standards and the source .
Reader rule Motivation does not relax requirements for evidence , permissions , or truthful reporting.
Other names, related terms and sources
Also shown as passion register, vision activation
Search handles operator stake, why this matters, care and passion
Related terms supports type_a_judgment Passion is one trait supporting live controller judgment. balances care Passion keeps vision active while care keeps upkeep explicit. constrained_by standard Passion must route through standards rather than adapter-only prose.
Source refs CODEX.md (adapter) CLAUDE.md (adapter) doctrine skill human_ai_brainstorming (skill)
passion · judgment trait Generated from the governed public vocabulary for Plectis.
path connected General or domain usage A set is path connected if any two of its points can be joined by a continuous path entirely within the set.
Formally, the path is a continuous map from the closed interval [ 0 , 1 ] [ 0 , 1 ] , with the chosen points as its endpoints . Every intermediate point of the path must remain in the set.
It also does not give a bound on path length. The lemniscate problem asks for paths satisfying both a location condition and a quantitative length requirement.
Scope Path connectedness implies connectedness, but the converse fails for some spaces.
Other names, related terms and sources
Also shown as path-connected, joined by a continuous path, path connectedness, path-connectedness
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 58 (mathematical_source)
path_connected · mathematical concept Generated from the governed public vocabulary for Plectis.
path handle System-coined term A path handle is a stable short name that resolves to a file or other source location.
compact expandable path id
Plectis uses it to refer to an item without repeating a long or changeable path. The associated record can identify the current location, role, and route for inspecting it.
This helps keep packets compact and migrations traceable. A short name that no longer resolves correctly is a broken reference , even when the name itself has remained unchanged.
Example In this system a paper module such as the Navigation Hologram Route Plane is reached through a stable handle that expands to its underlying source file , rather than by quoting the full path to that file. See it live: Navigation Hologram Route Plane see how files and locations are wired into the system
Meaning scope System-coined term. A path handle is stable semantic indirection to a current path, role, and verification route; it is not the raw filesystem path or URL itself.
Scope Path handle belongs to the system's navigation layer. A reader encounters it wherever a short, linkable name appears in place of a long storage path, and it sits behind the architecture map that shows how files and locations are wired together.
Not this A path handle is not a symlink and not just a nickname for a file. It is a governed navigation entry that records role, freshness , redirects, and an expansion command, so the reference survives even when the storage location moves.
Reader rule The handle preserves identity only if its resolution is maintained when the target moves.
Other names, related terms and sources
Also shown as semantic path handle, path alias, path alias registry
Search handles storage path handle, path ref, handle registry
Source refs doctrine module semantic_naming_grammar (paper_module) doctrine module navigation_hologram_theory (paper_module)
path_handle · navigation Generated from the governed public vocabulary for Plectis.
Paul Erdős Externally anchored Paul Erdős was a mathematician known for work in number theory , combinatorics , probability, and related fields.
Erdős
Scope This entry covers the person and the meaning of his name in the numbered problem labels used on this site.
Not this Erdős is not the author of this site, and the catalogue number is not a theorem number or difficulty ranking.
Reader rule A database number identifies the question; it does not describe its current solution status.
Other names, related terms and sources
Also shown as Erdős
Search handles Paul Erdos, Erdos
erdos · person Generated from the governed public vocabulary for Plectis.
payload General or domain usage A payload is the main data carried by a message, request, event, file wrapper, or test fixture .
Protocols often separate payload content from routing information, headers, checksums , or other control fields. What counts as payload depends on the container and protocol .
A payload may be JSON sent to an API , bytes inside a network packet , data attached to an event, or fixture input passed to a test. The term describes the carried content, not its truth or authorization . Plectis public evaluators load fixture payloads and scan their paths before producing results. Payload validation should check type, size, required fields, and permitted content at the receiving boundary.
Example A JSON request body containing a claim and source references is an API payload.
Meaning scope General or domain usage. Payload is relative to a message or protocol layer. Information treated as overhead at one layer can be payload at another.
Scope Inspect the payload schema and trust boundary; receiving a payload does not make its contents valid or safe.
Not this An HTTP status line routes interpretation of a response but is not its application payload.
Other names, related terms and sources
Also shown as payloads, message payload, request payload
Source refs sites/microcosm/docs/paper-module-public-reveal-walkthrough.html (reading_context)
payload · public projection Generated from the governed public vocabulary for Plectis.
PDF Externally anchored PDF is a document format designed to preserve a page's layout across different devices and applications.
It can contain text, images, fonts, links, and accessibility information. Mathematical papers commonly use it to keep equations and pagination stable for reading and citation.
The site pairs papers with other reading and source routes where available. When comparing a web view with a PDF, the relevant version matters: two readable forms can otherwise describe different revisions.
Example Each listed Erdős problem paper has a downloadable PDF.
Scope PDF covers the rendered document bytes and pages of the named file version.
Not this A PDF paper is not peer-reviewed or machine-checked merely because its layout is fixed.
Reader rule A PDF's appearance does not establish its correctness or whether its text is accessible.
Other names, related terms and sources
Also shown as Portable Document Format
Search handles PDF file, PDF paper
pdf · format Generated from the governed public vocabulary for Plectis.
peer System-local specialization A peer is another participant working at a comparable level or within a shared activity.
future capable agent sibling
In Plectis's agent documentation, it often means another agent that can use recorded work and lessons. The participants may have different tools, permissions , or context even when they use the same model .
Durable records provide the connection between sessions. A later agent can inherit an attributed lesson through source material , while remaining responsible for checking that the lesson fits its current task.
Example The "With a coding agent " page is a concrete instance: it describes how a capable agent like Codex or Claude takes up this system and continues work that an earlier agent began, which is precisely the peer relationship. See it live: With a coding agent see how one capable agent picks up another's work
Meaning scope System-local specialization. A peer is another capable coding-agent instance that can inherit durable agent -authored lessons; it does not imply shared memory, identical capability, or equal authority .
Scope The term covers the future-facing relationship between the AI coding agents that operate this system. A reader meets it wherever the pages describe how agents hand work and learned judgment to one another, most directly on the page about working with a coding agent .
Not this A peer is not the human operator and not a fixed rule in the system's doctrine . It is a comparable coding agent , and the judgment it passes on stays advisory until it has been reviewed and adopted.
Reader rule Being peers does not imply shared memory or identical authority .
Other names, related terms and sources
Also shown as future peer, Codex peer, Claude peer
Search handles Type A peer
Source refs doctrine skill peer_propagation (skill)
peer · actor Generated from the governed public vocabulary for Plectis.
peer review General or domain usage Peer review is evaluation of scholarly work by other people with relevant expertise, usually within a publication or assessment process.
Reviewers may examine correctness, originality, significance, methods, exposition , and fit, depending on the venue. Processes differ in anonymity, depth, openness, duration, and editorial standards . Review can find serious problems and improve work, but acceptance is not a guarantee of truth.
Peer review is a scholarly assessment process that can use confidential reports, open reports, or organized public commentary. It differs from automated testing and formal proof checking. A preprint can be public and citable before review; a published paper can later be corrected or retracted. Reviewers have limited time and may miss errors, while unreviewed work is not thereby false. A precise status identifies the reviewed version, who organized the process, the resulting decision, and any available reports or revisions.
Example A journal records that named manuscript version as accepted after external referee reports and revision.
Scope Peer review covers a particular version, venue, process, and decision; it does not certify permanent truth.
Not this Public availability, internal checking, or machine verification alone is not peer review.
Reader rule Interpret peer-review status together with the reviewed version, venue, process, scope , and later corrections rather than treating the label as a universal certificate .
Other names, related terms and sources
Also shown as refereeing
Search handles peer-reviewed, peer reviewed
peer_review · public projection Generated from the governed public vocabulary for Plectis.
peer-propagate System-coined term A peer-propagate record passes an attributed operating lesson from one agent to later agents .
peer teaches future peers
Meaning scope System-coined term. A peer-propagate is an attributed candidate lesson passed between capable agents ; it is not operator intent, settled doctrine , or private model memory.
Scope The term covers the lane by which reusable agent judgment is preserved and handed forward between Type A agents such as Codex and Claude. A reader meets it on the doctrine page, where the governing rule is provenance propagation and non-interference.
Not this A peer-propagate record is not an instruction from the operator, not a private memory note, and not an active rule the system enforces. It is candidate knowledge one agent records for later agents , carrying its own source and limits .
Reader rule The record remains candidate knowledge rather than operator instruction or active doctrine .
Other names, related terms and sources
Also shown as peer propagate, PEER propagation
Search handles tribal knowledge
Source refs doctrine skill peer_propagation (skill) standard std_peer_propagation_record (standard)
peer_propagate · propagation Generated from the governed public vocabulary for Plectis.
perfect set General or domain usage A perfect set is closed and has no isolated points.
Every point of the set can be approached arbitrarily closely by other points in the set, and the set contains all its limit points. The usual Cantor set is a standard example.
These are separate properties in analysis. Under the usual definition, the empty set is also perfect; statements about nonempty perfect sets must include that extra condition when it is needed.
Example The Cantor set is perfect.
Scope Topological sense. Nothing to do with perfect numbers or perfect powers.
Reader rule Perfect does not mean that the set contains an interval or has positive measure.
Other names, related terms and sources
Also shown as perfectness
perfect_set · public projection Generated from the governed public vocabulary for Plectis.
periodic General or domain usage A sequence is periodic if shifting it by some fixed positive number of positions leaves every term unchanged.
Scope Periodic applies to the named sequence , tail, or digit expansion under its stated indexing.
Not this A pattern repeated several times in computed data is not proof that the sequence is periodic forever.
Reader rule A period need not be the smallest period.
Other names, related terms and sources
Also shown as eventually periodic, repeating pattern
Search handles periodicity
periodic · public projection Generated from the governed public vocabulary for Plectis.
permission General or domain usage Permission is an allowance for an actor to perform an action, within whatever scope and conditions apply.
Permission may come from a person’s instructions, an established policy, or an access-control setting. It concerns what an actor may do; capability concerns what the actor can do. Having a file or a password does not by itself settle permission to use it.
Some permissions are explicitly granted for one action; others follow from an established role or continuing authorization . A person might be allowed to edit a document but not publish it, or to draft a message but not send it. Plectis records authority and action boundaries so agents can carry out authorized work without treating access as unlimited permission or repeatedly asking for approval already given.
Example A maintainer grants a service account read-only access to one public-data bucket.
Meaning scope General or domain usage. Granted authority to perform an action or access a resource; possession of a credential does not by itself establish authorization .
Scope Interpret permission in the context that granted it, including the action, target, duration, and any standing instructions.
Not this Knowing an administrator password does not grant permission to use it.
Other names, related terms and sources
Also shown as permissions, access permission
Source refs sites/microcosm/docs/rules-and-ideas.html (reading_context)
permission · public projection Generated from the governed public vocabulary for Plectis.
phase System-local specialization A phase is a defined stage of work; in Plectis, it carries the objective and state of a resumable work programme.
bounded family work packet
It groups the relevant sources , planned steps, current activity, and closeout information. This makes it possible to stop and resume work without relying on one agent 's memory.
The phase organises work rather than proving that the objective has been achieved. Completed steps, remaining obligations , and the conditions for moving on still need explicit evidence .
Example The Bridge Phase Continuity Runtime is a concrete instance: it is the component that keeps a phase's state intact so an interrupted phase can be resumed rather than restarted. See it live: Bridge Phase Continuity Runtime open the component that keeps a phase resumable across sessions
Meaning scope System-local specialization. Phase means a resumable ai_workflow execution workspace. It is not necessarily a calendar milestone, release stage, scientific phase, or universal project-management unit.
Scope Phase covers the system's unit of in-progress work and its resumable state. A reader meets it in the architecture map and in the runtime that keeps phases continuous across sessions, and in identifiers carrying names like subphase, phase packet, or phase workspace.
Not this A phase is not a project milestone on a calendar or a stage in a release schedule. It is a concrete, resumable execution workspace holding one objective and its current state.
Reader rule A phase's current state should be read from its live record .
Other names, related terms and sources
Also shown as subphase, phase packet, phase workspace
Source refs standard std_phase_scaffold (standard)
phase · runtime Generated from the governed public vocabulary for Plectis.
pip Externally anchored pip is a package installer for Python.
Scope pip is part of the Python distribution and is external to this work.
Reader rule The chosen environment and dependency versions affect what code is installed.
Other names, related terms and sources
Also shown as pip install
pip · public projection Generated from the governed public vocabulary for Plectis.
pipeline General or domain usage A pipeline is an organized set of processing stages that move or transform work from inputs toward outputs.
A build pipeline might parse source , run tests , package files, and publish artifacts . Although often drawn as a line, real pipelines can branch, join, repeat stages, or run independent stages in parallel.
Pipelines make repeated transformations inspectable and automatable, but they are not necessarily simple sequences . A dependency graph may fan out into parallel checks , choose conditional branches, retry a stage, or converge several results before continuing. Stale or malformed upstream input can propagate into later outputs even when each stage runs as designed. A green final stage therefore reflects only the pipeline’s encoded checks . Reproducibility also depends on stage versions, external services, caches , environment , and the exact artifact passed across each boundary.
Scope A pipeline defines stages, data or control dependencies , inputs, outputs, failure behavior, and conditions for advancing or recombining work.
Other names, related terms and sources
Also shown as data pipeline, build pipeline, pipelines
Source refs sites/microcosm/docs/area-formal-math.html (reading_context) sites/microcosm/docs/area-import-drift.html (reading_context)
pipeline · public projection Generated from the governed public vocabulary for Plectis.
planted error General or domain usage A planted error is a deliberate fault added to a test to see whether a check detects it.
It creates a known negative case , such as an invalid claim or mismatched output. The test specifies which response should occur and compares that expectation with the checker 's actual result.
A useful test suite also includes valid cases, because rejecting everything would catch the error without being a useful checker . More varied negative cases can expose different blind spots.
Example After a wording gate was repaired, a deliberately false version of the same claim was rejected.
Scope A planted error establishes that a detector catches that error. It implies no wider coverage .
Reader rule Detecting the planted error is evidence about that failure mode .
Other names, related terms and sources
Also shown as planted failure
Search handles deliberately false
planted_error · public projection Generated from the governed public vocabulary for Plectis.
planted forgery General or domain usage A planted forgery is deliberately false evidence or reporting placed in a controlled test input.
For example, a test note might claim that a command ran when the recorded actions show it did not. Plectis uses such cases to assess whether an audit distinguishes the false account from supported work.
Successful detection supports the tested audit behaviour. It does not establish resistance to every possible misleading report, and the expected finding should identify what was actually false.
Example A note claiming a commit that was never made is one of the planted cases.
Scope The forgeries are synthetic test data. They are not real claims made anywhere.
Reader rule The forgery belongs to the test setup and should be identified as such.
Other names, related terms and sources
Also shown as negative control
planted_forgery · public projection Generated from the governed public vocabulary for Plectis.
Plectis Project identity Plectis is this project's public name, covering its mathematical research, formal proofs , and supporting software .
public woven map
Meaning scope Project identity. Plectis is this project's declared public name. The name does not define a general category or imply affiliation, endorsement, or identity with similarly named external entities.
Scope Plectis is the name used on this site and on the public repository . A reader meets it on every page and on the source and licence page.
Not this Do not use Plectis as proof that package ids, old URLs , or source paths were already renamed; the name is the public identity only, and the earlier Microcosm name still lives on in those technical surfaces.
Reader rule Each paper or component has its own scope and evidence status.
Other names, related terms and sources
Also shown as Plectis public map
Search handles plectis source map, Latin plectere, plectere
Source refs standard std_microcosm (identity_standard) doctrine module microcosm_substrate (paper_module) sites/microcosm/index.html (staged_public_landing)
plectis · public projection Generated from the governed public vocabulary for Plectis.
pointwise majorant General or domain usage A pointwise majorant bounds another function at each input, often bounding its absolute value .
To majorize magnitudes, choose 𝑔 ≥ 0 g ≥ 0 with | 𝑓 ( 𝑥 ) | ≤ 𝑔 ( 𝑥 ) | f ( x ) | ≤ g ( x ) at every relevant input. For a family 𝑓 𝑛 f n , one common majorant uses the same g for every n.
The #1049 partition argument finds a bound independent of determinant size N and proves its sum over all partitions finite . The #257 divisor -cover argument instead majorizes fractional powers of finite divisor counts by positive divisor sums. The geometric-majorant entry is the special case in which the bound has a fixed geometric ratio.
Meaning scope General or domain usage. A majorant can mean f≤g or |f|≤g depending on the statement. This row explicitly identifies the magnitude form when absolute convergence or dominated convergence is intended.
Scope A pointwise upper bound alone need not have a finite sum or integral. A common summable majorant can justify passing limits through sums; unrelated bounds for each member do not provide that justification.
Other names, related terms and sources
Also shown as majorant, dominating function, summable majorant
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::eq:partition-tail (mathematical_source)
pointwise_majorant · mathematical concept Generated from the governed public vocabulary for Plectis.
Poisson kernel General or domain usage The boundary weighting that recovers a harmonic function inside a domain from its boundary values.
On the unit disc , 𝑃 ( 𝑧 , 𝑒 𝑖 𝜃 ) = ( 1 − | 𝑧 | 2 ) / | 𝑒 𝑖 𝜃 − 𝑧 | 2 P ( z , e i θ ) = ( 1 − | z | 2 ) / | e i θ − z | 2 . Its average against normalized angular measure is one. For continuous boundary data h, integrating h against this kernel gives the harmonic extension at z.
The #1041 argument uses a Poisson identity for a finite Blaschke product to weight boundary fibres. It also combines Poisson kernels centred at critical points to prove a weighted inequality for critical values . Neither use replaces the separate metric estimate for connecting roots.
Meaning scope General or domain usage. The displayed formula uses normalized angular measure on the unit disc ; densities with respect to unnormalized arc length have a different factor .
Scope A density with respect to arc length includes the normalization factor 1 / ( 2 𝜋 ) 1 / ( 2 π ) on the unit circle. The kernel depends on the domain and the interior observation point; it is uniform only at the disc centre.
Other names, related terms and sources
Also shown as Poisson kernels
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1965 (mathematical_source)
poisson_kernel · mathematical concept Generated from the governed public vocabulary for Plectis.
pole General or domain usage An isolated singularity at which a holomorphic function has a finite -order blow-up.
A pole of order 𝑚 ≥ 1 m ≥ 1 at a means 𝑓 ( 𝑧 ) = ( 𝑧 − 𝑎 ) − 𝑚 𝑔 ( 𝑧 ) f ( z ) = ( z − a ) − m g ( z ) near a, where g is holomorphic and 𝑔 ( 𝑎 ) ≠ 0 g ( a ) ≠ 0 . Equivalently, its Laurent expansion has no powers below − 𝑚 − m and a nonzero coefficient of ( 𝑧 − 𝑎 ) − 𝑚 ( z − a ) − m .
The #1049 coefficient calculation proves a genuine fourth-order pole at the dominant point of a generating function . Subtracting its full principal part leaves a function analytic on a larger disc, which permits a controlled coefficient estimate.
Meaning scope General or domain usage. The ordinary one-variable complex-analytic pole is intended; nonzero leading Laurent coefficient is necessary to establish its order.
Scope A denominator zero is not automatically a pole: cancellation can make it removable. Essential singularities and branch points are different cases. For example 1 / 𝑧 1 / z has a simple pole at zero, while e x p ( 1 / 𝑧 ) exp ( 1 / z ) has an essential singularity.
Other names, related terms and sources
Also shown as complex pole
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2230 (mathematical_source)
pole · mathematical concept Generated from the governed public vocabulary for Plectis.
Pólya area–capacity inequality General or domain usage For a compact planar set, its area is at most 𝜋 π times the square of its logarithmic capacity .
The inequality is A r e a ( 𝐾 ) ≤ 𝜋 c a p ( 𝐾 ) 2 Area ( K ) ≤ π cap ( K ) 2 . Both sides scale quadratically when K is enlarged. A closed disc has equality , so the factor 𝜋 π cannot be improved. The area means two-dimensional Lebesgue area and the capacity is logarithmic capacity .
In #1041 a component -capacity estimate is converted into the area input for the Bergman segment estimate. The resulting length claim therefore depends on both the capacity argument and the analytic connector construction, not on this area inequality alone.
Meaning scope General or domain usage. This is the planar area-versus-logarithmic-capacity inequality ; the direction must not be reversed.
Scope A bound on capacity gives an upper bound on area. The converse conclusion does not follow from this one-way inequality : a small area alone does not force a small capacity. It is not the perimeter–area isoperimetric inequality .
Other names, related terms and sources
Also shown as Polya area-capacity inequality, area–capacity inequality, area-capacity inequality
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 2001 (mathematical_source)
polya_area_capacity_inequality · mathematical concept Generated from the governed public vocabulary for Plectis.
polynomial General or domain usage A finite sum of constant multiples of nonnegative whole-number powers of a variable .
For example, 𝑓 ( 𝑧 ) = 𝑧 3 + 2 𝑧 − 5 f ( z ) = z 3 + 2 z − 5 is a polynomial: its terms use powers 3, 1, and 0, and its coefficients are 1, 2, and -5. Expressions such as 1 / 𝑧 1 / z or √ 𝑧 z are not polynomials in z.
The lemniscate papers study complex polynomials through their zeros, derivative , critical values , and sets where | 𝑓 ( 𝑧 ) | | f ( z ) | stays below a threshold .
Scope The degree is the largest exponent with nonzero coefficient . Evaluating the polynomial means substituting a number for the variable and carrying out the indicated arithmetic.
Other names, related terms and sources
Also shown as polynomials
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 52 (mathematical_source)
polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
polynomial growth General or domain usage A sequence has polynomial growth when its magnitude is eventually bounded by a fixed power of its index times a constant.
For example, | 𝑎 𝑛 | ≤ 𝐶 𝑛 𝑑 | a n | ≤ C n d for all sufficiently large n gives 𝑎 𝑛 = 𝑂 ( 𝑛 𝑑 ) a n = O ( n d ) . Both C and d are fixed independently of n.
The #251 reasoning surface uses polynomial growth as a sufficient condition for a finite summation-by-parts endpoint divided by 2 𝑛 2 n to vanish. The #249 discussion also invokes polynomial -growth hypotheses in a rational -or-transcendental dichotomy for Mahler series . Each application retains its other hypotheses.
Scope This is an upper bound , not an assertion that 𝑎 𝑛 a n equals a polynomial or is asymptotic to 𝑛 𝑑 n d . An exponent allowed to change with n would not give the same condition.
Other names, related terms and sources
Also shown as polynomially bounded
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::line 1964 (mathematical_source)
polynomial_growth · mathematical concept Generated from the governed public vocabulary for Plectis.
polynomial interpolation General or domain usage Polynomial interpolation constructs a polynomial that takes prescribed values at finitely many specified inputs.
Scope The degree bound and distinctness of the inputs are essential for uniqueness. Interpolating a finite sample alone does not prove that an infinite sequence follows the resulting polynomial .
Other names, related terms and sources
Also shown as Newton interpolation, interpolation polynomial
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-extraction (mathematical_source)
polynomial_interpolation · mathematical concept Generated from the governed public vocabulary for Plectis.
positive integer General or domain usage A positive integer is one of 1, 2, 3, … .
It is an integer strictly greater than zero. This differs from a nonnegative integer , which can also be zero, and from a positive real number , which need not be whole.
For example, 𝑛 ! n ! is defined at zero, but 1 / ( 𝑛 ! − 1 ) 1 / ( n ! − 1 ) has zero denominator there and at 𝑛 = 1 n = 1 . A series using that expression therefore needs an appropriate starting index .
Example 1 and 249 are positive integers.
Scope Positive integer covers the integer domain 𝑛 > 0 n > 0 in the stated theorem or definition.
Not this 0, − 3 − 3 , and 1 / 2 1 / 2 are not positive integers.
Reader rule The restriction often excludes an undefined or exceptional case.
Other names, related terms and sources
Also shown as strictly positive integer
Search handles positive integers
positive_integer · mathematical concept Generated from the governed public vocabulary for Plectis.
positive-definite matrix General or domain usage A real symmetric or complex Hermitian matrix A is positive definite when 𝑥 ∗ 𝐴 𝑥 > 0 x ∗ A x > 0 for every nonzero vector x.
The identity matrix is positive definite because 𝑥 ∗ 𝐼 𝑥 x ∗ I x is the squared length of x. The matrix ( 1 1 1 1 ) ( 1 1 1 1 ) is only positive semidefinite : the nonzero vector ( 1 , − 1 ) ( 1 , − 1 ) gives zero.
In the cited Gram-matrix setting, the quadratic form is the squared norm of a linear combination . Strict positivity therefore expresses independence of the underlying analytic atoms rather than merely positivity of individual entries .
Example The identity matrix is positive definite because 𝑥 ∗ 𝐼 𝑥 x ∗ I x is the squared length of x.
Meaning scope General or domain usage. Positive definiteness concerns every nonzero vector in a quadratic form; positive matrix entries alone do not establish it.
Scope For arbitrary nonsymmetric matrices , the phrase needs qualification; the standard spectral equivalences apply to symmetric or Hermitian matrices . Positive entries alone do not imply positive definiteness, and a positive-definite matrix must be nonsingular.
Other names, related terms and sources
Also shown as positive definite matrix, positive definiteness
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 1468 (mathematical_source)
positive_definite_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
positive-semidefinite matrix General or domain usage A real symmetric or complex Hermitian matrix A is positive semidefinite when 𝑥 ∗ 𝐴 𝑥 ≥ 0 x ∗ A x ≥ 0 for every vector x.
The matrix ( 1 1 1 1 ) ( 1 1 1 1 ) is positive semidefinite because its quadratic form is | 𝑥 1 + 𝑥 2 | 2 | x 1 + x 2 | 2 , but it is not positive definite because the nonzero vector ( 1 , − 1 ) ( 1 , − 1 ) gives zero.
A Gram matrix has quadratic form equal to the squared norm of a vector combination, so it is always positive semidefinite. It becomes positive definite exactly when no nontrivial combination vanishes.
Example The matrix ( 1 1 1 1 ) ( 1 1 1 1 ) is positive semidefinite because its quadratic form is | 𝑥 1 + 𝑥 2 | 2 | x 1 + x 2 | 2 , but it is not positive definite because the nonzero vector ( 1 , − 1 ) ( 1 , − 1 ) gives zero..
Meaning scope General or domain usage. Semidefinite permits the quadratic form to vanish on nonzero vectors; positive definite does not. Positive entries alone imply neither.
Scope The symmetric or Hermitian hypothesis is part of the standard definition. Semidefinite allows zero on nonzero vectors; definite requires strict positivity there. Positive entries do not imply either property.
Other names, related terms and sources
Also shown as positive semidefinite matrix, positive semidefinite
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 1468 (prerequisite_dependency)
positive_semidefinite_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
power series General or domain usage A power series adds constant coefficients multiplied by successive nonnegative integer powers of a variable ’s offset from a centre.
Other names, related terms and sources
Also shown as convergent power series
power_series · mathematical concept Generated from the governed public vocabulary for Plectis.
preimage General or domain usage All inputs that a function sends into a specified output set.
For 𝑓 ( 𝑥 ) = 𝑥 2 f ( x ) = x 2 , the preimage of { 4 } { 4 } is { − 2 , 2 } { − 2 , 2 } , and the preimage of [ 0 , 4 ] [ 0 , 4 ] is [ − 2 , 2 ] [ − 2 , 2 ] . A preimage is a set of inputs, so it exists even when f has no inverse function .
A ray in the polynomial -value plane can have a preimage containing several Newton-trajectory branches. Critical points mark where the polynomial can cease to be locally one-to-one , so the preimage need not be a single curve.
Meaning scope General or domain usage. Set-theoretic function language. Do not confuse preimage with inverse function .
Scope For an output set B, 𝑓 − 1 ( 𝐵 ) f − 1 ( B ) means { 𝑥 : 𝑓 ( 𝑥 ) ∈ 𝐵 } { x : f ( x ) ∈ B } . The superscript -1 here denotes inverse image, not reciprocal . Preimages preserve unions, intersections, and complements without requiring injectivity.
Other names, related terms and sources
Also shown as inverse image
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 636 (mathematical_source)
preimage · mathematical concept Generated from the governed public vocabulary for Plectis.
premise General or domain usage A premise is a statement taken as a starting point for an argument, whether proved, observed, assumed, or hypothetical.
An argument may validly derive a conclusion from its premises even when one premise is false. For example, ‘all birds swim; robins are birds; therefore robins swim’ has a valid form but an untrue first premise.
Premises include mathematical hypotheses, measured facts, cited claims , policy assumptions , and temporary suppositions used to explore consequences. Their status matters independently of the reasoning that follows. A valid argument cannot have true premises and a false conclusion, but it can begin with a false premise and reach a false or accidentally true conclusion. A sound argument is valid and has true premises. Recording where each premise came from shows whether the conclusion describes reality, a conditional case, or only an internally consistent possibility.
Scope Validity concerns whether the conclusion follows if the premises hold; soundness additionally requires valid reasoning and true premises.
Other names, related terms and sources
Also shown as premises, starting assumption
Source refs sites/microcosm/docs/reference.html (reading_context) sites/microcosm/docs/area-formal-math.html (reading_context)
premise · public projection Generated from the governed public vocabulary for Plectis.
prime General or domain usage A prime number is an integer greater than 1 whose only positive divisors are 1 and itself.
The primes begin 2, 3, 5, 7, 11. The number 1 is not prime. Every integer greater than 1 factors uniquely into primes, apart from the order of the factors .
The papers use prime factors to analyse denominators , periods, and reciprocal sums . Claims about consecutive primes also depend on excluding any other prime between the two named values.
Example Erdős #251 asks about the series built from the gaps between consecutive primes.
Scope A result about a prime-generated series covers that series .
Reader rule Being prime is different from being coprime to another number.
Other names, related terms and sources
Also shown as prime number
prime · public projection Generated from the governed public vocabulary for Plectis.
prime gap General or domain usage A prime gap is the difference between consecutive prime numbers .
For example, the gap from 7 to 11 is 4 because there is no prime between them. Differences between arbitrary primes are not necessarily prime gaps in this sense.
Questions about prime gaps ask how these differences behave as primes grow. A computed range establishes the gaps in that range, while a claim about infinitely many gaps requires a general argument.
Example Erdős #251 asks about a dyadic series generated from consecutive primes , equivalently from their gaps.
Scope Prime gap covers the difference between the named consecutive primes or the corresponding indexed gap sequence .
Not this The difference between nonconsecutive primes is not the prime gap at either index .
Reader rule The endpoint primes and the absence of an intervening prime are both part of the definition.
Other names, related terms and sources
Also shown as gap between primes, consecutive-prime gap
prime_gap · public projection Generated from the governed public vocabulary for Plectis.
prime ideal General or domain usage A prime ideal p in a commutative ring R is a proper ideal such that 𝑎 𝑏 ∈ 𝑝 a b ∈ p implies 𝑎 ∈ 𝑝 a ∈ p or 𝑏 ∈ 𝑝 b ∈ p .
Meaning scope General or domain usage. A prime ideal is proper and gives an integral-domain quotient. It need not be maximal.
Scope A prime ideal must be proper. It need not be maximal: for example, the zero ideal in Z is prime but not maximal. In the ring of integers of a number field , every nonzero prime ideal is maximal.
Other names, related terms and sources
Also shown as prime ideals
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 287 (prerequisite_dependency)
prime_ideal · mathematical concept Generated from the governed public vocabulary for Plectis.
prime number theorem General or domain usage The prime number theorem says that the number of primes at most x is asymptotic to 𝑥 / l o g 𝑥 x / log x as x tends to infinity.
Scope This is an asymptotic statement about cumulative counts. It does not by itself give an exact formula for individual primes or a bound on every individual prime gap .
Other names, related terms and sources
Also shown as PNT
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 459 (mathematical_source)
prime_number_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
prime power General or domain usage A prime power is a number 𝑝 𝑘 p k where p is prime and k is a positive integer .
For example, 8 = 2 3 8 = 2 3 and 9 = 3 2 9 = 3 2 are prime powers, while 12 is not because it has two different prime factors . Some contexts also allow exponent zero, so that convention must be stated.
Prime powers record how often a prime factor occurs. This finer information is needed when the papers ask whether a denominator factor survives cancellation at a particular exponent .
Other names, related terms and sources
Also shown as power of a prime, p-power
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos68-factorial-reasoning-surface.tex::line 387 (mathematical_source)
prime_power · mathematical concept Generated from the governed public vocabulary for Plectis.
prime-counting function General or domain usage The prime-counting function 𝜋 ( 𝑥 ) π ( x ) counts the prime numbers less than or equal to x.
Scope Some libraries also define a strict counting version using primes less than x. The inequality convention matters at a prime input and must be checked .
Other names, related terms and sources
Also shown as prime counting function, prime-counting function π
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::line 2143 (mathematical_source)
prime_counting_function · mathematical concept Generated from the governed public vocabulary for Plectis.
prime-tuple singular series General or domain usage The prime-tuple singular series is an infinite product correcting the predicted prime -pattern density for residue constraints at every prime .
For a fixed set 𝐻 H of 𝑘 k distinct integer shifts, it is 𝔖 ( 𝐻 ) = ∏ 𝑝 p r i m e ( 1 − 𝜈 𝐻 ( 𝑝 ) / 𝑝 ) ( 1 − 1 / 𝑝 ) − 𝑘 S ( H ) = ∏ p prime ( 1 − ν H ( p ) / p ) ( 1 − 1 / p ) − k . Here 𝜈 𝐻 ( 𝑝 ) ν H ( p ) is the number of residue classes occupied by the shifts.
In #251, the hypothesized count has main term 𝔖 ( 𝐻 ) ∫ 𝑥 2 ( l o g 𝑡 ) − 𝑘 𝑑 𝑡 S ( H ) ∫ 2 x ( log t ) − k d t . The singular series accounts for local prime congruences ; controlling the error uniformly across growing tuples requires an additional conjectural estimate.
Meaning scope General or domain usage. This is the Hardy–Littlewood singular series for distinct integer prime shifts. Other analytic-number-theory problems have different singular series .
Scope An inadmissible tuple makes one factor zero. For a fixed admissible tuple the product converges to a positive number; it is a density correction, not a probability by itself.
Other names, related terms and sources
Also shown as singular series of a prime tuple, Hardy–Littlewood singular series, Hardy-Littlewood singular series
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::lines 489–497 (mathematical_source)
prime_tuple_singular_series · mathematical concept Generated from the governed public vocabulary for Plectis.
prime-weighted mass General or domain usage In the #257 paper , prime-weighted mass is a sum over selected exponents with a weight determined by their P-parts .
Meaning scope General or domain usage. The #257 manuscript defines this weighted sum . It is not a universal mathematical meaning of mass, and the glossary does not extend its theorem beyond the stated support condition.
Scope This is a specific paper -defined weight. Finite reciprocal sum is sufficient, but not necessary, for finite base-two mass; the prime set and base must be specified.
Other names, related terms and sources
Also shown as finite prime-weighted mass, prime-weighted support mass, weighted-support mass
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
prime_weighted_mass · mathematical concept Generated from the governed public vocabulary for Plectis.
principle System-local specialization A principle is a general rule or commitment that guides decisions.
durable operating law
Plectis stores principles with stable identities, explanations, and relationships to more specific standards and mechanisms . They express why the system should behave in a certain way across multiple tasks.
Its implementation is assessed through the rules and actions that enact it. Recording a principle makes the commitment inspectable, but does not establish that every agent or component already follows it.
Example "Status fails closed" is a principle: it commits the system to treating an unknown or unproven status as not-passing rather than assuming success, so that absence of evidence never reads as a green light. See it live: Status fails closed open one stated principle with its rationale
Meaning scope System-local specialization. Principle means a governed local operating rule or design constraint. It is not automatically universal, moral, scientific, or externally accepted law.
Scope Principles appear throughout the doctrine and rules-and-ideas pages, where each is shown as a numbered, named rule with its rationale; they are the general laws the more specific anti-patterns, mechanisms , and components are measured against.
Not this A principle is not a passing slogan, a personal preference, or a description of one feature. It is a governed , evidence-backed rule that holds across cases, distinct from the narrower mechanisms and anti-patterns it governs .
Reader rule A broad principle still needs interpretation in the conditions of a particular case.
Other names, related terms and sources
Also shown as pri, pri_*, operating law
Search handles rule, design intuition proxy, primitive choice proxy
Source refs doctrine skill principles_curation (skill)
principle · doctrine Generated from the governed public vocabulary for Plectis.
prior art General or domain usage Prior art is earlier work relevant to whether a claimed idea, method, or result is new.
In scholarship, earlier papers , notes, talks, code, or dated communications can affect attribution and priority. Patent law uses the same phrase under jurisdiction-specific legal rules, which this general glossary does not adjudicate. Earlier related work may overlap completely, partially, or only provide ingredients.
Prior art research maps a contribution into what was already available. Exact anticipation can defeat a priority claim, while partial overlap may narrow novelty without diminishing correctness or usefulness. Independent rediscovery still deserves accurate attribution and can add exposition , verification , implementation , or generalization. Search is inherently incomplete across terminology, languages, venues, and unpublished history. Therefore responsible statements describe databases and sources checked , distinguish located evidence from absence, and avoid converting a bounded search into a universal legal or historical conclusion.
Example A reduction published earlier by someone else is prior art for the same reduction .
Scope Used in the scholarly-priority sense here, not the patent-law sense.
Reader rule A novelty assessment compares exact claims , dates, accessibility , and dependence; failing to find prior art does not establish that none exists.
Other names, related terms and sources
Also shown as priority claim
prior_art · public projection Generated from the governed public vocabulary for Plectis.
privacy General or domain usage Privacy concerns boundaries around access to a person, their activities, and information about them.
For digital systems, privacy includes what personal information is collected, how it is used, who can see it, and how long it is kept. It also concerns unwanted observation or interference. Security can help protect these boundaries, but a secure system can still use information intrusively.
Privacy depends partly on context: sharing a fact with one person or for one purpose does not necessarily invite every later use. Consent, expectations, access controls, and retention practices all contribute . Plectis separates private working material from its public projection . A check that excludes account secrets addresses one part of that boundary; it does not settle every question about appropriate collection, sharing, or inference.
Example Publishing only aggregate counts can reduce disclosure of individual records .
Meaning scope General or domain usage. Privacy includes boundaries around observation and access to people as well as uses of personal information. Security measures alone do not establish appropriate use.
Scope A secure system can still violate privacy by collecting or using data beyond an appropriate purpose.
Not this Encrypting a database does not by itself justify collecting its contents.
Other names, related terms and sources
Also shown as data privacy, informational privacy
Source refs sites/microcosm/docs/open-questions.html (reading_context)
privacy · public projection Generated from the governed public vocabulary for Plectis.
probability distribution General or domain usage A probability distribution specifies the probabilities of possible outcomes or sets of outcomes.
It assigns probability 1 to the whole outcome space and adds probabilities of disjoint events, including countable collections. A fair die assigns 1 / 6 1 / 6 to each face. For a continuous distribution, probabilities are usually assigned to regions such as intervals.
The papers use finite or limiting sampling models to reinterpret arithmetic sums. A stated distribution is a mathematical model ; whether it describes observed data is a separate question about assumptions and evidence .
Meaning scope General or domain usage. Probability and number theory . Distinct from distribution in the generalized-function sense.
Scope An individual point can have probability zero in a continuous distribution, even though a region containing it has positive probability.
Other names, related terms and sources
Also shown as probability law
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos249-totient-reasoning-surface.tex::line 1340 (mathematical_source)
probability_distribution · mathematical concept Generated from the governed public vocabulary for Plectis.
probability measure General or domain usage A probability measure assigns nonnegative, countably additive probabilities to measurable events, with total mass one.
Meaning scope General or domain usage. The measure-theoretic probability meaning is intended. Normalization and countable additivity concern measurable events; a list of weights or a statistical forecast needs these conditions to define such a measure.
Scope Changing the measure can change what is probable or negligible. A finite empirical measure , a limiting distribution, and a uniform model are different objects.
Other names, related terms and sources
Also shown as probability measures
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript) sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex (local_manuscript)
probability_measure · mathematical concept Generated from the governed public vocabulary for Plectis.
probability space General or domain usage A probability space consists of outcomes, a collection of measurable events, and a probability measure on those events.
It is often written ( Ω , 𝐹 , 𝑃 ) ( Ω , F , P ) : Ω Ω is the outcome set, F is a sigma algebra of events, and P assigns their probabilities. F contains Ω Ω and is closed under complements and countable unions. Random variables and independence statements use this same space.
The #257 note compares finite residue spaces with the profinite integers . For each positive integer input, the full short-window divisor sum is finite . Its extension by increasing cutoffs to the profinite space is infinite almost surely ; the two statements are compatible.
Meaning scope General or domain usage. The standard probability model is intended, including its measurable-event structure. It is not merely a set of sample values or a guarantee that all outcomes are equally likely.
Scope Name the space and measure before comparing probabilities. A result about random points in an enlarged space need not hold for every original input.
Other names, related terms and sources
Also shown as probability spaces
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
probability_space · mathematical concept Generated from the governed public vocabulary for Plectis.
problem note System-local specialization A problem note is a focused mathematical write-up about one problem and the work done on it.
It states the question, relevant definitions, established results, and remaining uncertainty, with references to supporting proof or calculation. It may be shorter than a full research paper while still needing precise claims and attribution.
The notes here help readers distinguish original targets from reformulations , conditional results , and finite evidence . The accompanying source provides further detail where the short account leaves it out.
Example Each covered problem has its own note; two of them also have full reasoning papers .
Meaning scope System-local specialization. A problem note is Plectis’s short rendered paper for one open problem and its proved/open boundary; it is not an issue note, private work note, or full working record .
Scope A problem note covers one problem and the results actually proved about it.
Reader rule A note about an open problem is not necessarily a claimed solution.
Other names, related terms and sources
Also shown as short note
Search handles short notes, short problem note, short problem notes
Source refs sites/microcosm/papers/papers-source-manifest.json (source_authority)
problem_note · public projection Generated from the governed public vocabulary for Plectis.
producer System-local specialization A producer is the person, model , or program that generates an output.
In Plectis's verification descriptions, the output may be a proposed claim , certificate , proof , or artifact . A separate checking step decides whether it satisfies the relevant requirements.
In mathematical research plans, “producer” can also name a missing construction that would supply a required object. Its exact target and logical role must then be stated in the surrounding argument.
Example Doctrine AX-2 requires a certificate a producer emits to be checked independently.See it live: Doctrine where producer and checker are separated
Meaning scope System-local specialization. In doctrine copy, a producer is the untrusted generator of a claim or certificate . Acceptance must come from a separate small checker , not from the producer itself.
Scope Doctrine operating-loop copy about who emits versus who accepts.
Not this The producer is not the Lean kernel , and not the public website.
Reader rule Acceptance should depend on the output and evidence rather than on confidence in the producer's presentation.
Other names, related terms and sources
Also shown as untrusted producer
producer · public projection Generated from the governed public vocabulary for Plectis.
product General or domain usage In mathematics , a product is the result of multiplication; in software discussions, it can mean an offering intended for users.
For example, 12 is the product of 3 and 4. The notation ∏ ∏ can indicate multiplication over a family of factors , just as ∑ ∑ indicates addition over terms.
For an infinite product, convergence needs a definition and proof appropriate to that setting. A long finite multiplication does not automatically determine the behaviour of the infinite expression.
Example “Product authority ” concerns permission to judge or launch an offering; a “prime product formula” concerns multiplication of prime factors .
Meaning scope General or domain usage. Plectis uses two ordinary senses of product (software offering and multiplication result), and the surrounding nouns determine which one applies.
Scope Covers the two ordinary senses that appear in Plectis and exists primarily to keep them explicitly disambiguated.
Not this 3 + 4 3 + 4 is a sum , not a product.
Reader rule The surrounding subject distinguishes the arithmetic meaning from the software meaning.
Other names, related terms and sources
Also shown as multiplication result
Search handles finite product, products
product · public projection Generated from the governed public vocabulary for Plectis.
profile gap System-coined term A profile gap marks missing support for presenting a kind of system object at the promised levels of detail.
missing row support
The underlying files or registry may exist while the navigation lacks reliable summaries, cards, or item-level routes. Plectis records the gap so an overview can acknowledge the collection without pretending its browsing support is complete.
Repair should connect the artifact kind to a suitable profile and builder, then verify that the resulting rows preserve identity, meaning, and access to the relevant source .
Example In the architecture map , a kind that appears in the system inventory but has no completed flag-and-card row support is shown as carrying a profile gap, which is why it is named at the top level yet cannot be drilled into member by member. See it live: How it fits together (architecture map) see where kinds become browsable and where a gap stands in
Meaning scope System-coined term. A profile gap means an artifact kind exists but lacks the supported row projections needed for honest browsing; it is not an absent model profile or proof that the source artifact is missing.
Scope The term covers the boundary between artifacts the system can see and artifacts it can list as selectable rows. A reader meets it in the navigation and architecture surfaces, where some kinds are marked as fully browsable and others carry this gap.
Not this A profile gap is not a bug, a missing file, or a broken page. It is a recorded marker that a kind's row-level browsing has not been finished, even though the kind itself exists and is visible.
Reader rule Existing source and complete navigation are separate states.
Other names, related terms and sources
Also shown as profile_gap, projection gap
Search handles option-surface gap, missing row support, navigation debt receipt, rowability gap
Source refs runtime module kind_atlas (code) runtime module standard_option_surface (code) standard std_kind_atlas (standard)
profile_gap · navigation Generated from the governed public vocabulary for Plectis.
program General or domain usage A computer program is a set of instructions that a computing system can execute .
It can transform inputs, control a process, or provide an interactive service. In other contexts, “programme” can mean an organised initiative or course of work; the site uses that ordinary sense too.
Source code is available for inspection , while a recorded run supplies evidence about a particular execution . Neither the name of a program nor its successful launch establishes every claim about its behaviour.
Example The public-site builder is a computer program; a bug-bounty program is an organized security initiative.
Meaning scope General or domain usage. Plectis uses program for executable software and for organized initiatives such as a bug-bounty program; the surrounding context must choose the sense.
Scope Covers executable software and organized initiatives only where the surrounding context makes the intended sense clear.
Not this A document describing an algorithm is not itself the executable program.
Reader rule An executable program's behaviour depends on its code, inputs, and environment .
Other names, related terms and sources
Also shown as computer program
Search handles executable program, programs
program · public projection Generated from the governed public vocabulary for Plectis.
progressive enhancement General or domain usage Progressive enhancement starts with usable core content and adds richer presentation or interaction when the browser supports it.
The base page supplies meaningful HTML, working links, and readable content. CSS and JavaScript then add features such as previews, search, animation, or layout without making the core route depend on them.
Progressive enhancement treats browser capabilities as additions rather than assumptions . It can improve resilience, accessibility , and compatibility because readers still receive the main content when an optional feature fails. Plectis keeps direct files and glossary links available when JavaScript is off, then adds hover cards and navigation memory in capable browsers . It does not require every advanced feature to have an identical no-script substitute.
Example A term remains a real glossary link, while JavaScript adds an on-page definition card.
Meaning scope General or domain usage. A design in which core content and actions work in a basic form while optional layers add richer behavior.
Scope Test both the enhanced path and the base path that remains when scripts, styles, or optional APIs are unavailable.
Not this Displaying an empty page until a large script finishes is not progressive enhancement.
Other names, related terms and sources
Also shown as progressively enhanced
Source refs sites/microcosm/index.html (prerequisite_context)
progressive_enhancement · public projection Generated from the governed public vocabulary for Plectis.
projection General or domain usage A projection produces a selected representation of something, such as a source -derived view or a mathematical map onto chosen coordinates.
Plectis projects source records into pages, indexes , and cards. A mathematical example sends (x,y) to its first coordinate x; a projection onto the horizontal axis instead sends (x,y) to (x,0). The domain and codomain distinguish these maps.
Many mathematical projections satisfy 𝑃 ( 𝑃 ( 𝑥 ) ) = 𝑃 ( 𝑥 ) P ( P ( x ) ) = P ( x ) : repeating the projection changes nothing further. That equation applies when the output can be fed back into the same map . It is not an automatic law of every software summary.
Example The glossary page is a projection of the governed term registry .
Scope Covers generated views and mathematical projections with their distinct source , domain, and preservation conditions.
Not this A generated page is not a second authority for its source facts; a mathematical projection need not preserve all the information in its input.
Reader rule A generated view is interpreted through its sources and build revision; a mathematical projection is interpreted through its defining map and laws.
Other names, related terms and sources
Also shown as generated projection, projected view
Search handles projection output
projection · public projection Generated from the governed public vocabulary for Plectis.
projection drift General or domain usage Projection drift is a mismatch between a generated view and the source it is meant to represent.
It can arise when the source changes without a rebuild, or when the builder transforms it incorrectly. A page may then display an outdated count, missing item, or inaccurate summary.
Rebuilding fixes some forms of drift , but a faulty transformation needs repair in the builder. Plectis records the comparison so the mismatch can lead to an appropriate correction rather than another unsupported status label.
Example A count printed on a page that the substrate no longer produces has drifted .
Scope Applies to generated copies of source material , including this website.
Reader rule The relevant source and generation rules determine what agreement should mean.
Other names, related terms and sources
Also shown as projection-drift, drift control
Search handles projection-drift control
projection_drift · public projection Generated from the governed public vocabulary for Plectis.
proof General or domain usage A proof is a logically valid argument establishing a statement from definitions, assumptions , and previously justified results.
Scope A mathematical proof establishes its conclusion under its premises ; an operational proof record supports the exact condition checked by its workflow.
Not this Examples, numerical evidence , and a plausible explanation are not a proof of a universal statement.
Reader rule A proof of an implication establishes the conclusion under its hypotheses.
Other names, related terms and sources
Also shown as mathematical proof
Search handles proofs, proof argument
proof · mathematical concept Generated from the governed public vocabulary for Plectis.
proof assistant General or domain usage A proof assistant is software for constructing and checking arguments in a formal logical system.
It provides a language for definitions and statements, tools for developing proofs , and a checking mechanism . Lean is the proof assistant used for the formal mathematics linked from this site.
It does not choose the research question or automatically assess significance. Authors remain responsible for faithful formalisation , readable explanation, attribution, and identifying any gaps or extra assumptions in the proof .
Example Lean is the proof assistant used for the formal mathematics on this site.
Scope A proof assistant establishes validity, not significance.
Reader rule The assistant checks what is formally stated, including the assumptions and dependencies used.
Other names, related terms and sources
Also shown as interactive theorem prover
proof_assistant · public projection Generated from the governed public vocabulary for Plectis.
proof boundary System-local specialization A proof boundary identifies the exact claim , assumptions , and cases established by an argument.
For a Lean result, inspect its statement, imported definitions, hypotheses, and axioms . For an ordinary proof , inspect the same mathematical scope in its statement and reasoning. A boundary can concern a finite range, a special class, or a conditional implication .
The local pages use this phrase to describe partial results without promoting them into complete solutions. Claims outside one proof may have another proof or other evidence ; falling outside that boundary does not make them false or personal opinion.
Example A Lean theorem proving a statement for a finite range sits behind a proof boundary from a README sentence implying the general case.
Meaning scope System-local specialization. This is a local label for a proof 's scope , applicable to formal and ordinary arguments. It is not a special logical operator or a division of knowledge into machine-checked facts and unsupported human claims .
Scope The boundary belongs to one argument and its scope ; other arguments may establish additional claims .
Not this A working paper -to-Lean source link alone does not prove the prose and formal theorem equivalent.
Reader rule Compare surrounding prose with that scope . A theorem for n below a fixed bound does not establish the same assertion for every n.
Other names, related terms and sources
Also shown as proof boundaries
Source refs standard std_microcosm (source_authority)
proof_boundary · public projection Generated from the governed public vocabulary for Plectis.
proof checker General or domain usage A proof checker verifies that a supplied formal proof obeys a logical system's rules and establishes the claimed statement.
It is concerned with checking the proof object , which may have been constructed by a person, tactic , search procedure, or other software . The rules and accepted assumptions determine the result's logical basis .
A correct checker can still accept a proof of a statement that was translated incorrectly from an informal problem. Reviewing that translation and explaining the theorem 's significance remain mathematical tasks outside the checking operation.
Example The Lean kernel checks the corpus declarations and rejects any proof term that does not type-check .
Reader rule Proof search and proof checking are different tasks.
Other names, related terms and sources
Also shown as proof-checking kernel, proof kernel, proof verifier, formal proof verifier
Search handles kernel checker
proof_checker · public projection Generated from the governed public vocabulary for Plectis.
proof term General or domain usage A proof term is a formal expression whose type represents the proposition it proves.
In propositions -as-types systems, a term of type P supplies a derivation of P. It can be written directly or generated by automation, and it may refer to earlier theorems , hypotheses, definitions, and axioms .
The local methodology separates constructing the expression from Lean accepting it in a pinned environment . A tactic transcript describes how the term was found; the checked term is the object on which the formal inference claim rests.
Other names, related terms and sources
Also shown as proof terms, proof object, proof objects
Source refs sites/microcosm/maths/documents/methodology.html (local_reader_surface)
proof_term · mathematical concept Generated from the governed public vocabulary for Plectis.
proper map General or domain usage A continuous map for which the preimage of every compact set is compact .
A nonconstant complex polynomial is proper as a map ℂ → ℂ C → C : inputs escaping to infinity have outputs escaping to infinity. The exponential is not proper, because infinitely many points 2 𝜋 𝑖 𝑛 2 π i n map to the single output 1.
In the #1041 square-root construction, properness rules out loss of inverse points at the boundary. Together with local biholomorphic behaviour it gives a finite covering. Since the target is simply connected and the source connected, that covering has one sheet, yielding a global holomorphic inverse.
Meaning scope General or domain usage. The compact -preimage definition is used in the locally compact Hausdorff setting of complex domains; properness alone gives no injectivity or metric estimate.
Scope Proper does not mean one-to-one . The map 𝑧 ↦ 𝑧 2 z ↦ z 2 is proper but has two preimages for most outputs and a branch point at zero. Specify the domain and target, since restricting either can change properness.
Other names, related terms and sources
Also shown as proper mapping, proper holomorphic map
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::sec:separation (mathematical_source)
proper_map · mathematical concept Generated from the governed public vocabulary for Plectis.
proposition General or domain usage A proposition is a statement that can be asserted or denied once its terms and parameters are specified.
For example, “n is prime ” becomes a particular proposition when n is fixed. In Lean , propositions have proofs as their inhabitants; constructing an appropriate proof establishes the proposition in the formal system.
Papers also use “Proposition” as a label for a proved result, often between a lemma and a theorem in presentation. The label describes its expository role rather than a different logical standard .
Example “Every even integer greater than 2 is the sum of two primes ” is a proposition, currently known as Goldbach's conjecture .
Scope A proposition covers the statement and assumptions as written in its source .
Not this A question or command is not a proposition because it does not assert something true or false.
Reader rule Calling a statement a proposition does not mean it has been proved.
Other names, related terms and sources
Also shown as mathematical proposition
Search handles propositions
proposition · mathematical concept Generated from the governed public vocabulary for Plectis.
propositional equality General or domain usage Propositional equality is an equality expressed as a proposition that can be proved or assumed.
An equality such as 𝑎 + 𝑏 = 𝑏 + 𝑎 a + b = b + a is a statement inside the logic, with a proof permitting substitution and rewriting. It can relate expressions that the checker does not identify merely by computation.
The #243 Lean development rewrites exact arithmetic identities to relate denominator and tail states. Those proof steps carry mathematical content beyond accepting two spellings of an expression as the same.
Other names, related terms and sources
Also shown as equality proposition, equality propositions
propositional_equality · mathematical concept Generated from the governed public vocabulary for Plectis.
protocol General or domain usage A protocol is a defined set of messages, actions, ordering rules, and outcomes for interactions among participants.
Protocols let independent participants coordinate by specifying what each may send or do, when steps are valid, and how success, refusal, retry , or failure is recognized.
A protocol turns a multi-party interaction into a repeatable exchange. A network protocol defines message formats and response rules for machines; a research or operating protocol defines steps for people and tools. Some protocols prescribe a strict sequence , while others permit several transitions from each state. Compliance means following the stated exchange, not merely reaching a similar result. A protocol can still be unsafe, incomplete, or poorly designed. Its version matters when participants evolve independently, because incompatible assumptions about fields, ordering, timeouts , or failure handling can prevent coordination.
Scope A protocol has identifiable participants and an exchange contract covering allowed actions, sequence , data format, state transitions, and exceptional outcomes.
Other names, related terms and sources
Also shown as protocols
Source refs sites/microcosm/docs/architecture.html (reading_context) sites/microcosm/docs/area-research.html (reading_context)
protocol · public projection Generated from the governed public vocabulary for Plectis.
provenance General or domain usage Provenance records where an item came from and the steps or sources that produced it.
It can identify a source repository , revision, original author, transformation, or recorded run. Plectis uses these connections to make copied and generated material traceable.
A current matching check may also be needed to show that a copy still agrees with its source . Retaining both the origin and the comparison evidence helps distinguish an authentic historical copy from an up-to-date projection .
Example A copied source body can record its originating repository , revision, and content digest , allowing a later check to compare it with that identified source .
Scope Provenance establishes origin and current agreement, not correctness.
Reader rule Provenance establishes origin and process, not correctness by itself.
Other names, related terms and sources
Also shown as provenanced
provenance · public projection Generated from the governed public vocabulary for Plectis.
provider General or domain usage A provider is a component or organization that supplies a service, resource, or capability to a consumer.
A cloud company may provide storage, while one software component may provide data to another. Provider describes the role in that interaction, not a permanent type of organization or program .
Providers may supply compute, models , identity, data, payment processing, storage, or local library functions . The same system can consume one service and provide another. Availability of a provider does not guarantee a particular answer, response time, capacity, price, or continued contract . Those properties belong to separate service terms and observed behavior. When results depend on an external provider, the interface version, request conditions, returned evidence , and failure modes determine what can be reproduced or independently checked .
Scope The provider role is defined by what is supplied, to whom, through which interface , and under which availability, authorization , or usage conditions.
Other names, related terms and sources
Also shown as providers, service provider
Source refs sites/microcosm/docs/components.html (reading_context) sites/microcosm/docs/reference.html (reading_context)
provider · public projection Generated from the governed public vocabulary for Plectis.
pull request General or domain usage A pull request proposes merging a set of repository changes and provides a place to review them.
It identifies source and target branches, displays their difference, carries discussion and automated checks , and records a merge or closure decision. Its displayed diff can change as the source branch changes. A pull request is a review and integration object, not the underlying commits themselves.
A pull request is a repository -hosting review object proposing that one branch or set of commits be integrated into another. It presents a comparison, discussion, automated checks , review decisions, and eventual merge or closure status. Because contributors can update the source branch, the displayed diff and tested head may change during review; approvals may become stale under project policy. The request is not itself a commit , branch, release , or deployment . Reliable references identify the reviewed revision, target, and whether the proposed content was ultimately merged.
Example A pull request adds a Lean proof of one open obligation and updates the claim record that names it.
Reader rule Approval or green checks cover the reviewed state and declared policies; they do not guarantee correctness or mean the proposal has been merged or deployed .
Other names, related terms and sources
Also shown as pull requests
pull_request · public projection Generated from the governed public vocabulary for Plectis.
pytest Externally anchored pytest is a framework for writing and running automated tests in Python.
Scope pytest is external open-source software and is not part of this work.
Reader rule A passing run concerns the selected tests in the environment and source version used.
Other names, related terms and sources
Also shown as py.test
pytest · public projection Generated from the governed public vocabulary for Plectis.
Q
q-Pochhammer symbol General or domain usage The q-Pochhammer symbol is a compact notation for a product of factors progressing by powers of q.
For a nonnegative integer n, ( 𝑎 ; 𝑞 ) 𝑛 = ∏ 𝑛 − 1 𝑘 = 0 ( 1 − 𝑎 𝑞 𝑘 ) ( a ; q ) n = ∏ k = 0 n − 1 ( 1 − a q k ) , with ( 𝑎 ; 𝑞 ) 0 = 1 ( a ; q ) 0 = 1 . For example, ( 𝑞 ; 𝑞 ) 3 = ( 1 − 𝑞 ) ( 1 − 𝑞 2 ) ( 1 − 𝑞 3 ) ( q ; q ) 3 = ( 1 − q ) ( 1 − q 2 ) ( 1 − q 3 ) .
The #1049 moment weights use ( 𝑞 ; 𝑞 ) 𝑛 ( q ; q ) n and 𝑃 = ( 𝑞 ; 𝑞 ) ∞ P = ( q ; q ) ∞ with 0 < 𝑞 < 1 0 < q < 1 . Here P is positive: the factors are positive and ∑ 𝑞 𝑘 ∑ q k converges . The notation compresses exact cancellation identities between finite and infinite products ; it is not the ordinary factorial 𝑛 ! n ! .
Other names, related terms and sources
Also shown as q-shifted factorial, q-Pochhammer symbols
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::sec:weights (mathematical_source)
q_pochhammer_symbol · mathematical concept Generated from the governed public vocabulary for Plectis.
quadratic field extension General or domain usage A quadratic field extension has dimension two over its base field.
When the base field has characteristic different from two, adjoining √ 𝑎 a for a nonsquare a gives a quadratic extension. Each element has the form 𝑢 + 𝑣 √ 𝑎 u + v a , and the nontrivial automorphism changes √ 𝑎 a to − √ 𝑎 − a .
The #243 proof assumes 𝛼 2 − 1 α 2 − 1 is a nonsquare in its cubic number field K and studies 𝐾 ( 𝛽 ) K ( β ) , where 𝛽 2 = 𝛼 2 − 1 β 2 = α 2 − 1 . The sign-changing automorphism fixes 𝛼 α but moves 𝛽 β . After passing to a Galois closure , that distinction is used to choose primes with incompatible residue behavior.
Scope If a is already a square, adjoining its square root gives no degree-two extension. The square-root description needs modification in characteristic two.
Other names, related terms and sources
Also shown as quadratic extension, quadratic extensions
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-field (mathematical_source)
quadratic_extension · mathematical concept Generated from the governed public vocabulary for Plectis.
quadratic residue General or domain usage A quadratic residue modulo an integer is a residue class represented by a square; number theory often reserves the term for nonzero square classes.
Modulo an odd prime p, a nonzero a is a quadratic residue when 𝑥 2 ≡ 𝑎 ( m o d 𝑝 ) x 2 ≡ a ( mod p ) has a solution. Exactly half of the nonzero classes are squares.
The #243 all-root condition requires 𝑟 2 − 1 r 2 − 1 to belong to ( 𝔽 × ℓ ) 2 ( F ℓ × ) 2 , so it must be both nonzero and a square. The proof excludes characteristic two and finitely many other bad primes before applying this condition. Merely producing a square root in a larger residue field would not satisfy it.
Scope Zero is always a square but is treated separately in the Legendre symbol and in conditions requiring nonzero squares. Squareness also depends on the field: passing to an extension can change it.
Other names, related terms and sources
Also shown as quadratic residues, square residue
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::eq:all-root-square (mathematical_source)
quadratic_residue · mathematical concept Generated from the governed public vocabulary for Plectis.
queryable General or domain usage Information is queryable when a reader or program can retrieve relevant items by asking a structured question or searching.
Plectis uses identifiers , fields, indexes , and relationships so material can be found without already knowing its exact file path. A query may return a summary with a route to fuller evidence .
No result can mean “not present in this indexed collection” rather than “does not exist”. Source routes and clear coverage help a reader decide when a broader search is needed.
Example Typing circuit-break into site search should open the circuit-break card.
Scope Names retrievability by search or question. It does not name correctness or completeness of the retrieved record .
Not this A private note that only the author can find is not queryable on the public site.
Reader rule The query's coverage and matching rules affect what its results mean.
Other names, related terms and sources
Also shown as queryable microscope, queryable row
queryable · public projection Generated from the governed public vocabulary for Plectis.
queue General or domain usage A queue is a collection of waiting items managed for later processing under stated ordering and delivery rules.
A print queue holds jobs until a printer can handle them. Software queues may prioritize urgent work, delay scheduled items, distribute jobs among workers, or redeliver an item after failed acknowledgement.
A queue need not be first-in, first-out. Priority, fairness, deadlines, partitioning, dependencies , and worker availability may change which item runs next. Queues absorb bursts and coordinate concurrent workers, but they can also accumulate delay or hide stalled work. At-most-once delivery may lose an item; at-least-once delivery may duplicate processing; exactly-once effects usually require additional transactional or idempotent design. Queue length alone does not show throughput , age of work, blocking dependencies , or successful completion.
Scope Queue behavior depends on ordering, capacity, ownership, acknowledgement, delivery guarantees, retry policy, and how completed or abandoned items are removed.
Other names, related terms and sources
Also shown as queues, queued
Source refs sites/microcosm/docs/components.html (reading_context) sites/microcosm/docs/rules-and-ideas.html (reading_context)
queue · public projection Generated from the governed public vocabulary for Plectis.
quickstart General or domain usage A quickstart gives the shortest supported sequence of steps to obtain a first useful result.
For a repository , that usually means getting the source , installing the declared dependencies , running an example or check , and inspecting its output. It should state any prerequisites needed for those steps.
A good quickstart leads onward to the explanation and reference material needed for further work. Its commands should be tested from a clean environment so hidden local setup does not become the reader 's problem.
Example The quickstart lists the dependencies and the exact commands, and ends at a result file .
Reader rule The example establishes an initial working route, not mastery of the whole project.
Other names, related terms and sources
Also shown as quick start
quickstart · public projection Generated from the governed public vocabulary for Plectis.
quotient ring General or domain usage For an ideal I in a ring R, the quotient ring R/I treats two elements as equal when their difference lies in I.
Z/(5) has five congruence classes and arithmetic modulo 5. The ideal condition ensures addition and multiplication of classes are well defined, independent of which representative is chosen.
Residue constructions begin with 𝑅 / 𝑝 R / p . When p is maximal that quotient is already the residue field ; otherwise it must be enlarged to its field of fractions .
Example Z/(5) has five congruence classes and arithmetic modulo 5.
Meaning scope General or domain usage. A quotient ring identifies elements whose difference lies in an ideal. It is not numerical division.
Scope The quotient is a field exactly when I is maximal, and it is an integral domain exactly when I is prime , for a commutative ring with 1 and proper I. A quotient ring is not a numerical division operation.
Other names, related terms and sources
Also shown as factor ring
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 287 (prerequisite_dependency)
quotient_ring · mathematical concept Generated from the governed public vocabulary for Plectis.
R
radius of convergence General or domain usage The radius of the disc inside which a power series converges , with divergence outside that disc.
For ∑ 𝑎 𝑛 ( 𝑧 − 𝑧 0 ) 𝑛 ∑ a n ( z − z 0 ) n , the Cauchy–Hadamard formula is 𝑅 = 1 / l i m s u p | 𝑎 𝑛 | 1 / 𝑛 R = 1 / lim sup | a n | 1 / n , with the conventions 𝑅 = ∞ R = ∞ when the limsup is zero and 𝑅 = 0 R = 0 when it is infinite . Convergence at points on the boundary must be examined separately.
In #1049 the coefficient -moment series has radius zero for every 𝑝 ≥ 1 p ≥ 1 because the moments grow faster than any fixed exponential. The associated continued-fraction identity is therefore read formally; this alone does not decide continued-fraction convergence at individual nonzero inputs.
Other names, related terms and sources
Also shown as convergence radius
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2957 (mathematical_source)
radius_of_convergence · mathematical concept Generated from the governed public vocabulary for Plectis.
radix General or domain usage Radix is another word for the base of a positional numeral system.
Decimal has radix ten and binary has radix two. In radix b, successive places have weights that are powers of b; the radix point separates whole-number places from fractional places.
For integer bases greater than one, rational numbers have eventually periodic expansions. The value is independent of its chosen radix, although its digits and period can change substantially when written in another base.
Example In radix two the digits are 0 and 1.
Scope Radix and base are used interchangeably for numeral expansions here.
Reader rule The familiar decimal point is the radix point in base ten.
Other names, related terms and sources
Also shown as radices
radix · public projection Generated from the governed public vocabulary for Plectis.
ramification index General or domain usage If a prime ideal p factors upstairs as 𝑝 𝑂 𝐿 = ∏ 𝑃 𝑒 𝑖 𝑖 p O L = ∏ P i e i , the exponent 𝑒 𝑖 e i is the ramification index of 𝑃 𝑖 P i over p.
An index 𝑒 𝑖 > 1 e i > 1 means the upstairs prime occurs repeatedly in the ideal factorization . In 𝑄 ( 𝑖 ) Q ( i ) , the rational prime 2 ramifies with exponent 2 at the prime generated by 1 + 𝑖 1 + i , while odd primes have index one wherever they lie above.
The paper excludes ramified primes so Frobenius is defined cleanly on the residue extension. Ramification indices give the exact multiplicity condition behind that exclusion.
Example An index 𝑒 𝑖 > 1 e i > 1 means the upstairs prime occurs repeatedly in the ideal factorization .
Meaning scope General or domain usage. The index belongs to a specified prime above a base prime . Index one does not imply there is only one prime above that base prime .
Scope The index belongs to a chosen upstairs prime 𝑃 𝑖 P i over a chosen base prime p. “Unramified at p” means all these indices equal one; it does not mean that p has only one prime above it.
Other names, related terms and sources
Also shown as ramification indices
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 283 (prerequisite_dependency)
ramification_index · mathematical concept Generated from the governed public vocabulary for Plectis.
ramification point General or domain usage A ramification point of a holomorphic map is a point where the map has local degree greater than one, equivalently where its derivative vanishes in a local coordinate.
The map 𝑧 ↦ 𝑧 2 z ↦ z 2 ramifies at 0: nearby nonzero target values each have two preimages , but the two sheets meet at the origin. The source point 0 is the ramification point, while its image 0 is the corresponding branch value. Away from the origin the map is locally one-to-one .
The paper studies a projection from an algebraic curve. Excluding ramification over a disc makes the projection an unramified finite cover , which is what permits separate analytic inverse branches .
Example The map 𝑧 ↦ 𝑧 2 z ↦ z 2 ramifies at 0: nearby nonzero values have two preimages , but both sheets meet at the origin.
Meaning scope General or domain usage. A ramification point belongs to the source of a map ; its image is usually called a branch value. Some texts use different conventions.
Scope A ramification point lies in the source , while a branch point or branch value often names its image in the target; terminology varies, so the page should state its convention. Multiplicity determines the local degree.
Other names, related terms and sources
Also shown as ramified point
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 962 (mathematical_source)
ramification_point · mathematical concept Generated from the governed public vocabulary for Plectis.
random variable General or domain usage A random variable is a measurable function from a probability space to numerical or other measurable values.
It assigns a value to each outcome. Probabilities for its values come from the underlying measure: the event 𝑋 ≤ 𝑡 X ≤ t consists of outcomes where that inequality holds. The function is deterministic once the outcome is fixed.
In the #257 finite -residue averaging argument, a cutoff divisor sum is a random variable when its residue input is chosen uniformly. Its expected value is the period average; taking an infinite cutoff requires additional convergence or integrability reasoning.
Meaning scope General or domain usage. The measurable-function meaning is intended, with real-valued variables as the main example. A random draw is one realized value, and a distribution is the law induced by the function .
Scope Distinguish the random variable from its probability distribution . Different functions , even on different spaces, can have the same distribution.
Other names, related terms and sources
Also shown as random variables
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos257-mersenne-reasoning-surface.tex (local_manuscript)
random_variable · mathematical concept Generated from the governed public vocabulary for Plectis.
rank of a matrix General or domain usage The dimension of the space spanned by a matrix 's rows or columns.
A matrix with at least one nonzero column and every column proportional to it has rank one. The 𝑛 × 𝑛 n × n identity matrix has rank n. Rank counts independent directions retained by the corresponding linear map .
Evaluation matrices turn arithmetic functions into finite linear-algebra objects. Proving large rank shows many channels are independent; it does not by itself establish irrationality of an infinite sum , which requires a separate analytic or denominator bridge .
Meaning scope General or domain usage. Linear algebra. Distinct from an ordering rank or position in a list.
Scope Row rank equals column rank. A nonzero 𝑘 × 𝑘 k × k minor proves rank at least k, while all minors of order 𝑘 + 1 k + 1 vanishing proves rank at most k. The rank cannot exceed either matrix dimension .
Other names, related terms and sources
Also shown as matrix rank, linear rank
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::line 103 (mathematical_source)
rank_of_matrix · mathematical concept Generated from the governed public vocabulary for Plectis.
rate limit General or domain usage A rate limit restricts how many operations an actor or system may perform within a stated period.
Services use rate limits to protect capacity, control cost, reduce abuse, or allocate shared resources. Limits may apply by account, key, address, endpoint , or operation.
Rate limits are commonly expressed as requests or tokens per second, minute, or billing window. A response may state when capacity becomes available again. Clients often use bounded exponential backoff with jitter , while preserving deadlines and error visibility. Plectis provider routing treats rate limits as an operational condition across model services. A rate limit is not evidence that a request or result is invalid.
Example An API permits 100 requests per minute per credential and returns a retry time when exceeded.
Meaning scope General or domain usage. A rate limit constrains requests or resource use over a specified interval or quota window. It is distinct from a mathematical limit .
Scope When a rate limit is reached, respect the server ’s retry guidance and avoid synchronized or unlimited retries .
Not this A mathematical convergence limit is unrelated to request rate limiting.
Other names, related terms and sources
Also shown as rate limits, request limit
Source refs sites/microcosm/docs/paper-module-engine-room-annex-knowledge-router.html (reading_context)
rate_limit · public projection Generated from the governed public vocabulary for Plectis.
rational General or domain usage A rational number is a number equal to 𝑎 / 𝑏 a / b for integers a and nonzero b.
Examples include 3 / 4 3 / 4 , − 2 − 2 , and 0. Fractions differing by a common nonzero factor can represent the same rational number; a positive denominator and lowest terms provide a standard representation.
An infinite series of rational terms can have a rational or irrational sum . The type of each term alone does not determine the type of the limit .
Example Rationality of the series forces an exact recurrence in the long division, which is where several of the constraints here come from.
Scope Covers numbers expressible as ratios of integers and rationality questions about values such as infinite sums.
Reader rule In any integer base greater than one, rational numbers have terminating or eventually repeating digit expansions.
Other names, related terms and sources
Also shown as rational number, rationality
rational · public projection Generated from the governed public vocabulary for Plectis.
rational approximation General or domain usage Rational approximation studies how closely fractions can approach a number, especially in relation to their denominators .
For example, 2 2 / 7 22 / 7 approximates 𝜋 π with a small error, but the denominator 7 matters when comparing its quality with other approximations. A useful estimate states both the error and how it depends on q in 𝑝 / 𝑞 p / q .
Arguments in these papers combine structured approximations with denominator restrictions or tail bounds . The theorem must explain why their combined behaviour cannot occur if the target number is rational .
Scope A small decimal error alone does not establish irrationality .
Other names, related terms and sources
Also shown as rational approximant, approximation by rationals
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 1 (mathematical_source)
rational_approximation · mathematical concept Generated from the governed public vocabulary for Plectis.
rational function General or domain usage A rational function over a field is a quotient of two polynomials over that field, with a nonzero denominator polynomial .
Scope This describes the whole function , rather than whether one of its values is rational . Numerical evaluation also requires a denominator that is nonzero after cancellation.
Other names, related terms and sources
Also shown as rational functions
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 4812 (mathematical_source)
rational_function · mathematical concept Generated from the governed public vocabulary for Plectis.
rational independence General or domain usage Numbers are rationally independent if no rational linear combination equals zero except the one with all coefficients zero.
Clearing denominators gives the equivalent test using integer coefficients . The numbers 1 and √ 2 2 pass it. Three numbers can fail even if every pair has an irrational ratio: 1, √ 2 2 and 1 + √ 2 1 + 2 have the relation 1 + √ 2 − ( 1 + √ 2 ) = 0 1 + 2 − ( 1 + 2 ) = 0 .
The running-LCM paper works in the actual orbit closure of its logarithmic flow. It proves the pairwise independence needed for the two-wall argument without assuming that all frequencies are independent. A proof about two coordinates therefore need not establish density in the entire higher-dimensional torus.
Meaning scope General or domain usage. Specify the exact family: pairwise irrational ratios, full rational independence, and independence after adjoining 1 are different conditions.
Scope For a continuous linear flow on a torus , the frequencies must be rationally independent for a dense orbit in the whole torus. For the sampled translation 𝑛 𝛼 n α , the required family includes 1 as well as all coordinates of 𝛼 α .
Other names, related terms and sources
Also shown as linearly independent over the rationals, Q-linear independence
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::long269:sec:flow (mathematical_source)
rational_independence · mathematical concept Generated from the governed public vocabulary for Plectis.
rational subspace General or domain usage A real linear subspace that has a basis consisting of vectors with rational coordinates.
In ℝ 𝑑 R d , clearing basis denominators makes this equivalent to being spanned by integer vectors. For example the line spanned by ( 1 , 2 ) ( 1 , 2 ) is rational , whereas the line spanned by ( 1 , √ 2 ) ( 1 , 2 ) is not. Real multiples in a rational subspace need not themselves have rational coordinates.
In #269 the smallest rational subspace containing the logarithmic-flow velocity determines its orbit closure . A rational two-dimensional plane inside it is chosen so that every pair of relevant coordinate forms remains independent, enabling the finite wall-arrangement count.
Meaning scope General or domain usage. Rational means defined relative to the standard rational coordinate structure, not that every point of the real subspace is rational .
Scope The ambient coordinate lattice is part of the meaning. A rational subspace projects to a closed connected subtorus of ℝ 𝑑 / ℤ 𝑑 R d / Z d ; an irrationally directed line can instead have a larger dense closure.
Other names, related terms and sources
Also shown as rational linear subspace, rational plane
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::line 805 (mathematical_source)
rational_subspace · mathematical concept Generated from the governed public vocabulary for Plectis.
raw seed System-coined term Raw seed is Plectis's preserved, append-only record of the operator's original words and developing ideas.
operator voice authority layer
Later summaries, interpretations, and rules can refer back to it, while the original material remains available for checking intent and context. Corrections or changes of mind are preserved as further input rather than silently replacing the earlier record .
Raw seed is authoritative about what the operator said. Claims about software behaviour, mathematics , or external facts still require the appropriate implementation or factual evidence rather than authority from a quotation alone.
Example The Voice To Doctrine Self Improvement Loop is one place the raw seed is visible in use: it takes recorded operator voice as its input and turns it into structured doctrine , so the seed is the raw material entering one end of that loop. See it live: Voice To Doctrine Self Improvement Loop open the component that turns recorded operator voice into doctrine
Meaning scope System-coined term. Raw seed means the preserved operator-voice substrate in this repository . It is not raw data, model -training data, a random seed, or public evidence by default.
Scope The raw seed covers the operator-voice source material that the system's doctrine , principles , and components are generated from. A reader meets it on the pages that show how recorded voice becomes structured doctrine , and in references back to source provenance .
Not this A raw seed is not a polished mission statement, a marketing narrative, or the system's final doctrine . It is the unedited source voice that those later, tidier layers are derived from.
Reader rule Agent -authored synthesis belongs in a separate attributed record .
Other names, related terms and sources
Also shown as raw_seed, operator voice, Will voice
Search handles voice authority
raw_seed · substrate Generated from the governed public vocabulary for Plectis.
reader General or domain usage A reader is the person or software consuming a document or other published material.
The reader may be new to the subject, seeking one fact, reviewing a proof , or preparing to run a check . Different purposes call for different amounts of context and detail.
Defining specialist terms helps a non-specialist proceed without interrupting an expert. The surrounding explanation should still be understandable enough that a glossary is optional support rather than a prerequisite for every sentence.
Example The glossary gives a cold reader a one-sentence definition before deeper context.
Scope Reader covers the audience named by a page, packet , or route contract .
Not this The author of a page is not automatically its intended reader.
Reader rule Plectis's summaries and source routes should make those different reading paths possible.
Other names, related terms and sources
Also shown as human reader
Search handles readers, cold reader
reader · public projection Generated from the governed public vocabulary for Plectis.
reader packet System-coined term A reader packet gathers selected explanations, links, source references , and scope information for someone examining the project.
portable inspection guide
It can be downloaded or supplied to an assistant as a portable starting point. The selection helps the reader orient and identify which original material deserves closer attention.
Its version matters when the project changes. A useful packet preserves routes to current source and evidence while identifying which summaries or copied contents belong to the packet 's own snapshot .
Example The Cold-Reader Route Map is a reader packet : a single artifact that lays out the first routes a newcomer should follow into the public slice and links each one back to its source . See it live: Cold Reader Route Map open the packet that routes a first-time reader into the source
Reader rule The packet is a generated guide with declared coverage , not a replacement for all its sources .
Other names, related terms and sources
Also shown as reader digest, review packet
Search handles AI handoff, copy packet, orientation packet
Source refs sites/microcosm/microcosm-ai-reader-digest.json (generated_reader_digest) sites/microcosm/microcosm-review-packet.json (generated_review_packet)
reader_packet · artifact Generated from the governed public vocabulary for Plectis.
readiness General or domain usage Readiness is the condition of meeting the stated requirements for a particular next action or operating stage.
A readiness decision compares current state with a declared gate for testing, review, publication, deployment , or operation. Evidence supports the decision, but the evidence itself is not readiness and one stage does not imply another.
Readiness describes whether an artifact , service, or process currently satisfies the conditions for a specified next step. A test-ready change may need required files and a working build; publication readiness may add source checks and review; production readiness may require operational capacity, rollback , security, and monitoring. Test reports, approvals, freshness records , and health signals are evidence used to judge those conditions, rather than readiness itself. Because gates differ, passing an earlier one cannot silently confer a stronger status. A readiness result also becomes stale when dependencies , requirements, or the evaluated artifact change.
Scope Readiness is relative to a named action and its required conditions; it holds when those conditions are satisfied, and it ends when a requirement fails or the target conditions change.
Other names, related terms and sources
Also shown as ready, readiness check
Source refs sites/microcosm/docs/reference.html (reading_context) sites/microcosm/docs/paper-modules.html (reading_context)
readiness · public projection Generated from the governed public vocabulary for Plectis.
real number General or domain usage A real number is a point on the real number line, including rational and irrational values.
Integers , fractions , √ 2 2 , and 𝜋 π are examples. The real numbers provide a setting for limits , lengths, and continuous quantities; they are commonly denoted by ℝ R .
In a paper , a real-valued series can converge without its sum being rational . Establishing the existence of the sum and classifying that value are separate questions.
Example The binary totient series has a real value; the Erdős question asks whether that real number is irrational .
Reader rule Real does not mean that a number has a finite decimal representation or can be computed exactly by a program .
Other names, related terms and sources
Also shown as the reals
Search handles real numbers, real-valued
real_number · mathematical concept Generated from the governed public vocabulary for Plectis.
receipt System-local specialization A receipt is a saved record of an action, its inputs, and its reported outcome.
Meaning scope System-local specialization. This software use specializes an ordinary acknowledgement or record of an event. How much a receipt establishes depends on its producer and evidence contract .
Scope Evidence applies to the named action and conditions, with missing proof identified by the receipt contract .
Reader rule Check the producer , recorded version, covered action, and supporting fields before treating the reported outcome as established.
Other names, related terms and sources
Also shown as receipts
Source refs standard std_operator_action_receipt (standard)
receipt · public projection Generated from the governed public vocabulary for Plectis.
reciprocal General or domain usage The reciprocal of a nonzero number x is 1/x.
Scope A reciprocal-sum result covers the growth condition it assumes.
Reader rule Zero has no reciprocal in the real or rational numbers .
Other names, related terms and sources
Also shown as reciprocals
reciprocal · public projection Generated from the governed public vocabulary for Plectis.
reciprocal polynomial General or domain usage The reciprocal of a degree-d polynomial 𝑝 ( 𝑇 ) p ( T ) reverses its coefficients and is written 𝑇 𝑑 𝑝 ( 𝑇 − 1 ) T d p ( T − 1 ) .
For 𝑝 ( 𝑇 ) = 𝑇 3 + 𝑏 𝑇 2 + 𝑑 𝑇 + 𝑤 p ( T ) = T 3 + b T 2 + d T + w , its reciprocal is 𝑤 𝑇 3 + 𝑑 𝑇 2 + 𝑏 𝑇 + 1 w T 3 + d T 2 + b T + 1 . When w is nonzero, its roots are the reciprocals of the roots of p.
In #243, z is nonzero and its monic minimal polynomial has constant term 𝑤 ≠ 0 w ≠ 0 . Dividing the reversed polynomial by w gives the monic polynomial 𝑇 3 + ( 𝑑 / 𝑤 ) 𝑇 2 + ( 𝑏 / 𝑤 ) 𝑇 + 1 / 𝑤 T 3 + ( d / w ) T 2 + ( b / w ) T + 1 / w for 𝑧 − 1 z − 1 . This normalization matters in the ensuing trace identities.
Other names, related terms and sources
Also shown as polynomial reciprocal, reversed polynomial
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-trace (mathematical_source)
reciprocal_polynomial · mathematical concept Generated from the governed public vocabulary for Plectis.
reciprocal series General or domain usage A reciprocal series is a sum whose terms have the form 1 / 𝑎 𝑛 1 / a n for specified nonzero numbers 𝑎 𝑛 a n .
Other names, related terms and sources
Also shown as sum of reciprocals, reciprocal sum
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::line 1 (mathematical_source)
reciprocal_series · mathematical concept Generated from the governed public vocabulary for Plectis.
reciprocal-summable support General or domain usage A positive-integer support is reciprocal-summable when the sum of the reciprocals of its elements is finite .
Scope This condition concerns ∑ 𝑎 ∈ 𝐴 1 / 𝑎 ∑ a ∈ A 1 / a . It is different from convergence of ∑ 𝑎 ∈ 𝐴 1 / ( 𝑏 𝑎 − 1 ) ∑ a ∈ A 1 / ( b a − 1 ) , which holds for every positive-integer support at integer 𝑏 ≥ 2 b ≥ 2 .
Other names, related terms and sources
Also shown as reciprocal-summable, reciprocal summability, finite reciprocal sum
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
reciprocal_summable_support · mathematical concept Generated from the governed public vocabulary for Plectis.
record System-local specialization A record is stored information about an object, event, decision, or result.
inspectable artifact row
Meaning scope System-local specialization. Record means a governed stored result or receipt in this system. It does not by itself carry legal-record status, evidentiary sufficiency, or truth authority .
Scope The term covers concrete source and generated artifacts across the site: result rows, receipts , generated JSON outputs, review packets , ledgers, and verification entries . A reader meets records wherever a page links out to something inspectable rather than describing it in prose.
Not this Recording an assertion preserves it for inspection ; the act of recording does not make the assertion true.
Reader rule Different records have different authority and evidence roles.
Other names, related terms and sources
Also shown as generated record, audit record
Source refs sites/microcosm/content-graph.json (generated_public_record_index) tool build_microcosm_public_site (public_projection_builder)
record · artifact Generated from the governed public vocabulary for Plectis.
rectifiable curve General or domain usage A continuous curve whose length, defined by total variation over partitions, is finite .
Rectifiability does not require a smooth parametrization: a polygonal path with corners is rectifiable. A continuous curve can instead have infinite length, even when its image lies in a bounded region. Length is computed with the specified ambient metric .
The #1041 connector results seek rectifiable paths with a numerical length bound inside a strict polynomial sublevel set . Rectifiability makes such a bound meaningful; merely exhibiting a continuous topological connection does not establish finite or sufficiently small length.
Meaning scope General or domain usage. The path sense is used here; rectifiability of a subset or measure is a different definition that needs separate hypotheses.
Scope For a continuously differentiable curve, length is the integral of the speed. A rectifiable path admits an arc-length description after accounting for constant portions, but finite length alone does not imply a nonzero tangent at every point.
Other names, related terms and sources
Also shown as rectifiable path, rectifiable curves
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 638 (mathematical_source)
rectifiable_curve · mathematical concept Generated from the governed public vocabulary for Plectis.
recurrence General or domain usage A recurrence defines terms of a sequence through a relation involving other terms, usually earlier ones.
Scope A recurrence result covers the sequence it is stated for.
Reader rule The initial conditions are part of the definition.
Other names, related terms and sources
Also shown as recurrence relation
recurrence · public projection Generated from the governed public vocabulary for Plectis.
recursion General or domain usage Recursion defines or computes an object through smaller or earlier instances of the same construction.
A recursive definition specifies base cases and rules for subsequent cases. For example, a count after 𝑛 + 1 n + 1 steps can be obtained from the count after n and the contribution of the new step.
The #243 source defines strictGrowthCount recursively: zero steps contribute zero, and each successor adds one when a strict increase occurs. Lean checks the recursive construction, while later theorems reason about its values.
Meaning scope General or domain usage. The mathematical and programming meaning is intended. The row distinguishes a recursive construction from a recurrence relation , repeated workflow execution , or an unsupported self-reference .
Scope A recursive definition admitted as a total function in a proof system needs a termination justification. General programming languages also allow partial recursive programs that may never return; a mathematical recurrence need not specify an executable program .
Other names, related terms and sources
Also shown as recursive definition, recursive definitions, structural recursion
recursion · mathematical concept Generated from the governed public vocabulary for Plectis.
reduction General or domain usage A reduction shows how solving one problem would allow another problem to be solved.
If the target is P and the proposed replacement is Q, proving 𝑄 → 𝑃 Q → P gives a route from a solution of Q to a solution of P. It can reveal a useful sufficient condition.
The replacement may be harder, stronger, or even impossible under its own conditions. The papers should state the direction and any reverse implication before treating a reduction as the same unresolved problem.
Example Clearing denominators reduces Erdős #243 to rigidity of an integer error orbit .
Scope Mathematical reduction between statements. Not a reduction in size, cost, or scope .
Reader rule That direction alone does not show that P and Q are equivalent.
Other names, related terms and sources
Also shown as reductions, reduce to
reduction · public projection Generated from the governed public vocabulary for Plectis.
Reeb graph General or domain usage The Reeb graph of a suitably regular function records how connected pieces of its level sets join and split, by collapsing each piece to a point.
For a height function on a sphere, every level circle collapses to a point and the Reeb graph is an interval. On a torus, splitting and merging level components produce a graph with a loop.
Two points are identified when they lie in the same connected component of one level set . This quotient is a graph for the well-behaved functions considered in the usual Reeb-graph setting; arbitrary functions can have more complicated quotients. The paper uses a Reeb-style picture to organize polynomial level components and their attachments. The graph describes connections; separate estimates are needed to control lengths of paths realizing them.
Example For a height function on a sphere, every level circle collapses to a point and the Reeb graph is an interval.
Meaning scope General or domain usage. The quotient records connected components of level sets . It is a graph under suitable hypotheses and does not retain metric lengths or canonical paths.
Scope The construction depends on both the space and the chosen function . It records how level-set components merge or split, while discarding their internal geometry; it therefore cannot by itself provide metric lengths or canonical paths.
Sources
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 265 (mathematical_source)
reeb_graph · mathematical concept Generated from the governed public vocabulary for Plectis.
reference General or domain usage A reference identifies another source , object, or location relevant to the current material.
Scope A reference covers the destination and relationship declared by the referring artifact .
Not this Mentioning a source without enough detail to locate it is not a reliable reference.
Reader rule A useful reference identifies both the destination and why it is relevant.
Other names, related terms and sources
Also shown as cross-reference
Search handles references, citation pointer
reference · public projection Generated from the governed public vocabulary for Plectis.
reformulation General or domain usage A reformulation expresses a question or statement in a different way, ideally making a useful aspect of its structure clearer.
When two formulations are claimed to be equivalent, a proof must show that each implies the other under the stated assumptions . A one-way relationship instead gives a sufficient or necessary condition.
The papers use reformulations to expose exact obligations and compare attempted approaches. The relationship to the original target should remain visible so a reader can tell what proving the new statement would accomplish.
Example A prime -series question can be reformulated in terms of consecutive prime gaps .
Scope A reformulation covers the two named statements and the proved direction or equivalence connecting them.
Not this A suggestive analogy or informal change of wording is not a mathematical reformulation without a proved relation.
Reader rule Changing notation or coordinates does not by itself resolve an open question.
Other names, related terms and sources
Also shown as restated problem, reformulate
Search handles reformulates
reformulation · public projection Generated from the governed public vocabulary for Plectis.
registry General or domain usage A registry is a structured collection of identified records about a particular kind of object.
It provides stable names and fields that tools can query, validate , and use to build other views. Plectis has registries for objects such as terms, components , and claims .
Registration can establish that an item has been recorded without establishing that it is complete, approved, or correct. Those statuses require explicit fields and the appropriate evidence or decision process.
Example The system vocabulary registry owns the set of glossary terms.
Scope A registry covers the record kind and version named by its schema.
Not this An informal list is not a governed registry unless it has an ownership and validation contract .
Reader rule A registry's schema and ownership rules determine what its entries mean.
Other names, related terms and sources
Also shown as governed registry
Search handles registries, source registry
registry · public projection Generated from the governed public vocabulary for Plectis.
regression General or domain usage Regression means either lost software behaviour after a change or a statistical method that models an outcome from predictor variables .
A software regression is behaviour that once worked and later broke; a regression test preserves a case that should continue working. Statistical regression estimates how an outcome varies with one or more predictors.
In software , a regression occurs when a change damages behaviour that a previous version provided. A regression test records the expected behaviour so later runs can detect its return. In statistics, regression is a family of methods for estimating or predicting a response from explanatory variables , with assumptions that depend on the chosen model . A fitted association does not alone prove causation, and a low prediction error does not validate every model assumption . The two senses share a word but describe different objects, so terms such as version, test, coefficient , predictor, and residual determine the intended meaning.
Example A regression test catches behavior lost after a code change; a statistical regression estimates how an outcome varies with predictors.
Scope Software regression and statistical regression are distinct senses. Surrounding evidence must establish which is intended.
Not this A newly discovered unsupported software case is not necessarily a regression, and a fitted statistical association does not by itself establish causation.
Reader rule Software regression requires comparison across versions, whereas statistical regression requires a fitted response-and-predictor model ; neither meaning by itself establishes the cause of an observed outcome.
Other names, related terms and sources
Also shown as behavior regression
Search handles regressed
regression · public projection Generated from the governed public vocabulary for Plectis.
regression test General or domain usage A regression test checks that previously expected software behaviour still works after a change.
A test can preserve a fixed bug’s reproducing case or another established requirement. For example, a glossary test can check that a specific phrase still opens the right definition after the matching code changes.
A useful regression test exercises an observable requirement with inputs that would reveal the relevant breakage. The expected result must be justified independently of the current implementation , or the test can merely repeat the same mistake. Regression tests often run in continuous integration . They differ from statistical regression , which estimates relationships between variables , and from a software regression , which is the defect rather than the check .
Meaning scope General or domain usage. Software testing, distinct from statistical regression and from the software defect a test is intended to detect.
Scope A passing regression test covers its tested conditions; it does not show that all prior behaviour has been preserved.
Other names, related terms and sources
Also shown as regression tests, regression testing
Source refs tool test_term_linkability (reading_context)
regression_test · public projection Generated from the governed public vocabulary for Plectis.
regular expression General or domain usage A regular expression is a pattern written in a notation for matching text.
A pattern describes permitted characters and how they may repeat or combine. For example, cat|dog matches either word, while [0-9]+ matches one or more digits. A program applies the pattern using a regular-expression engine.
A regular expression engine searches input text according to a defined syntax. Simple patterns are effective for filenames, identifiers , or line-oriented extraction. Complex patterns can become hard to review and may behave differently across engines. Plectis uses a pattern such as theorem|lemma|def to locate declaration -shaped text, then relies on stronger checks for imports and proof status. Pattern matching alone cannot establish that a declaration compiles .
Example ^term:[a-z_]+$ checks the form of a glossary object identifier .
Meaning scope General or domain usage. A formal text pattern used for matching or validation ; a match establishes textual form, not the truth of the surrounding claim .
Scope The pattern’s syntax and matching behaviour depend on the engine; a match shows that text fits the pattern, not that its meaning is correct.
Not this Matching the word “proof ” does not establish that the surrounding argument is valid.
Other names, related terms and sources
Also shown as regular expressions, regex, regex pattern
Source refs sites/microcosm/docs/paper-module-formal-math-lean-proof-witness.html (reading_context)
regular_expression · public projection Generated from the governed public vocabulary for Plectis.
regular value General or domain usage A regular value is an output for which the derivative is surjective at every preimage .
For a continuously differentiable real-valued function g, c is regular when ∇ 𝑔 ∇ g is nonzero at every point of 𝑔 − 1 ( 𝑐 ) g − 1 ( c ) . The level set is then locally a smooth hypersurface. For a holomorphic function of one variable , a value is regular when every preimage has nonzero complex derivative .
For the positive level | 𝑝 ( 𝑧 ) | = 𝑐 | p ( z ) | = c , apply the criterion to | 𝑝 | 2 | p | 2 at 𝑐 2 c 2 . Its gradient is nonzero exactly when p′ is nonzero on that level. Thus critical-value magnitudes identify the levels where the regular-curve argument can fail; the complex critical value and its magnitude are different objects.
Meaning scope General or domain usage. For general maps, regularity means a surjective derivative ; the gradient and nonzero-derivative tests are the scalar cases used here.
Scope The condition is on all preimages of the chosen value, not just one. A value with no preimages is regular by the usual convention. Smoothness of the function alone does not make every value regular.
Other names, related terms and sources
Also shown as regular level, regular levels, regular values
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::sec:constant-factor (mathematical_source)
regular_value · mathematical concept Generated from the governed public vocabulary for Plectis.
release General or domain usage A software release is an identified version or artifact set that a publisher makes available for others to use.
A release may package source , binaries, documentation, migration notes, and checksums under a version or tag. It can be available for download without being installed or deployed anywhere.
Releases can be tags, packages , container images, website bundles , mobile builds, or coordinated sets of artifacts . The publisher selects what belongs, records changes, and supplies retrieval and integrity information. A prerelease can be public while explicitly unstable. Replacing an asset under the same label weakens reproducibility unless content hashes preserve identity. Publishing a release does not show that users upgraded, production deployed it, reviewers approved it, or every environment can run it. Those are separate states with their own evidence .
Example The public Plectis release includes the site, source repositories , and listed papers .
Scope A release covers the artifacts , version, audience, and publication boundary declared by its manifest .
Not this An uncommitted local build is not a public release.
Reader rule Release status concerns publication of a named version and remains distinct from its source commit , build, deployment , announcement, support period, and external acceptance.
Other names, related terms and sources
Also shown as public release, software release
Search handles releases
release · public projection Generated from the governed public vocabulary for Plectis.
reliability General or domain usage Reliability is the degree to which something performs its stated function consistently under specified conditions over time.
For systems, reliability can concern failure rates or the probability of failure-free operation during a stated period. For measurements and judgments, it concerns consistency across repeated observations or raters. The workload, environment , duration, and definition of failure determine what a reported measure means.
Engineering reliability concerns performing the required function without failure under stated conditions. Availability instead measures whether a service is usable when needed and can include restoration after failures; repairable systems can have high availability despite frequent interruptions. Statistical reliability describes consistency among measurements, raters, or test items. Repeated outcomes need not be valid measurements of the intended target. Useful evaluation samples relevant variation, distinguishes independent from correlated failures, and records the observation period and failure conditions.
Example A service’s reliability estimate states how often it completed the required operation without failure across the observed workload and period.
Scope Reliability is relative to the stated function and conditions; measurement consistency and failure-free operation are distinct applications.
Not this One successful run does not establish reliability.
Reader rule A reliable process can consistently produce the wrong result if its specification or method is flawed, so reliability evidence must be read alongside correctness and validity evidence .
Other names, related terms and sources
Also shown as reliable, reliably, system reliability
reliability · public projection Generated from the governed public vocabulary for Plectis.
rename migration receipt System-coined term A rename migration receipt records the plan, outcome, and checks for moving or renaming stored material.
typed storage rename proof
It identifies the affected paths and the references that may need updating, together with any rollback or remaining obligations . Plectis uses it to keep a migration understandable across sessions.
A completed record should be backed by the relevant checks . Recording success alone does not guarantee that every reference was found, so the tested scope and any omissions should remain explicit.
Example The planned receipt for renaming the EPHEMERAL.md storage path, held in a blocked state because a gate precondition was not yet met, is a concrete rename migration receipt naming the outstanding condition rather than performing the rename. See it live: Proof-Derived Governed Mutation Authorization open the rule that ties a mutation to a typed proof that its gate was satisfied
Meaning scope System-coined term. A rename migration receipt records whether a governed path rename landed, was blocked, or was reverted, with its obligations and evidence ; it is not a commit message or automatic proof of success.
Scope The term covers governed renaming of storage paths across the system. Receipts live under state/semantic_naming/rename_receipts/ and follow a fixed standard ; a reader encounters the concept wherever a rename is described as governed , gated, or held.
Not this A rename migration receipt is not a commit message or an after-the-fact changelog note. It is a typed governed record that follows the rename through planned, blocked, landed, or reverted states and preserves the evidence and outstanding obligations for its current state.
Reader rule The receipt 's status distinguishes a planned or blocked change from one that completed.
Other names, related terms and sources
Also shown as rename receipt, migration receipt
Search handles storage rename receipt, rename gate receipt, rename proof, planned rename, planned blocked rename
Source refs standard std_rename_migration_receipt (standard) standard std_semantic_naming (standard) doctrine module semantic_naming_grammar (paper_module)
rename_migration_receipt · governance Generated from the governed public vocabulary for Plectis.
replay General or domain usage A replay repeats a recorded scenario to examine whether it produces the expected behaviour.
Plectis replays provide defined inputs, actions, and expected outcomes for a component or workflow. They can exercise interactions across several steps rather than only a single isolated function .
A matching result supports repeatability of that case. A replay may deliberately model only part of a live process, so its success should not be described as verification of unrepresented inputs or wider system behaviour.
Example An agent -monitor replay ships a scenario the monitor must flag and one it must not; a build where both pass is a failing build.
Scope A replay covers its recorded scenario on its committed fixtures . It makes no claim about live data or unrecorded paths.
Reader rule The scenario and environment determine what the replay covers.
Other names, related terms and sources
Also shown as replays, replayed
replay · public projection Generated from the governed public vocabulary for Plectis.
repository General or domain usage A repository stores a project's tracked files and, in Git, the history of their recorded revisions.
It can exist locally or be hosted for sharing. A working checkout exposes files for a selected revision, possibly with local edits that have not been committed .
The public links here identify source collections that readers can inspect or obtain. Reproducing a result requires the appropriate revision and setup, not just a repository with the same name.
Example The components live in one repository and the Lean proofs in another; both are public.
Scope A repository holds what was published to it. It is not a record of everything that was done.
Reader rule A repository need not be public, and a local clone may contain only part of its history or contents.
Other names, related terms and sources
Also shown as repo
Search handles repos
repository · public projection Generated from the governed public vocabulary for Plectis.
reproducible General or domain usage A result is reproducible when someone can use the stated materials and method to obtain the same relevant outcome.
Scope Reproducible applies to the declared artifact , command, inputs, environment , and comparison criterion.
Not this A run is not reproducible when it depends on unrecorded local state or inaccessible inputs.
Reader rule The reproduction claim should say which outcome is expected to agree.
Other names, related terms and sources
Also shown as reproducibility, repeatable run
Search handles reproduce, reproduced
reproducible · public projection Generated from the governed public vocabulary for Plectis.
research shift System-local specialization A research shift is a bounded period of work on a specific, inspectable mathematical task.
The project's relay workflow starts from an identified public revision, selects a question, and returns a result with the source and checks needed for review. A person may use a coding agent to carry out parts of that work.
Attribution and exact starting state make the contribution easier to assess and combine with other work. Completing the shift does not imply solving the whole problem.
Example An agent given a shift on #269 returns a Lean proof of one residue-window case together with the exact statement it does not reach.
Meaning scope System-local specialization. A shift is a bounded task with a return route. Running one does not commit the maintainer to accept the return.
Scope Covers the agent -facing contribution route in the Lean repository .
Not this A chat transcript in which an agent says it proved something is not a return; the return is the checkable object.
Reader rule The return should distinguish a proof , a failed route, an experiment, and an unresolved proposal.
Other names, related terms and sources
Also shown as frontier relay
Search handles give your agent a research shift
research_shift · public projection Generated from the governed public vocabulary for Plectis.
residue class General or domain usage A residue class modulo m consists of all integers congruent to one another modulo m.
For example, the class of 2 modulo 5 contains … , − 8 , − 3 , 2 , 7 , 1 2 , … … , − 8 , − 3 , 2 , 7 , 12 , … . Any of these integers can represent the class, while 2 is its usual least nonnegative representative.
The papers use classes to describe repeated arithmetic conditions across infinitely many integers . Proving a statement for a representative requires showing that the property is preserved for the other members of its class.
Scope The modulus is part of the class's identity.
Other names, related terms and sources
Also shown as congruence class, residue classes
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 562 (mathematical_source)
residue_class · mathematical concept Generated from the governed public vocabulary for Plectis.
residue field General or domain usage A residue field records arithmetic at a prime ideal : set the ideal’s elements to zero, then make every remaining nonzero element invertible.
For the integers and a prime number p, the ideal (p) is maximal, so the residue field is Z/(p), with p elements. More generally 𝑅 / 𝑝 R / p may only be an integral domain; passing to its field of fractions , or first localizing R at p, produces the residue field. For a number field , every nonzero prime ideal of its ring of integers is maximal and its quotient is a finite field .
At a point p of S p e c ( 𝑅 ) Spec ( R ) , localization 𝑅 𝑝 R p makes every element outside p invertible; quotienting by the unique maximal ideal 𝑝 𝑅 𝑝 p R p then gives 𝜅 ( 𝑝 ) κ ( p ) . This agrees with F r a c ( 𝑅 / 𝑝 ) Frac ( R / p ) . In the paper the chosen ideal lies above a rational prime ℓ, hence is nonzero and maximal in the ring of integers , so the simpler finite quotient description applies.
Example For the integers and a prime number p, the ideal (p) is maximal, so the residue field is Z/(p), with p elements.
Meaning scope General or domain usage. For a prime ideal p, the residue field is the field of fractions of R/p. The quotient R/p is already a field precisely when p is maximal.
Scope For a prime ideal p in a commutative ring R, 𝜅 ( 𝑝 ) = F r a c ( 𝑅 / 𝑝 ) = 𝑅 𝑝 / 𝑝 𝑅 𝑝 κ ( p ) = Frac ( R / p ) = R p / p R p . The quotient 𝑅 / 𝑝 R / p is already this field exactly when p is maximal.
Other names, related terms and sources
Also shown as field of residues
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 287 (mathematical_source)
residue_field · mathematical concept Generated from the governed public vocabulary for Plectis.
result record System-local specialization A result record stores what a particular check or run examined and what it reported.
Meaning scope System-local specialization. A result record is the durable, scoped output of one named run; it is not terminal output, the input body, or evidence for behavior beyond the recorded check .
Scope A result record establishes what its own run checked . It is not a statement about the system around it.
Reader rule A record describes that run, not every later run of the same command.
Other names, related terms and sources
Also shown as result file
Search handles validation result
Source refs standards/std_microcosm_workingness_record.json (source_authority) src/microcosm_core/runtime_shell.py (source_authority)
result_record · public projection Generated from the governed public vocabulary for Plectis.
retry General or domain usage A retry repeats an operation after failure, uncertainty, or the absence of a usable response.
Retrying can recover from a temporary network interruption or busy service, but a lost response may hide that the first attempt already succeeded, so repeating it can duplicate a charge, message, or write.
Retries are safe only when repeated attempts have acceptable effects. Read-only requests are often repeatable, while payments, messages, file creation, and increments can duplicate consequences unless they use an idempotency key or transaction . Exponential backoff and jitter reduce synchronized load, but they do not make permanent errors recoverable. A client timeout creates uncertainty rather than proof of failure. Correct retry handling records attempt identity, distinguishes transient from terminal errors, caps total effort, and reconciles results that arrive after another attempt begins.
Scope Retry behavior is determined by triggering outcomes, attempt limits , delay and backoff, idempotency , cancellation, and treatment of late or ambiguous results.
Other names, related terms and sources
Also shown as retries, retrying
Source refs sites/microcosm/docs/paper-module-annex-knowledge-routing.html (reading_context) sites/microcosm/docs/paper-module-undeclared-library-prior-classifier.html (reading_context)
retry · public projection Generated from the governed public vocabulary for Plectis.
reviewer brief System-coined term The reviewer brief is a compact generated packet for someone assessing the public work.
Meaning scope System-coined term. The reviewer brief is the small generated JSON packet the landing offers for one-turn review. It is not the full AI review packet and not the live HTML.
Scope The reviewer brief is the compact generated packet offered from the landing page for a first review pass. It is separate from the larger AI review packet and covers only the public state identified by its version.
Not this The full AI review packet is the large file, not the reviewer brief.
Reader rule The brief's version determines which public state it describes.
Other names, related terms and sources
Also shown as plectis-reviewer-brief
reviewer_brief · public projection Generated from the governed public vocabulary for Plectis.
riemann map General or domain usage A bijective holomorphic map between a simply connected proper planar domain and the unit disc .
Other names, related terms and sources
Also shown as Riemann mapping, Riemann conformal map
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 416 (mathematical_source)
riemann_map · mathematical concept Generated from the governed public vocabulary for Plectis.
Riemann–Hurwitz formula General or domain usage A formula relating the topology of a finite holomorphic map to its degree and local branching.
For a nonconstant degree-d holomorphic map 𝑓 : 𝑋 → 𝑌 f : X → Y between compact Riemann surfaces, 𝜒 ( 𝑋 ) = 𝑑 𝜒 ( 𝑌 ) − ∑ ( 𝑒 𝑥 − 1 ) χ ( X ) = d χ ( Y ) − ∑ ( e x − 1 ) , where 𝑒 𝑥 e x is the local degree at each ramification point . The same Euler-characteristic count applies to proper finite branched coverings of disc domains. Branching is counted with multiplicity.
For a regular polynomial lemniscate component containing k roots counted with multiplicity, #1041 applies the proper disc-map form to count 𝑘 − 1 k − 1 critical points , also counted with multiplicity. This determines the degree of the selected sheet construction; it gives a topological count rather than a path-length bound .
Meaning scope General or domain usage. The compact -surface formula and the proper disc-map version are intended; the latter uses finite degree, finite branching and the component ’s disc topology.
Scope The hypotheses matter: the map must have the stated finite degree and properness, and the surfaces must be in a setting where the Euler characteristics and ramification sum are defined. A local derivative calculation alone gives no global count.
Other names, related terms and sources
Also shown as Riemann-Hurwitz formula, Riemann–Hurwitz, Riemann-Hurwitz
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 393 (mathematical_source)
riemann_hurwitz_formula · mathematical concept Generated from the governed public vocabulary for Plectis.
rigidity General or domain usage A rigidity result shows that stated conditions leave an object unusually little freedom, often determining it up to a specified equivalence .
The conclusion may force one exact form, a small family, or a structure preserved under allowed transformations. The hypotheses explain which apparent alternatives have been excluded.
For example, a geometric result may determine a shape only up to rotation or scaling. Reading that qualification is essential before interpreting a classification as saying that there is exactly one possible instance.
Example A rigidity statement: any sequence meeting these conditions must be Sylvester's.
Scope Used here for arithmetic rigidity statements, not for geometric or structural rigidity.
Reader rule Rigidity does not always mean literal uniqueness of one object.
Other names, related terms and sources
Also shown as rigid
rigidity · public projection Generated from the governed public vocabulary for Plectis.
ring General or domain usage A ring is a set with an abelian-group addition and an associative multiplication that distributes over addition.
Addition has a zero, additive inverses, and the commutative law; multiplication is associative and distributes on both sides. The rings used here have a multiplicative identity 1. A commutative ring additionally has 𝑎 𝑏 = 𝑏 𝑎 a b = b a . The integers are an example, even though most integers have no multiplicative inverse.
Polynomial rings and rings of integers let algebra proceed without assuming division by every nonzero element. Some authors allow rings without an identity, so that convention must be checked . The papers use commutative rings with identity as the setting for coefficients , ideals, and quotients. A field is a commutative ring in which 1 ≠ 0 1 ≠ 0 and every nonzero element is invertible.
Example The integers form a commutative ring: they can be added, subtracted, and multiplied, but most nonzero integers have no multiplicative inverse in the integers .
Meaning scope General or domain usage. A ring need not allow division by every nonzero element. The algebra used here takes rings to have a multiplicative identity.
Scope Conventions vary on whether every ring must have a multiplicative identity 1; the surrounding algebra here uses rings with 1. A ring need not be a field, because division by nonzero elements may fail.
Other names, related terms and sources
Also shown as commutative ring
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 596 (mathematical_source)
ring · mathematical concept Generated from the governed public vocabulary for Plectis.
ring automorphism General or domain usage A ring automorphism is a bijective map from a ring to itself that preserves addition, multiplication, and the multiplicative identity when rings are unital.
Substituting 𝑥 ↦ 𝑥 + 1 x ↦ x + 1 in a polynomial ring is an automorphism: substituting 𝑥 ↦ 𝑥 − 1 x ↦ x − 1 reverses it. The map preserves polynomial sums and products even though individual coefficients change.
The paper uses a coordinate translation 𝑥 𝑖 ↦ 𝑥 𝑖 + 𝑒 ( 𝑖 ) x i ↦ x i + e ( i ) . Calling it an automorphism certifies that the substitution loses no polynomial information and can be undone.
Example Substituting 𝑥 ↦ 𝑥 + 1 x ↦ x + 1 in a polynomial ring is an automorphism: substituting 𝑥 ↦ 𝑥 − 1 x ↦ x − 1 reverses it.
Meaning scope General or domain usage. An automorphism is invertible and preserves ring operations. An endomorphism preserves the operations but need not be invertible.
Scope It must be both structure-preserving and invertible. A ring endomorphism need not be bijective . The base ring may also be required to remain fixed, in which case one speaks of an automorphism over that base.
Other names, related terms and sources
Also shown as automorphism of a ring
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::line 1019 (mathematical_source)
ring_automorphism · mathematical concept Generated from the governed public vocabulary for Plectis.
rising factorial General or domain usage The rising factorial multiplies a fixed number of consecutive ascending factors : 𝑥 ( 𝑥 + 1 ) ⋯ ( 𝑥 + 𝑘 − 1 ) x ( x + 1 ) ⋯ ( x + k − 1 ) .
Its value for 𝑘 = 0 k = 0 is the empty product 1. For 𝑘 = 3 k = 3 it is 𝑥 ( 𝑥 + 1 ) ( 𝑥 + 2 ) x ( x + 1 ) ( x + 2 ) ; unlike 𝑘 ! k ! , the starting value x can vary.
The exact cubic model in #243 is the rising factorial 𝑛 ( 𝑛 + 1 ) ( 𝑛 + 2 ) n ( n + 1 ) ( n + 2 ) , whose successive ratio is 1 + 3 / 𝑛 1 + 3 / n . Its finite -horizon residue modulus is another ascending product , ( 𝑛 + 2 ) ⋯ ( 𝑛 + 𝑡 + 1 ) ( n + 2 ) ⋯ ( n + t + 1 ) , recorded in the Lean corpus as an ascFactorial identity.
Other names, related terms and sources
Also shown as ascending factorial, rising factorials, Pochhammer symbol
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::sec:cubic-extraction (mathematical_source)
rising_factorial · mathematical concept Generated from the governed public vocabulary for Plectis.
rollback General or domain usage A rollback returns a system, transaction , or recorded state to an earlier state after a change.
Rollback may reverse a database transaction , redeploy an earlier release , restore a backup, or apply a compensating change. The available guarantee depends on the system.
A rollback plan identifies the prior state, trigger, procedure, authority , and evidence that restoration succeeded. Some operations are fully reversible; others require compensation because messages were sent, data escaped, or outside systems changed. Plectis treats rollback evidence as one part of release authority . A Git revert creates a new inverse commit and differs from moving a branch pointer back.
Example A failed deployment restores the previous tested release and checks its health endpoint .
Meaning scope General or domain usage. A rollback restores an earlier state, but may leave effects already observed outside the system. It does not make a failed change cease to have happened.
Scope Restoring local state does not necessarily undo effects already observed by another person or system.
Not this Deleting an audit record to hide a failed change is not a valid rollback.
Other names, related terms and sources
Also shown as roll back, rolled back, revert operation
Source refs sites/microcosm/docs/rules-and-ideas.html (reading_context)
rollback · public projection Generated from the governed public vocabulary for Plectis.
root multiplicity General or domain usage The multiplicity of a root measures how many copies of its linear factor occur in a polynomial .
For a nonzero polynomial , a root a has multiplicity k when 𝑝 ( 𝑧 ) = ( 𝑧 − 𝑎 ) 𝑘 𝑞 ( 𝑧 ) p ( z ) = ( z − a ) k q ( z ) with 𝑞 ( 𝑎 ) ≠ 0 q ( a ) ≠ 0 . A simple root has multiplicity one; a multiple root has larger multiplicity.
For example, ( 𝑧 − 1 ) 2 ( 𝑧 + 2 ) ( z − 1 ) 2 ( z + 2 ) has three roots counted with multiplicity but only two distinct roots. The distinction matters when a geometric argument chooses paths between root points. Repeated occurrences share one location and cannot be separated geometrically just by assigning them different labels.
Scope Counting with multiplicity differs from counting distinct locations.
Other names, related terms and sources
Also shown as order of a zero
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 957 (mathematical_source)
root_multiplicity · mathematical concept Generated from the governed public vocabulary for Plectis.
root of a polynomial General or domain usage A number r for which a polynomial f has value 𝑓 ( 𝑟 ) = 0 f ( r ) = 0 .
For 𝑓 ( 𝑧 ) = 𝑧 2 − 1 f ( z ) = z 2 − 1 , both 1 and -1 are roots because substituting either gives zero. The factorization 𝑓 ( 𝑧 ) = ( 𝑧 − 1 ) ( 𝑧 + 1 ) f ( z ) = ( z − 1 ) ( z + 1 ) displays them directly.
Problem 1041 asks whether two root occurrences can be joined by a short path staying in a prescribed polynomial sublevel set .
Meaning scope General or domain usage. A polynomial root is a zero of the polynomial , distinct from a root directory or a root node in a hierarchy.
Scope A nonconstant complex polynomial of degree n has n roots when repetitions are counted. A root can have multiplicity greater than one, as 0 does for 𝑧 2 z 2 .
Other names, related terms and sources
Also shown as polynomial root, zero of a polynomial, polynomial zero
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 122 (mathematical_source)
polynomial_root · mathematical concept Generated from the governed public vocabulary for Plectis.
root of unity General or domain usage An nth root of unity is a complex number 𝜁 ζ satisfying 𝜁 𝑛 = 1 ζ n = 1 ; it is primitive when no smaller positive power of 𝜁 ζ equals one.
For 𝑛 = 4 n = 4 the roots are 1, i, − 1 − 1 , and − 𝑖 − i . The primitive fourth roots are i and − 𝑖 − i , because their exact multiplicative order is four.
For a fixed positive integer n, the nth roots of unity form a finite cyclic group under multiplication. Its generators are the primitive nth roots and are the roots of the nth cyclotomic polynomial . All nth roots of a nonzero complex number are obtained from one chosen root by multiplying by each nth root of unity. A primitive root modulo an integer is a related but different object: a residue class generating a modular unit group.
Example For 𝑛 = 4 n = 4 the roots are 1, i, − 1 − 1 , and − 𝑖 − i .
Meaning scope General or domain usage. An nth root of unity has order dividing n. A primitive nth root has order exactly n.
Scope “Primitive root of unity” is different from a primitive root modulo an integer . Exact order matters: 1 is an nth root of unity for every n but is primitive only for 𝑛 = 1 n = 1 .
Other names, related terms and sources
Also shown as roots of unity, primitive root of unity
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1397 (mathematical_source)
root_of_unity · mathematical concept Generated from the governed public vocabulary for Plectis.
routing System-local specialization Routing chooses the next relevant destination or action from a question, input, or current state.
choose the right path
In Plectis, a route may lead to a source file , a navigation collection, a governing skill , or the workflow responsible for a change. Its purpose is to reduce guesswork before deeper inspection .
A plausible keyword match can still lead to the wrong owner. A useful route therefore supplies enough identity and explanation for the reader to recognise and correct a mismatch.
Example The Navigation Hologram Route Plane is one concrete instance of routing: it is the surface that turns a situation into ranked, source -linked options so the smallest useful next step can be chosen before any underlying file is opened. See it live: Navigation Hologram Route Plane open the live route-selection surface as one component
Meaning scope System-local specialization. Routing means semantic selection of repository reads and actions. It does not redefine network routing, logistics routing, or general graph traversal.
Scope Routing covers the decision of where to look across the whole site, from a docs lookup to a paper -module or component pointer to a fallback by meaning. A reader meets it whenever a query or link hands them a chosen path with a reason rather than dropping them straight into raw source .
Not this Routing is not the content itself and not a guarantee that the surface it picked is correct. It chooses and ranks where to look; the underlying source still has to be opened and checked .
Reader rule The route must match the task's actual subject and authority requirements.
Other names, related terms and sources
Also shown as route, route graph, semantic routing
Search handles docs route
Source refs doctrine module semantic_routing_plane (paper_module) doctrine module navigation_hologram_theory (paper_module)
routing · navigation Generated from the governed public vocabulary for Plectis.
row job System-coined term A row job specifies one bounded operation on an identified record or small artifact selection.
bounded row transition
It states the target, intended change, permitted scope , expected result, and required check before execution . Plectis uses this structure to turn a broad request into work that can be assigned and assessed.
Fixing the scope in advance makes it easier to detect unintended changes or unmet requirements. The worker still needs to inspect the target and stop if the assumed conditions do not hold.
Example The Bounded Autonomy Campaign Packet is a concrete instance: a packet that frames a run as a set of bounded , pre-specified jobs, each with its own target, limits , and validation , so the work can proceed without open-ended authority . See it live: Bounded Autonomy Campaign Packet open one live component that packages bounded , pre-specified jobs
Meaning scope System-coined term. A row job is one predeclared bounded operation against a named row or slice ; it is not a database background job or an open-ended batch instruction.
Scope Row job is a runtime term. A reader meets it wherever the system turns a large request into discrete, checkable pieces of work: provider -driven passes, bulk repair of findings, and pipeline -style campaigns that fan many small changes across workers.
Not this A row job is not a running process, a scheduler, or a grant of broad permission to act across the system. It is the bounded specification of one task, fixed before any worker runs.
Reader rule The job description is a plan; a separate result records what actually happened.
Other names, related terms and sources
Also shown as row-job, row_job
Search handles metabolism job, worker affordance packet, bounded row job, provider row job, transform job candidate, validation contract, validation_contract
Source refs doctrine module navigation_hologram_theory (paper_module_section)
row_job · runtime Generated from the governed public vocabulary for Plectis.
rowability System-coined term Rowability is Plectis's term for whether a collection can be reliably browsed as identifiable, source -linked entries .
selectable row readiness
Each item needs a stable identity, useful summary, route to detail, and appropriate status information. Merely having files somewhere in the repository does not supply that browsing interface .
This property matters when an agent must choose among many artifacts without guessing their names. A rowable collection turns discovery into selecting known options while retaining access to the source needed for the chosen task.
Example A components index provides rowability when each included component has an identifiable entry with a useful summary and a working route to its source . See it live: All components browse a kind laid out as selectable rows
Meaning scope System-coined term. Rowability means an artifact kind can be browsed through stable source -linked rows with provenance and drilldowns ; it does not merely mean the objects can be displayed in a table.
Scope Rowability covers the navigation layer of the system: the index of kinds, the listing of each kind's items, and the route from a listed row back to its source . It is encountered wherever items are presented as browsable, selectable lists, such as the components and paper -module index pages.
Not this Rowability is not a search feature or a filter box. It is the prior condition that lets items be listed and selected by stable rows at all, without keyword search, and traced back to their source .
Reader rule The collection should acknowledge missing or unsupported views.
Other names, related terms and sources
Also shown as rowable, rowable control spine
Search handles rowability plane, rowability before retrieval, selectable row readiness
Source refs runtime module standard_option_surface (code) runtime module kind_atlas (code) standard std_kind_atlas (standard) doctrine module navigation_hologram_theory (paper_module)
rowability · navigation Generated from the governed public vocabulary for Plectis.
run General or domain usage A run is one execution of a command, program , test, or experiment.
It has particular inputs, a source version, an environment , and an outcome. Plectis records those details when they are needed to support a claim or repeat the work.
A run starting successfully is also different from completing successfully. The final status and relevant outputs determine what happened, while a readable record lets later work assess it without relying on a session summary.
Example A test run executes the checks selected for that invocation and records which passed or failed under its stated source version and environment .
Scope The term covers discrete executions reported by the site's evidence and development records .
Not this A command shown in documentation was not necessarily run during the reported pass.
Reader rule Two runs of the same command need not be identical if their conditions differ.
Other names, related terms and sources
Also shown as runs, ran
Search handles running, execution run
run · public projection Generated from the governed public vocabulary for Plectis.
runnable General or domain usage Runnable means the material can be executed with the stated code, dependencies , inputs, and instructions.
For a public component , the reader should be able to obtain the required files and perform the advertised command in a supported environment . Missing private setup would limit that claim .
Execution results and checks provide the next layer of evidence . The published instructions should say where the output appears and what outcome counts as success for the example.
Example Each public component states its command and ships its fixtures , so the check can be run on a fresh clone .
Reader rule Being runnable does not mean that the run succeeds or establishes the intended property.
Sources
runnable · public projection Generated from the governed public vocabulary for Plectis.
running least common multiple General or domain usage A running least common multiple is the least common multiple of all positive-integer terms seen up to a given position.
For the sequence 2,3,4,6, the running values are 2,6,12,12. The last input introduces no new prime power , so the running value repeats.
In #269, the landing page’s three-prime theorem concerns distinct running LCMs of integers built from 2,3,5. The problem’s sum with repetition is a separate target. The arithmetic LCM operation alone does not erase multiplicity in the indexing.
Scope Summing reciprocals at every position counts repeated running values repeatedly. Summing over distinct running values counts each once; these are different series .
Other names, related terms and sources
Also shown as running LCM, prefix LCM, cumulative LCM
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos-269-three-prime-running-lcm.tex::line 1 (mathematical_source)
running_lcm · mathematical concept Generated from the governed public vocabulary for Plectis.
runtime General or domain usage A runtime is the software support and execution context used while a program runs.
The word can refer to language machinery, loaded code, active processes, or the current state of a workflow. Plectis distinguishes this live behaviour from static source files and documentation about intended behaviour.
Inspecting source can explain what a program is meant to do, while runtime records show what a particular execution did. Both may be needed to understand an error or validate a fix.
Example A runtime trace records which command ran, which files it touched, and which result it returned.
Reader rule The relevant environment and version determine which runtime is being described.
Other names, related terms and sources
Also shown as execution runtime, runtime system
Search handles run time
runtime · public projection Generated from the governed public vocabulary for Plectis.
S
saddle connection General or domain usage A saddle connection is a trajectory connecting saddle -type singular points, possibly returning to the same one.
The trajectory is regular away from its endpoints , while the endpoints are understood through limiting behaviour or a separately defined extension. Such a connection depends on the global flow, not just the local shape of each saddle .
For Newton flow , polynomial values along a regular trajectory differ by positive real scale factors . This constrains which nonzero critical values can occur at its limiting endpoints .
Scope The vector field need not be defined at the endpoints under the same formula used between them.
Other names, related terms and sources
Also shown as critical-point connection, separatrix connection
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 642 (mathematical_source)
saddle_connection · mathematical concept Generated from the governed public vocabulary for Plectis.
saddle point General or domain usage A critical point where a function rises in some directions and falls in others.
For 𝑢 ( 𝑥 , 𝑦 ) = 𝑥 2 − 𝑦 2 u ( x , y ) = x 2 − y 2 , the origin is a saddle point: u increases along the x-axis and decreases along the y-axis. It is critical because the gradient vanishes, but it is neither a local maximum nor minimum.
Polynomial sublevel components can merge at saddle levels. The associated separatrices and local branches describe how root-containing regions attach, while global path construction still requires controlling what happens outside the local saddle neighbourhood .
Meaning scope General or domain usage. Calculus, topology, and dynamical systems. The word also appears informally for bottlenecks; the mathematical sense is critical-point structure.
Scope A nondegenerate planar saddle has one rising and one falling direction in suitable local coordinates. Degenerate or multiple critical points may have more complicated prongs, so conclusions proved for simple saddles do not automatically extend.
Other names, related terms and sources
Also shown as mathematical saddle point, saddle, saddle points
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 738 (mathematical_source)
saddle_point · mathematical concept Generated from the governed public vocabulary for Plectis.
sandbox General or domain usage A sandbox is an environment that enforces specific limits on the files, networks, devices, processes, or privileges available to running code.
Sandboxing reduces the reach of mistakes or hostile behaviour by restricting selected capabilities. Its protection is only as broad as the configured boundaries and the enforcement layer that maintains them.
A sandbox runs code with a constrained view of its surroundings. Depending on the design, it may limit filesystem paths, network destinations, system calls, devices, process creation, memory, time, or credentials . These restrictions reduce potential impact, but they do not establish that the code is correct or safe. A sandbox that permits writes to a shared directory still allows damage there, and a network-enabled sandbox can affect reachable services. Isolation also depends on correct configuration and enforcement; a vulnerability in the boundary can permit escape. Sandbox claims therefore describe concrete restrictions rather than absolute protection.
Example A fixture check may run in a temporary directory with no network or access to private repository state.
Scope A sandbox covers the resources and permissions explicitly constrained for one execution context.
Not this Running in a temporary folder alone does not prove that network, process, or credential access is sandboxed.
Reader rule A sandbox confines effects only across its enforced boundaries; allowed paths, network access, inherited credentials , host interfaces , and escape mechanisms remain inside its effective capability set.
Other names, related terms and sources
Also shown as isolated environment, execution sandbox
Search handles sandboxed
sandbox · public projection Generated from the governed public vocabulary for Plectis.
saturated submodule General or domain usage An integer submodule is saturated in its ambient module when it contains every ambient element whose nonzero integer multiple it contains.
An integer module is a group with commutative addition (order does not matter), with integers acting by repeated addition; a submodule is a subgroup. For 𝑁 ⊆ 𝑀 N ⊆ M , saturation means that 𝑟 𝑥 ∈ 𝑁 r x ∈ N , with 𝑥 ∈ 𝑀 x ∈ M and a nonzero integer 𝑟 r , implies 𝑥 ∈ 𝑁 x ∈ N . For example, 2 ℤ 2 Z is not saturated in ℤ Z : it contains twice 1 but omits 1.
In #249, the module generated by the base-two totient sections through any level at least two contains 𝜑 ( 4 𝑛 + 3 ) φ ( 4 n + 3 ) but omits the integer -valued sequence 𝜑 ( 4 𝑛 + 3 ) / 2 φ ( 4 n + 3 ) / 2 . Its rational span therefore contains integer -valued sequences outside its integer span.
Meaning scope General or domain usage. This row explains saturation for modules over the integers . Over a general integral domain the same definition uses nonzero scalars from that domain.
Scope The ambient module matters. Having an integer basis or knowing all integer relations among the chosen generators does not establish saturation.
Other names, related terms and sources
Also shown as saturated integer module
Source refs sites/microcosm/papers/source/plectis-erdos/paper/249/erdos-249-binary-totient-series.tex::lines 345–350 (mathematical_source)
saturated_submodule · mathematical concept Generated from the governed public vocabulary for Plectis.
scalar General or domain usage A scalar is an element of the number system used for coefficients , scaling, and arithmetic in a mathematical structure.
Multiplying the vector (2,3) by the scalar 4 gives (8,12). Depending on the vector space , allowed scalars may be rational , real, or complex numbers .
The field of allowed scalars matters for linear independence : a family independent over the rationals may be dependent over the reals . In computing, “scalar” can instead distinguish a single value from a vector or array.
Meaning scope General or domain usage. Linear algebra and analysis. Scalar can also mean a single value rather than an array in computing.
Scope Scalar multiplication must obey distributive and associative laws with vector addition.
Other names, related terms and sources
Also shown as scalars
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::line 331 (mathematical_source)
scalar · mathematical concept Generated from the governed public vocabulary for Plectis.
schema General or domain usage A data schema specifies allowed structure, field values, and constraints for a class of records .
JSON Schema can constrain types, require named properties, and restrict values. A repository standard may also state semantic or lifecycle rules needing a dedicated validator or review; not every such rule is encoded in a schema document.
Glossary rows require identity, scope , status, and profile-specific definition fields. Examples and scope notes are supporting fields rather than universal requirements. The local validation -artifact contract separates a machine-checkable shape from the standard governing its meaning.
Example A glossary row supplies the reader fields required by its selected profile; an optional example illustrates its meaning.
Meaning scope General or domain usage. The general data-modelling meaning applies. JSON Schema is an external technology for expressing constraints, while local standards can govern obligations beyond executable schema checks .
Scope A schema governs records that declare or are routed to its identifier and version.
Not this Schema validity does not prove that a record 's statements match reality.
Reader rule Check the schema version and validation method. Accepting a JSON shape does not establish that the recorded facts or reported outcome are correct.
Other names, related terms and sources
Also shown as data schema, record shape
Search handles JSON schema
Source refs standard std_system_term (standard) standard std_validation_artifact_ref (standard)
schema · public projection Generated from the governed public vocabulary for Plectis.
scope General or domain usage Scope states the cases, objects, actions, and conditions to which something applies.
For a theorem , scope comes from its quantified variables and hypotheses. For a test, it includes the inputs and behaviour examined. For a task, it includes the authorised changes and intended result.
Plectis records these boundaries so partial work can be useful without appearing universal. A clear scope also makes it easier to identify which additional evidence or authorisation would support a broader action.
Example A fixture validator 's scope may be one committed input set at one source revision with no live network access.
Scope This term covers the applicability set declared by one artifact , claim , check , permission , or task.
Not this The topic a page discusses is not automatically the scope of every claim made on that page.
Reader rule Evidence and permission should not silently extend beyond their stated scope.
Other names, related terms and sources
Also shown as coverage area, applicable range
Search handles in scope, out of scope
scope · public projection Generated from the governed public vocabulary for Plectis.
scope limit System-local specialization A scope limit states where a claim , permission , or piece of evidence stops applying.
what evidence stops
Meaning scope System-local specialization. A scope limit is a stated boundary of a claim , permission , or task. On component cards it chiefly identifies what the evidence supports ; that use should not be confused with broader release authority .
Scope Scope limits appear wherever a result, component card , digest row, evidence page, or agent answer separates what is shown from what is not shown. The same boundary is recorded in source identifiers as a claim ceiling or authority ceiling.
Not this A scope limit is not a flaw, a hedge, or an admission that a result is weak. It is the precise statement of how far one verified result reaches, leaving everything outside that line unclaimed rather than quietly assumed.
Reader rule The limit should name the actual boundary rather than offer a generic disclaimer.
Other names, related terms and sources
Also shown as scope boundary, claim boundary
Search handles claim ceiling, authority ceiling
Source refs tool build_microcosm_public_site (public_projection_builder) core/organ_registry.json (compatibility_source)
scope_limit · public projection Generated from the governed public vocabulary for Plectis.
semantic naming System-coined term Semantic naming gives an identifier or label enough meaning to help a reader recognise the object's role.
names carry system role
Meaning scope System-coined term. Semantic naming encodes an artifact ’s role, authority , lifecycle state, and drilldown in its identifiers and labels; it is not a stylistic naming convention alone.
Scope Semantic naming governs how every artifact in the system is named: components , paper modules , doctrine cards, routes, and files. A reader meets it whenever a name on the site or in the source encodes role, authority , or lifecycle rather than being a plain label.
Not this Semantic naming is not a style preference about which word reads best, and it is not mere file tidiness. It is a grammar in which the name encodes the artifact 's kind, authority , and lifecycle, so the name carries real information, not decoration.
Reader rule A name suggests meaning; the source record establishes the full role, authority , and current status.
Other names, related terms and sources
Also shown as naming grammar, file naming system
Search handles naming principle, names as affordance rows, role-first naming, semantic filenames, governed naming, root invocation shim, root shim
Source refs doctrine module semantic_naming_grammar (paper_module) standard std_semantic_naming (standard) doctrine module navigation_hologram_theory (paper_module)
semantic_naming · navigation Generated from the governed public vocabulary for Plectis.
separable extension General or domain usage An algebraic extension 𝐿 / 𝐾 L / K is separable when every element of L has a minimal polynomial over K with no repeated roots in a splitting field.
Every algebraic extension of a field of characteristic zero, including number fields over Q, is separable. In positive characteristic, repeated-root phenomena such as 𝑥 𝑝 − 𝑎 x p − a can make an extension inseparable.
Separability supplies distinct embeddings of the extension into an algebraic closure. With normality, those embeddings land back in L and become the elements of its Galois group .
Example Every algebraic extension of a field of characteristic zero, including number fields over Q, is separable.
Meaning scope General or domain usage. Separable refers to distinct roots of minimal polynomials , not spatial separation. Algebraic extensions in characteristic zero are separable.
Scope Separable does not mean that different elements of L are unequal or spatially separated. It is a property of minimal-polynomial roots and is relative to the base field.
Other names, related terms and sources
Also shown as separable field extension
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 280 (prerequisite_dependency)
separable_extension · mathematical concept Generated from the governed public vocabulary for Plectis.
separatrix General or domain usage A separatrix is a distinguished trajectory, or invariant boundary, separating regions with different dynamical behaviour.
Near a planar saddle , special incoming and outgoing trajectories divide families of nearby trajectories. They help describe which starting points can approach which limiting objects.
In the Newton-flow material, these paths are used to organise regions around roots and critical points . Their local directions do not alone prove the existence or shape of a global connection between two distant endpoints .
Scope The precise definition depends on the dynamical system and the role of its singular points.
Other names, related terms and sources
Also shown as separating trajectory, saddle separatrix
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 752 (mathematical_source)
separatrix · mathematical concept Generated from the governed public vocabulary for Plectis.
sequence General or domain usage A sequence is an indexed family of terms, usually ordered by natural-number positions.
For example, 𝑎 𝑛 = 1 / 𝑛 a n = 1 / n for 𝑛 ≥ 1 n ≥ 1 gives 1, 1 / 2 1 / 2 , 1 / 3 1 / 3 , … . The index identifies each position, and repeated values are allowed.
A sequence lists terms; a series adds them. That distinction matters because a sequence tending to zero can still have a divergent sum , as happens with the harmonic sequence and harmonic series .
Example The consecutive primes form an increasing sequence whose successive differences are the prime gaps .
Scope Sequence covers the ordered family and index domain named in the statement.
Not this An unordered set containing the same values is not the same object as the sequence.
Reader rule The starting index and formula or recurrence are part of the definition.
Other names, related terms and sources
Also shown as integer sequence, number sequence
Search handles ordered sequence
sequence · public projection Generated from the governed public vocabulary for Plectis.
series General or domain usage A mathematical series is a sum of terms from a sequence , often extending over infinitely many indices .
Reader rule A time series is a different use: a sequence of observations indexed by time, not necessarily added together.
Other names, related terms and sources
Also shown as infinite series
series · public projection Generated from the governed public vocabulary for Plectis.
series tail General or domain usage The tail of a series is the part remaining after a chosen finite number of terms.
For ∑ 𝑎 𝑛 ∑ a n starting at 1, the tail after N is ∑ ∑ over 𝑛 > 𝑁 n > N of 𝑎 𝑛 a n . When the series converges , this equals the full sum minus its Nth partial sum .
The papers often study scaled tails to expose integer or divisibility conditions. Those arithmetic properties require more than the fact that the unscaled tail becomes small.
Scope A convergent series has tails tending to zero, although multiplying them by a growing factor may change that behaviour.
Other names, related terms and sources
Also shown as infinite tail, remainder tail
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 585 (mathematical_source)
series_tail · mathematical concept Generated from the governed public vocabulary for Plectis.
server General or domain usage A server is a program or computer that receives requests and provides data, computation, or another service to clients .
A server may host web pages, expose an API , store files, run tools, or coordinate jobs. One machine can run several server processes, and one service can span several machines.
Clients and servers describe roles in an interaction rather than permanent kinds of machine. A program can be a client in one exchange and a server in another. Servers must validate requests, enforce authorization , manage capacity, and report failures without exposing secrets. Plectis pages mention tool servers and public static hosting; the public site serves files while tool servers expose callable operations. A server response is evidence of that exchange, not proof of every claim in its payload .
Example A web server returns a prebuilt HTML page in response to an HTTPS GET request.
Meaning scope General or domain usage. A program or system acting in response to requests from clients ; a standalone program is not a server merely because it runs on a computer.
Scope Distinguish the server program , its host machine, and the service it provides; they are related but not identical.
Not this A standalone script that neither listens for nor receives requests is not acting as a server.
Other names, related terms and sources
Also shown as servers, web server, service server
Source refs sites/microcosm/docs/rules-and-ideas.html (reading_context)
server · public projection Generated from the governed public vocabulary for Plectis.
set General or domain usage A set is a collection determined by which elements belong to it.
Order and repetition do not change a set: { 1 , 2 } { 1 , 2 } and { 2 , 1 , 1 } { 2 , 1 , 1 } describe the same set. The notation 𝑥 ∈ 𝐴 x ∈ A says that x belongs to A.
This distinction matters in the papers when selecting exponents or counting roots. A polynomial 's roots as a set ignore repeated occurrences, while roots counted with multiplicity carry additional information.
Example In 𝑆 𝐹 ( 𝑏 ) S F ( b ) , F is a finite set of exponents ; the corresponding open problem asks about every infinite support set.
Scope Covers mathematical membership collections used in Plectis statements and certificates , especially exponent and support sets.
Not this A sequence is not merely a set because order and repetition can matter.
Reader rule A sequence or multiset keeps information that an ordinary set discards.
Other names, related terms and sources
Also shown as mathematical set
Search handles sets, collection of elements
set · mathematical concept Generated from the governed public vocabulary for Plectis.
set intersection General or domain usage The intersection of sets contains exactly the elements common to all of them.
For 𝐴 = { 1 , 2 } A = { 1 , 2 } and 𝐵 = { 2 , 3 } B = { 2 , 3 } , 𝐴 ∩ 𝐵 A ∩ B is { 2 } { 2 } . If the sets have no common element, their intersection is empty. Membership in an intersection is an “and” condition: every participating membership requirement must hold.
The papers use intersections to combine restrictions on candidates, indices , or regions. Producing something that satisfies each condition separately can be much easier than producing one object satisfying all conditions together.
Scope Two nonempty sets can have an empty intersection, so separate existence statements do not establish a common witness .
Other names, related terms and sources
Also shown as intersection of sets
Source refs governed vocabulary term_registry (reading_context)
set_intersection · mathematical concept Generated from the governed public vocabulary for Plectis.
set membership General or domain usage Set membership is the relation saying that an object is one of the elements of a set.
The symbol 𝑥 ∈ 𝐴 x ∈ A means “x belongs to A”; 𝑥 ∉ 𝐴 x ∉ A means it does not. For example, 2 ∈ { 1 , 2 , 3 } 2 ∈ { 1 , 2 , 3 } , but 5 ∉ { 1 , 2 , 3 } 5 ∉ { 1 , 2 , 3 } . Membership differs from subset inclusion: an element belongs to a set, whereas a subset contains only elements of that set.
Statements such as 𝑧 ∈ 𝑈 z ∈ U and 𝑛 ∈ 𝐴 n ∈ A specify which points or indices are allowed. These restrictions often carry the hypotheses needed for a formula, proof step, or chosen witness to be valid.
Scope An element can itself be a set, so braces and the declared types matter when reading nested collections.
Other names, related terms and sources
Also shown as element of a set, belongs to a set
Source refs governed vocabulary term_registry (reading_context)
set_membership · mathematical concept Generated from the governed public vocabulary for Plectis.
set union General or domain usage The union of sets contains every element belonging to at least one of them.
For 𝐴 = { 1 , 2 } A = { 1 , 2 } and 𝐵 = { 2 , 3 } B = { 2 , 3 } , the union 𝐴 ∪ 𝐵 A ∪ B is { 1 , 2 , 3 } { 1 , 2 , 3 } . The shared element 2 appears once because sets record membership, not repeated occurrences. A union can also combine an infinite family of sets.
This differs from intersection, which requires simultaneous membership. In the mathematics pages, unions describe combined regions or collections of allowable cases; proving a property of each piece may require further work before it holds for the union.
Scope Membership in a union is an “or” condition, allowing membership in several of the component sets.
Other names, related terms and sources
Also shown as union of sets
Source refs governed vocabulary term_registry (reading_context)
set_union · mathematical concept Generated from the governed public vocabulary for Plectis.
shared path General or domain usage The shared path is the common way Plectis presents a component 's claim , check , recorded result, and limits .
Different components have different jobs, but readers can examine them through the same sequence : understand the assertion, inspect the test and inputs, read the output, and identify its scope .
Each component still needs evidence appropriate to its own mechanism . A shared card layout cannot substitute for a missing check or make one component inherit another's verified behaviour.
Example The example on the landing page walks the shared path once: command, input, result, and the limit of the result.
Scope The shared path describes how components are structured, not whether any particular one is correct.
Reader rule The common presentation makes comparisons easier without making the components interchangeable.
Other names, related terms and sources
Also shown as shared paths
shared_path · public projection Generated from the governed public vocabulary for Plectis.
side effect General or domain usage A side effect is an observable change a computation makes beyond returning its direct result.
Side effects include writing files, changing a database , sending a message, starting a process, or modifying shared state. The same function may have both a return value and side effects.
Writing a file, changing a shared object, sending a request, or displaying output affects something beyond a function ’s return value. Repeating such work can repeat the effect, which matters for retries and recovery. Plectis distinguishes isolated fixture calculations from actions on live files, accounts, and services. Reading a clock or random input is also an effect in broader programming terminology because it makes a result depend on outside state, even when the read itself changes nothing observable.
Example A command returns success and also writes a generated report to disk.
Meaning scope General or domain usage. An observable change beyond returning a value, such as writing a file or changing external state; constructing a local value alone is outside this sense.
Scope Identify and authorize side effects separately from calculating or previewing a result.
Not this Constructing a new value entirely in local memory has no externally observable side effect.
Other names, related terms and sources
Also shown as side effects, external side effect
Source refs sites/microcosm/docs/area-continuity.html (reading_context)
side_effect · public projection Generated from the governed public vocabulary for Plectis.
simple critical point General or domain usage A point c where a complex polynomial has 𝑝 ′ ( 𝑐 ) = 0 p ′ ( c ) = 0 but 𝑝 ″ ( 𝑐 ) ≠ 0 p ″ ( c ) ≠ 0 .
The derivative has a simple zero at c. The Taylor expansion begins 𝑝 ( 𝑧 ) = 𝑝 ( 𝑐 ) + 𝑎 ( 𝑧 − 𝑐 ) 2 + p ( z ) = p ( c ) + a ( z − c ) 2 + higher-order terms, with a nonzero. Locally this is a two-sheeted branch rather than the higher-order branching produced by a repeated zero of p′.
The isolated-critical-value construction in #1041 chooses a simple critical point with nonzero value and excludes other critical values from a specified disc. The quadratic local form explains its square-root coordinate. Simplicity alone does not give the global two-sheeted component or the required length estimate; those use the stated isolation and area hypotheses.
Meaning scope General or domain usage. Simple critical point is a derivative -multiplicity condition; saddle geometry also needs a nonzero critical value .
Scope The modulus has saddle geometry only when 𝑝 ( 𝑐 ) ≠ 0 p ( c ) ≠ 0 . If 𝑝 ( 𝑐 ) = 0 p ( c ) = 0 , the modulus vanishes at c and is locally a minimum; the same saddle description would be false.
Other names, related terms and sources
Also shown as simple critical points
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::sec:separation (mathematical_source)
simple_critical_point · mathematical concept Generated from the governed public vocabulary for Plectis.
simply connected General or domain usage Path connected , with every closed loop shrinkable to a point while staying inside the space.
A filled disc is simply connected; an annulus is not, because a loop around its hole cannot contract within it. Connectedness alone gives no such loop condition.
The outward slits in #1041 eliminate loops around the excluded critical values . This makes branch choices consistent throughout the remaining domain. Simple connectivity supplies path independence, while length control still needs an analytic estimate.
Meaning scope General or domain usage. The ordinary topological condition includes path connectedness ; inverse-sheet consequences also require a genuine covering and the stated domain hypotheses.
Scope For a covering over a simply connected, locally path-connected domain, a chosen preimage determines one global inverse sheet. Each connected sheet maps homeomorphically onto the base.
Other names, related terms and sources
Also shown as simple connectivity
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::res:component-local-covering (mathematical_source)
simply_connected · mathematical concept Generated from the governed public vocabulary for Plectis.
simulation General or domain usage A simulation executes a model of a process to study the behaviour that follows from the model 's rules and inputs.
Simulation permits controlled experiments when direct observation is costly, slow, dangerous, or impossible. Its results describe the modelled system and inherit the model 's assumptions , simplifications, and parameter choices.
A simulation represents selected features of a process and calculates how that representation evolves. Deterministic simulations replay fixed equations or rules, while stochastic simulations sample uncertain events, often many times, to estimate a distribution of outcomes. Resolution, discretization, parameter choice, and random seeds can materially change the result. Verification asks whether the program implements the intended model ; validation asks whether that model adequately represents the real system for the proposed use. A simulation can expose consequences, sensitivities, and failure modes without establishing that the same behaviour occurs outside the model .
Scope A simulation result is conditional on the model , initial conditions, parameters, numerical method, and random inputs; agreement within the simulation is distinct from validation against observations of the target system.
Other names, related terms and sources
Also shown as simulations, simulate
Source refs sites/microcosm/docs/architecture.html (reading_context) sites/microcosm/docs/rules-and-ideas.html (reading_context)
simulation · public projection Generated from the governed public vocabulary for Plectis.
skill System-local specialization In this system, a skill is a reusable set of instructions for carrying out a recognisable kind of task.
agent operable procedure
It states when it applies, the steps to follow, relevant constraints, and routes to governing material. Agents can discover and reuse it instead of reconstructing the workflow from scratch.
The skill should stay aligned with the tools and rules it names. An instruction pointing to an obsolete command needs repair even if its general advice remains sound.
Example The procedure for working through a task with a coding agent is a skill: it names the situation it fits, lays out the steps to follow, and states the constraints that bound them, so the agent can run it without rederiving the workflow. See it live: With a coding agent see a skill that drives a coding agent through a task
Meaning scope System-local specialization. Skill means a recorded agent -operable procedure with triggers and constraints. It is not a personal talent, capability score, or permission grant.
Scope Skills are the action vocabulary of the system, sitting alongside its components and doctrine . A reader meets them where the public pages describe how an agent works through a task, most directly on the page covering use with a coding agent .
Not this A skill is not a personal talent, a clever trick, or a feature being advertised. It is a recorded procedure with named triggers, defined steps, and stated limits that an agent runs.
Reader rule A skill is procedural guidance; a component is implemented machinery that may carry out part of it.
Other names, related terms and sources
Also shown as agent skill, workflow skill
Source refs standard std_skill (standard) doctrine skill skill_registry (registry)
skill · artifact Generated from the governed public vocabulary for Plectis.
slice General or domain usage A slice is a selected part of a larger collection or system.
Plectis uses the word for bounded sets of files, records , or components included in a task or public release . Naming the selection makes it clear what can be inspected or changed.
A public slice can be independently runnable while the wider system remains unpublished. Evidence about that slice applies to its included material and tested interactions, with any broader conclusions requiring additional support .
Example The public repository is a slice of the system it comes from: the components and their checks are inside the cut; the frontend , live tools, and non-public data are outside it.
Scope A slice establishes only what falls inside it. Nothing about the surrounding system follows from it.
Reader rule The selection's boundary should be explicit rather than inferred from its title.
Other names, related terms and sources
Also shown as slices
slice · public projection Generated from the governed public vocabulary for Plectis.
smoke check General or domain usage A smoke check is a quick test for major failures in basic operation.
It might confirm that an application starts, an example command runs, or a key page loads. The aim is to catch obvious breakage before investing in more detailed checks .
Its success is a useful first signal, not a comprehensive assessment of correctness. Plectis should identify the basic behaviour exercised so readers can tell which further checks are needed for a particular change.
Example A served-route smoke check confirms a page responds before its content is examined.
Scope A smoke check establishes basic reachability, nothing deeper.
Reader rule A smoke check deliberately has limited coverage .
Other names, related terms and sources
Also shown as smoke test
smoke_check · public projection Generated from the governed public vocabulary for Plectis.
smooth function General or domain usage A smooth function has continuous derivatives of every finite order in its stated mathematical setting.
Every polynomial is smooth, including at points where its first derivative is zero. Smoothness allows repeated differentiation but does not imply that a real function equals its Taylor series . A function can therefore be smooth without being analytic.
A smooth, or C-infinity, function has derivatives of every order and all those derivatives are continuous. For maps between Euclidean spaces, this means every iterated partial derivative exists and is continuous. On manifolds the definition is made through smooth coordinate charts. Smoothness is a regularity condition, not a claim of analyticity, convexity , or absence of critical points . In optimization prose, a smooth cell often means a region where the active formula and its derivatives vary smoothly; boundaries where the active branch changes may fail to share that regularity.
Example Every polynomial map is smooth on its whole Euclidean domain.
Other names, related terms and sources
Also shown as infinitely differentiable, C-infinity function
smooth_function · mathematical concept Generated from the governed public vocabulary for Plectis.
smooth number General or domain usage A smooth number is a positive integer whose prime factors all lie below a stated bound , or in a stated allowed prime set.
Relative to the set {2,3}, numbers such as 1, 8, 12, and 27 are smooth, while 10 is not. Repeated prime factors are allowed.
The #257 P-part extracts all allowed prime factors with their multiplicities. The #269 running LCM likewise uses integers built from a specified prime set. Smoothness limits which primes occur; squarefreeness limits their multiplicities.
Example 6 0 = 2 2 × 3 × 5 60 = 2 2 × 3 × 5 is { 2 , 3 , 5 } { 2 , 3 , 5 } -smooth and is not 3-smooth, because 5 exceeds 3.
Scope Integer smoothness relative to a named bound or a named set of primes .
Not this A smooth curve in the plane is a geometric notion, not this arithmetic one.
Reader rule Specify the bound or allowed prime set. Some conventions use primes ≤ 𝑦 ≤ y and others primes < 𝑦 < y ; mathlib ’s Nat.smoothNumbers uses the strict bound .
Other names, related terms and sources
Also shown as smooth numbers
Search handles B-smooth
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
smooth_number · public projection Generated from the governed public vocabulary for Plectis.
snapshot General or domain usage A snapshot is a captured representation of data or system state associated with a particular point or version.
A database snapshot can preserve records as they appeared at noon; a repository snapshot can preserve one commit . Later changes do not make that snapshot inaccurate, but they do make it stale as a description of current state.
Snapshots support comparison, recovery, audit , and reproducibility by fixing a view that would otherwise change. They may be full copies, incremental differences, filesystem references , database -consistent views, or application exports. Capturing related systems at different moments can create an internally inconsistent composite. A snapshot also may omit caches , secrets, running processes, external services, or uncommitted changes. Restoring it recreates only the state actually captured, and a successful restore does not establish that newer dependent systems remain compatible.
Scope Snapshot meaning depends on capture time, scope , consistency guarantees, source version, included external state, and whether content is copied or referenced immutably.
Other names, related terms and sources
Also shown as snapshots, state snapshot
Source refs sites/microcosm/docs/area-formal-math.html (reading_context) sites/microcosm/docs/area-import-drift.html (reading_context)
snapshot · public projection Generated from the governed public vocabulary for Plectis.
software General or domain usage Software consists of programs and related data used by computers to perform tasks.
On this site, the software section presents Plectis's reusable research components and the machinery supporting its workflow. It is distinguished from the mathematical reading routes, although formal proofs also use software tools.
A repository can make implementation available without demonstrating every advertised use. The source , runnable example, and recorded check together help a reader assess the particular behaviour being claimed .
Example Plectis publishes software components that readers can inspect and run locally.
Reader rule Each published component needs its own description, dependencies , and evidence .
Other names, related terms and sources
Also shown as software system
Search handles computer software
software · public projection Generated from the governed public vocabulary for Plectis.
software library General or domain usage A software library is a reusable collection of code, interfaces , or formal definitions intended for other programs or developments to use.
Libraries can be source packages , compiled objects, runtime modules , or formal collections such as Mathlib . Their exposed interfaces supply reusable operations or results. Consumers depend on the relevant version, behaviour, licence, and compatibility with other parts of their program or proof development.
A library differs from an application because it primarily supplies capabilities to consumers rather than owning the whole interaction, although packages can contain both. Public interfaces form the supported contract ; internal implementation may change between compatible releases . Static and dynamic libraries link differently, while interpreted packages load through a runtime . Formal libraries contribute checked definitions and theorems . Dependency updates can alter behavior or proof meaning, so reproducibility requires pinned identity and transitive dependencies , not merely the library’s familiar name.
Example Mathlib is a formal software library supplying maintained Lean definitions and theorems .
Scope Qualified software and formal -library sense; the physical collection or lending institution is outside this row.
Not this A physical lending library uses another sense of the word; the qualified term here concerns reusable software or formal material.
Reader rule When a result depends on a software library, record the exact package , version or revision, relevant interface assumptions , and environment used.
Other names, related terms and sources
Also shown as software libraries, programming library, code library, formal library
library · public projection Generated from the governed public vocabulary for Plectis.
source System-local specialization A source is the original or controlling material from which a particular claim or artifact is drawn.
Here it often means code, a structured record , a theorem declaration , or a document linked from a generated page. Which source matters depends on the question being asked.
A reliable explanation identifies the relevant source precisely, including a version where necessary. Opening it lets a reader check the detail that a summary may simplify or omit.
Example The specimen component names its source path beside its evidence class and scope limit .
Meaning scope System-local specialization. Source means the identified material that originates or controls the fact under discussion. A component may point to a committed code path, while a mathematical claim may point to a theorem , paper , or proof file and an execution claim may point to its run record . A nearby summary is not automatically authoritative source material.
Scope Covers the material from which a claim or artifact is drawn, including code, structured records , theorem declarations , documents, datasets , and cited external works. The controlling source depends on the question and should be identified by a stable path, declaration , record , or citation.
Not this The nearest readable summary on the site is not automatically the source of a claim .
Reader rule Source for implementation and source for human intent need not be the same material.
Other names, related terms and sources
Also shown as source material
Search handles originating source
source · public projection Generated from the governed public vocabulary for Plectis.
source authority System-local specialization Source authority identifies the record or implementation controlling a particular question in this system.
where truth is owned
Meaning scope System-local specialization. This local source -of-record relation concerns a specific claim or artifact . It confers no legal, moral, academic, or general institutional authority .
Scope Authority is assigned for a particular fact and traced to its governing source.
Not this A generated summary does not become the controlling source merely by presenting a fact; the governing contract must identify the owner for that particular question.
Reader rule Choose the controlling source by the question. A schema-valid record does not override implementation behaviour, and implementation code alone does not settle what happened in a particular run.
Other names, related terms and sources
Also shown as source of record, governing source
Search handles source owner, authority posture
Source refs standard std_system_term (standard) tool build_microcosm_public_site (public_projection_builder) standard std_validation_artifact_ref (standard)
source_authority · governance Generated from the governed public vocabulary for Plectis.
source body System-local specialization A source body is the actual content of the code or document being referenced.
Meaning scope System-local specialization. The source body is the underlying code or document content. A public bundle may include a bounded copy, whose version and external dependencies determine what can be inspected or reproduced .
Scope A source body makes the included implementation inspectable. It does not by itself establish correctness, behavior on untested inputs, equivalence with a private system, or authority over the data the code may process.
Reader rule The body needs an identifiable version and context to explain which material it represents.
Other names, related terms and sources
Also shown as copied source body
Source refs src/microcosm_core/validators/source_module_boundary.py (source_authority) standards/std_microcosm_batch12_release_claim_language_gate.json (source_authority)
source_body · public projection Generated from the governed public vocabulary for Plectis.
source file General or domain usage A source file contains material from which another artifact is built or defined.
Source files can be written by people or generated by tools. Their role as source is relative to the build or transformation being discussed.
Plectis identifies the owning source and builder so generated material can be refreshed correctly. Editing a generated source copy may be overwritten by the next update unless its upstream owner is changed.
Example Each component page opens its implementation directly, at a named path in the public repository .
Scope A source file shows the material stored at the identified revision and used by a stated build, definition, or transformation. It may contain code, prose, data, schemas, proofs , templates, or configuration ; its authority depends on that role and provenance .
Reader rule Being a source file does not automatically make it the editable authority for every workflow.
Other names, related terms and sources
Also shown as source files
source_file · public projection Generated from the governed public vocabulary for Plectis.
source slice System-coined term A source slice is the explicitly selected source material included in a task, package , or public release .
bounded public source
Meaning scope System-coined term. A source slice is the explicitly selected public subset that backs Plectis’s pages and checks ; it is not an arbitrary excerpt or a claim that the entire working system was exported.
Scope The term covers the published subset of source behind the public pages. A reader meets it wherever the site links a component , paper module , or route back to its underlying code, and most directly on the Source and license page.
Not this A source slice is not the entire working tree and not every unpublished ledger or route. It is only the defined subset of source that has been published for inspection .
Reader rule The inventory determines what the slice includes and excludes.
Other names, related terms and sources
Also shown as public source slice, source-linked slice
Search handles open source slice, public repository slice
Source refs README.md (public_source_root) sites/microcosm/source-map.json (generated_public_source_map)
source_slice · artifact Generated from the governed public vocabulary for Plectis.
sparse checkout General or domain usage A sparse checkout limits which tracked files Git places in the working directory.
It lets someone work on selected directories while the repository 's history and object database may still cover a larger project. This can make a large checkout easier to navigate and use.
Reducing downloads is a separate capability of partial or filtered clones . The public instructions should distinguish those operations so readers understand which files are present locally and which data may still need to be fetched.
Example The reader checkout gives the papers and guides without the Lean toolchain .
Reader rule Sparse checkout alone does not mean that only those files were downloaded.
Other names, related terms and sources
Also shown as sparse checkouts, sparse-checkout
sparse_checkout · public projection Generated from the governed public vocabulary for Plectis.
specification General or domain usage A specification states the requirements an implementation or result is expected to satisfy.
Scope The term covers schemas, formal statements, interface contracts , and documented behaviour requirements.
Not this A broad aspiration without testable or inspectable requirements is not yet a specification.
Reader rule The specification must itself express the intended task accurately.
Other names, related terms and sources
Also shown as specifications, spec, specs, formal specification
specification · public projection Generated from the governed public vocabulary for Plectis.
squarefree General or domain usage Squarefree means having no repeated prime factor for an integer , or no repeated irreducible factor for a nonzero polynomial .
Reader rule The integer 1 and nonzero constant polynomials are squarefree; zero is not. Polynomial factors are taken over the specified coefficient field .
Other names, related terms and sources
Also shown as square-free, squarefree integer, squarefree polynomial, squarefree polynomials
squarefree · public projection Generated from the governed public vocabulary for Plectis.
stack trace General or domain usage A stack trace is a recorded list of active function calls at or near the point where a program failed or was inspected.
It usually names functions , files, and line numbers from the newest call back through its callers. It helps locate an execution path but may expose local paths or sensitive values.
A stack trace is diagnostic evidence about control flow, not a complete explanation of a failure. Optimisation, asynchronous execution , omitted frames, or generated code can make it incomplete or indirect. Plectis distinguishes reporting a degraded provider result from terminating with a stack trace. Public reports should redact private paths and secrets while retaining enough frames to diagnose the failure.
Example A Python traceback lists the failing line and the functions that called it.
Meaning scope General or domain usage. A diagnostic record of active or recent function calls leading to a program point or failure, distinct from repository revision history.
Scope A stack trace locates a sequence of calls. The error, inputs, code, and environment supply the further evidence needed to explain why that path failed.
Not this A list of commits is repository history, not a call stack trace.
Other names, related terms and sources
Also shown as stack traces, call stack trace
Source refs sites/microcosm/docs/paper-module-engine-room-derived-fact-provider-engine.html (reading_context)
stack_trace · public projection Generated from the governed public vocabulary for Plectis.
standard System-local specialization A standard specifies requirements that items or processes are expected to meet.
schema backed contract authority
Meaning scope System-local specialization. Standard means a repo-governed machine-readable contract. It is not an industry, national, or international standard unless the row cites the relevant external standards body.
Scope Plectis standards specify requirements for the artifact kinds they govern . Whether a particular artifact conforms is a separate validation question.
Not this A standard is not a recommendation, a style preference, or a benchmark score. It is a structured contract that defines and governs the shape of one kind of artifact .
Reader rule A standard states the requirement; evidence shows whether an item satisfies it.
Other names, related terms and sources
Also shown as std, schema, contract
Search handles artifact standard
Source refs standard standards_registry (registry) standard core_authority_index (authority_index)
standard · artifact Generated from the governed public vocabulary for Plectis.
star-shaped domain General or domain usage A domain containing every straight segment from one chosen centre to each of its points.
A set U is star-shaped about a if ( 1 − 𝑡 ) 𝑎 + 𝑡 𝑥 ( 1 − t ) a + t x belongs to U for every x in U and 0 ≤ 𝑡 ≤ 1 0 ≤ t ≤ 1 . A convex set is star-shaped about each of its points, but a star-shaped set can have indentations and need not be convex .
The square-root coordinate in #1041 has a star-shaped target, enabling a global inverse after the covering argument. The paper separately warns that a full polynomial lemniscate need not be star-shaped; one useful coordinate domain does not establish that property for every original component .
Meaning scope General or domain usage. Straight segments must remain inside the set for the specified centre; convexity is a stronger condition.
Scope The centre matters: being star-shaped about one point does not establish the property about another. A nonempty star-shaped domain is contractible by straight-line contraction and hence simply connected .
Other names, related terms and sources
Also shown as star-shaped region, star shaped domain
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 1880 (mathematical_source)
star_shaped_domain · mathematical concept Generated from the governed public vocabulary for Plectis.
statement node System-local specialization A statement node is one identified mathematical statement in a graph of results and their relationships.
Meaning scope System-local specialization. A statement node is an authored equivalence class of formal declarations judged to express one mathematical statement; it is not a syntax-tree node or an automatically inferred theorem count.
Scope A statement node records what its declarations establish, no more.
Reader rule Grouping statements requires a justified correspondence, not just similar wording.
Other names, related terms and sources
Also shown as statement nodes
Source refs tool measure_lean_corpus (source_authority)
statement_node · public projection Generated from the governed public vocabulary for Plectis.
static site General or domain usage A static site serves prebuilt files rather than generating each page in response to a reader ’s request.
A builder can create HTML, CSS , JavaScript , JSON , and media files ahead of publication. A web server then returns those files, although JavaScript may still add interaction in the browser .
Static generation makes published output inspectable as files and can reduce runtime infrastructure. Changes usually require rebuilding and publishing new files. Plectis uses a static public site whose builders derive many pages from source registries while preserving stable routes. Some interactive features run in the browser , but no server -side page generation is needed for each visit.
Example A build command writes docs/quickstart.html, which a server later returns unchanged.
Meaning scope General or domain usage. A site served from prebuilt files rather than rendering each page from a database or application request.
Scope Static describes how pages are produced and served; it does not mean the content never changes or that the site contains no scripts.
Not this A database -backed application that renders a fresh page for every request is not a static site.
Other names, related terms and sources
Also shown as static website, statically generated site
Source refs sites/microcosm/SOURCE_CONTRACT.md (reading_context)
static_site · public projection Generated from the governed public vocabulary for Plectis.
stationary bootstrap General or domain usage The stationary bootstrap resamples a time series in blocks of randomly chosen lengths to retain some of its temporal dependence.
In the standard construction, block lengths have a geometric distribution and starting points are sampled from the observed series , with circular continuation at its end. Joining such blocks creates a resampled series .
It preserves local stretches of observations rather than exactly preserving every dependence in the original data. Statistical conclusions still require the sampling assumptions appropriate to the analysis.
Example Blocks of random length are drawn and joined until the resample is as long as the original.
Reader rule Block length choices and assumptions about dependence affect the method's validity.
Other names, related terms and sources
Also shown as block bootstrap
stationary_bootstrap · public projection Generated from the governed public vocabulary for Plectis.
stochastic General or domain usage Stochastic describes a process or model whose outcomes involve probability or randomness.
A stochastic procedure can follow precise rules while producing different outcomes across runs because it samples random choices. Analysis describes distributions, expectations, variability, or event probabilities rather than one guaranteed path. Pseudorandom software also depends on a generator and seed.
A stochastic process, model , or algorithm includes outcomes governed by probability. Its rules may be exact even though individual runs differ, so analysis concerns distributions, expected values , variability, dependence, or event probabilities rather than one fixed path. Computational randomness is normally pseudorandom and becomes repeatable when the generator, seed, implementation , and relevant ordering are fixed. Stochastic variation differs from ignorance about model choice or data quality. A reported sample illustrates possible behavior; it does not alone characterize the underlying probability law or justify a causal conclusion.
Example Two runs of the same prompt can differ; two runs of the same check do not.
Scope Ordinary statistical usage.
Reader rule Separate randomness in the model from uncertainty about the model , and record seeds when exact computational repetition matters.
Other names, related terms and sources
Also shown as stochasticity
stochastic · public projection Generated from the governed public vocabulary for Plectis.
stub General or domain usage A stub is a placeholder representing an item or interface whose full contents or behaviour are not yet supplied.
Reader rule The placeholder's limitations should be explicit wherever its output is used.
Other names, related terms and sources
Also shown as stubs, public-safe stub
stub · public projection Generated from the governed public vocabulary for Plectis.
subcover General or domain usage A subcover is a selection from a collection of covering sets that still covers the same target set.
If three open intervals cover [ 0 , 1 ] [ 0 , 1 ] and two of those intervals already cover every point of [ 0 , 1 ] [ 0 , 1 ] , those two form a subcover. A finite subcover uses finitely many members of the original collection; it need not be the smallest possible choice.
Compactness requires a finite subcover for every open cover . The condition is stronger than the existence of one finite open cover : any subset of the real line is covered by the whole real line, but many subsets are not compact . The empty collection covers the empty set, so it is a finite subcover when the target is empty. These distinctions keep the quantifiers in compactness arguments precise.
Scope The selected sets must come from the given cover; replacing them with a newly invented covering set does not produce a subcover.
Other names, related terms and sources
Also shown as finite subcover
Source refs governed vocabulary term_registry (reading_context)
subcover · mathematical concept Generated from the governed public vocabulary for Plectis.
subexponential growth General or domain usage Growth slower than every fixed exponential 𝑐 𝑛 c n with 𝑐 > 1 c > 1 .
Meaning scope General or domain usage. Asymptotic analysis. Subexponential does not mean slow or polynomial .
Scope For positive sequences 𝑎 𝑛 ≥ 1 a n ≥ 1 , a standard equivalent condition is l o g ( 𝑎 𝑛 ) / 𝑛 → 0 log ( a n ) / n → 0 . The comparison must hold against every fixed exponential base greater than one, rather than against just one especially large base.
Other names, related terms and sources
Also shown as subexponential
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 2123 (mathematical_source)
subexponential_growth · mathematical concept Generated from the governed public vocabulary for Plectis.
subharmonic function General or domain usage A subharmonic function never exceeds its average on a small surrounding circle and satisfies an upper-semicontinuity condition that rules out downward jumps at a point.
For example, | 𝑧 | 2 | z | 2 is subharmonic: its average around a circle centred at z is larger than its value at z. A harmonic function has equality . Subharmonic functions may take the value − ∞ − ∞ , as l o g | 𝑓 | log | f | does at a zero of a holomorphic function f.
On a plane domain, the standard definition requires upper semicontinuity, local integrability, and the sub-mean inequality on discs contained in the domain; one usually excludes the function identically − ∞ − ∞ . Upper semicontinuity means nearby limiting values cannot exceed the value at the point. The papers apply subharmonicity to squared moduli of analytic quantities, bounding an interior value by an average that can be evaluated using coefficients .
Example The function | 𝑧 | 2 | z | 2 is subharmonic because its circular average around a point exceeds its central value.
Meaning scope General or domain usage. Subharmonicity compares a value with nearby averages. It differs from convexity , which compares values along line segments.
Scope For twice differentiable real functions on a planar domain, subharmonicity is equivalent to a nonnegative Laplacian. The average condition is the more general definition and requires upper semicontinuity; it is not ordinary convexity along every line.
Other names, related terms and sources
Also shown as subharmonicity
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 929 (mathematical_source)
subharmonic_function · mathematical concept Generated from the governed public vocabulary for Plectis.
sublevel set General or domain usage The region where a real-valued function is at most a chosen level; the strict version uses less than.
For g and a threshold c, the sublevel set is { 𝑥 : 𝑔 ( 𝑥 ) ≤ 𝑐 } { x : g ( x ) ≤ c } ; its strict version is { 𝑥 : 𝑔 ( 𝑥 ) < 𝑐 } { x : g ( x ) < c } . If g is continuous, the first is closed and the second is open. Neither need be connected.
Erdős #1041 asks for a connection inside | 𝑝 ( 𝑧 ) | < 1 | p ( z ) | < 1 . The paper also constructs paths in smaller closed regions | 𝑝 ( 𝑧 ) | ≤ 𝑎 | p ( z ) | ≤ a with 𝑎 < 1 a < 1 ; these do lie in the required open region . A construction only in | 𝑝 ( 𝑧 ) | ≤ 1 | p ( z ) | ≤ 1 needs a separate argument to remove boundary contact.
Meaning scope General or domain usage. The strict/non-strict distinction controls the actual path-containment claim in #1041.
Scope State whether equality is allowed. A path permitted to touch the boundary of a closed sublevel set can fail to lie in the corresponding strict sublevel set.
Other names, related terms and sources
Also shown as polynomial sublevel set
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::res:critical-value-thresholds (mathematical_source)
sublevel_set · mathematical concept Generated from the governed public vocabulary for Plectis.
subsequence General or domain usage A sequence formed by retaining terms at increasing indices .
From 1,2,3,4,…, selecting indices 2,4,6,… produces the subsequence 2,4,6,…. Selecting square indices produces 1,4,9,16,…. Terms retain their original order although the gaps between chosen indices may grow.
Sparse exceptional behavior may survive along a subsequence even when its proportion among all indices tends to zero. Consequently, typical or density-one estimates may be insufficient when a proof must exclude infinitely recurring exceptional denominator states.
Meaning scope General or domain usage. Sequences and limits . Do not confuse subsequence with a consecutive block.
Scope A subsequence has form 𝑎 𝑛 1 a n 1 , 𝑎 𝑛 2 a n 2 , … with 𝑛 1 < 𝑛 2 < … n 1 < n 2 < … . It need not be consecutive, but it preserves order. Every subsequence of a convergent sequence has the same limit .
Other names, related terms and sources
Also shown as subsequences
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 1184 (mathematical_source)
subsequence · mathematical concept Generated from the governed public vocabulary for Plectis.
subseries General or domain usage A subseries is formed by selecting terms from a series and keeping them in their original order.
Scope Selection differs from rearrangement: a rearrangement keeps all terms but changes their order.
Other names, related terms and sources
Also shown as selected subseries, support subseries
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::line 1 (mathematical_source)
subseries · mathematical concept Generated from the governed public vocabulary for Plectis.
subset General or domain usage A set A is a subset of B if every element of A also belongs to B.
The notation 𝐴 ⊆ 𝐵 A ⊆ B permits equality . For example, { 2 , 4 } { 2 , 4 } is a subset of the even integers , and every set is a subset of itself. A proper subset excludes equality and therefore leaves at least one member of the larger set outside it.
The papers use subsets to specify allowed indices , regions, and candidate families. Inclusion alone does not say that the subset is large, connected, dense , or representative of the larger set.
Scope The empty set is a subset of every set because it has no element that could violate the condition.
Other names, related terms and sources
Also shown as subsets, proper subset
Source refs governed vocabulary term_registry (reading_context)
subset · mathematical concept Generated from the governed public vocabulary for Plectis.
substrate System-local specialization Here, substrate means the underlying files, stored state, and tools on which the system operates.
underlying working base
It includes the concrete material an agent can inspect or change, beneath the pages and summaries that describe it. Plectis uses the term when distinguishing direct access to working material from access to a copied explanation.
A webpage can accurately describe a file without granting access to that file or permission to change it. Type A and Type B describe this access distinction in the project's actor vocabulary.
Example The Source and license page is the entry point into this substrate, opening onto the source files and records that the rest of the site is generated from. See it live: Source & license open the source layer the pages are generated from
Meaning scope System-local specialization. Substrate means the live files, records , or runtime state on which this system operates. It is a local systems metaphor, not a biological, chemical, or philosophical substrate claim .
Scope The term covers the source layer of the whole system: files, standards , ledgers, recorded state, and tooling. A reader meets it wherever the pages distinguish the generated public view from the source it was derived from.
Not this A substrate is not a vague word for the whole project, and not a mystical layer behind it. It is the specific, inspectable set of files and records that the pages are generated from.
Reader rule The source 's role determines what it can authoritatively establish.
Other names, related terms and sources
Also shown as source substrate, workflow substrate
Search handles live substrate, runtime substrate
Source refs doctrine module microcosm_substrate (paper_module) AGENTS.override.md (agent_seed)
substrate · substrate Generated from the governed public vocabulary for Plectis.
subsum General or domain usage A subsum is the value obtained by selecting some terms of a series and adding them.
Scope A subsum is one value; the achievement set is the set of all such values. A restricted achievement set imposes further conditions on the selections.
Reader rule Convergence of a conditionally convergent series does not guarantee convergence of every subseries . Absolute convergence does, and nonnegative convergent series have all subsums between zero and their full sum .
Other names, related terms and sources
Also shown as subsums
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
subsum · public projection Generated from the governed public vocabulary for Plectis.
sum General or domain usage A sum is the result of adding quantities together.
A finite sum adds a specified number of terms. An infinite series uses the limit of finite partial sums when that limit exists. The symbol ∑ ∑ abbreviates a sum with its index and range stated alongside it.
The papers distinguish exact finite arithmetic from conclusions about infinite sums. Passing from one to the other requires convergence and, when terms are rearranged, the appropriate justification for that rearrangement.
Example 𝑆 𝐹 ( 𝑏 ) = ∑ 𝑛 ∈ 𝐹 1 / ( 𝑏 𝑛 − 1 ) S F ( b ) = ∑ n ∈ F 1 / ( b n − 1 ) is a finite exact sum when F is finite ; the full Erdős construction is an infinite sum.
Reader rule The range and order of summation can be part of the mathematical claim .
Other names, related terms and sources
Also shown as addition result
Search handles finite sum, sums
sum · mathematical concept Generated from the governed public vocabulary for Plectis.
summability General or domain usage Summability means that a family of terms has a sum under a specified definition of infinite summation.
For a nonnegative sequence , it means the partial sums are bounded and hence converge to a finite total. For real or complex families indexed without an order, the usual unconditional notion corresponds to absolute summability.
In Lean , Summable has a formal meaning that should be checked for the relevant index and space. A convergent ordered series need not be summable in every stronger, order-independent sense.
Scope The terms, weighting, and summation convention are part of the claim .
Other names, related terms and sources
Also shown as summable
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos-243-reciprocal-tail-rigidity.tex::line 353 (mathematical_source)
summability · mathematical concept Generated from the governed public vocabulary for Plectis.
summable divisor cover General or domain usage In the #257 paper , a summable divisor cover groups exponents into finite sets with nonnegative divisor bounds whose full costs have finite sum .
For a finite exponent set F, let 𝑓 𝐹 ( 𝑛 ) f F ( n ) count members of F dividing n. The criterion bounds 𝑓 𝐹 ( 𝑛 ) 𝛼 f F ( n ) α by ∑ 𝑑 ∣ 𝑛 𝑐 𝑑 ∑ d ∣ n c d , with 𝑐 𝑑 ≥ 0 c d ≥ 0 and 0 < 𝛼 ≤ 1 0 < α ≤ 1 . Its cost depends on 𝐶 = ∑ 𝑑 𝑐 𝑑 / 𝑑 C = ∑ d c d / d .
Precisely, for finite 𝐹 𝑗 F j and coefficients 𝑐 𝑗 , 𝑑 c j , d as above, the paper requires ∑ 𝑗 𝐶 𝑗 2 𝑗 𝛼 𝑗 / ( 2 𝛼 𝑗 − 1 ) < ∞ ∑ j C j 2 j α j / ( 2 α j − 1 ) < ∞ . It then proves irrationality of ∑ 𝑎 ∈ 𝐴 1 / ( 𝑏 𝑎 − 1 ) ∑ a ∈ A 1 / ( b a − 1 ) for every infinite 𝐴 ⊆ ⋃ 𝑗 𝐹 𝑗 A ⊆ ⋃ j F j and integer 𝑏 ≥ 2 b ≥ 2 . This is a specific criterion, distinct from a topological open cover or a claim that all infinite supports qualify.
Meaning scope General or domain usage. This row explains the named criterion in the #257 manuscript. It does not propose a universal meaning for every use of divisor cover.
Scope A separate finite cover exists for every finite F. The theorem requires summability across the entire sequence of finite sets , including the scale and fractional-power factors .
Other names, related terms and sources
Also shown as divisor-cover criterion, divisor cover, summable divisor-cover criterion
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::thm:variable-fractional-cover (mathematical_source)
divisor_cover · mathematical concept Generated from the governed public vocabulary for Plectis.
summation by parts General or domain usage Summation by parts is a finite -sum identity that transfers differences from one factor to partial sums of the other.
Other names, related terms and sources
Also shown as Abel summation, discrete integration by parts
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos251-prime-gap-reasoning-surface.tex::long251:sec:parts (mathematical_source)
summation_by_parts · mathematical concept Generated from the governed public vocabulary for Plectis.
superior predictive ability General or domain usage Hansen's superior predictive ability test assesses whether any candidate forecasting method has lower expected loss than a benchmark .
It compares a collection of methods jointly rather than treating the best observed performer as if it had been selected in advance. The procedure accounts for sampling variation and the comparison across candidates under its assumptions .
A rejection provides evidence against the benchmark 's equal -or-better expected performance in the tested setting. It does not prove a particular method will outperform forever or explain why a difference occurs.
Example Testing fifty strategies against one benchmark needs a correction of this kind.
Scope Named for Peter Reinhard Hansen; standard in forecast evaluation and not a contribution of this work.
Reader rule The loss function , candidate set, dependence model , and resampling choices affect the inference.
Other names, related terms and sources
Also shown as Hansen's SPA test
Search handles spa test
superior_predictive_ability · public projection Generated from the governed public vocabulary for Plectis.
support General or domain usage For a sequence , support is the set of indices with nonzero terms; in evidential prose it means what backs a claim .
Meaning scope General or domain usage. Plectis uses support for evidence backing a claim and for the mathematical set of included indices ; neither sense licenses conclusions about the other.
Scope Covers the two active Plectis senses (claim support and series support) and explicitly disambiguates them.
Reader rule For a series support, membership selects a term; it does not assert that the terms form a finite set or satisfy the paper ’s weighted hypothesis .
Other names, related terms and sources
Also shown as support of a series, index support, exponent support
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex (mathematical_source)
support · public projection Generated from the governed public vocabulary for Plectis.
supremum General or domain usage The smallest number greater than or equal to every member of a set.
The open interval (0,1) has supremum 1 even though it has no largest member. Every element is at most 1, and any smaller proposed upper bound is exceeded by points sufficiently close to 1.
The irrationality exponent is a supremum over approximation exponents achieved infinitely often. Calling it a supremum allows a sharp boundary value even when no single family of rational approximations attains that boundary exponent .
Meaning scope General or domain usage. Ordered number systems. Supremum and maximum are not interchangeable.
Scope A maximum must be attained; a supremum need not be. Unbounded -above sets may have supremum + ∞ + ∞ in the extended reals, and conventions for the empty set must be stated.
Other names, related terms and sources
Also shown as least upper bound, sup
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex::line 291 (mathematical_source)
supremum · mathematical concept Generated from the governed public vocabulary for Plectis.
surjective map General or domain usage A function that attains every element of its stated codomain .
Meaning scope General or domain usage. Functions . Onto differs from injective ; a map may have either, both, or neither.
Scope Surjectivity depends on the stated codomain : every allowed target must have at least one input mapping to it. It says nothing about uniqueness of that input; uniqueness belongs to injectivity.
Other names, related terms and sources
Also shown as surjective, surjective function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2522 (mathematical_source)
surjective_map · mathematical concept Generated from the governed public vocabulary for Plectis.
Sylvester's sequence General or domain usage Sylvester's sequence starts with 2, and each later term is one plus the product of all preceding terms.
It begins 2, 3, 7, 43, 1807. With 𝑎 0 = 2 a 0 = 2 , the same rule can be written 𝑎 𝑛 + 1 = 𝑎 𝑛 ( 𝑎 𝑛 − 1 ) + 1 a n + 1 = a n ( a n − 1 ) + 1 , so each next term can be calculated directly from the previous one.
Its terms are pairwise coprime and grow rapidly. Reciprocal identities associated with the sequence make it useful in questions about unit fractions and the values of structured infinite sums.
Example 1807 equals 2 times 3 times 7 times 43 plus 1.
Reader rule The starting value and indexing convention should be checked when comparing formulas.
Other names, related terms and sources
Also shown as Sylvester recurrence
sylvester_sequence · public projection Generated from the governed public vocabulary for Plectis.
synth seed System-coined term A synth seed is a concise, replaceable brief for the current phase of work.
bounded phase working seed
It gathers the goal, reasons for the work, success conditions, relevant sources , and next planned activity. Plectis derives it from durable intent and current state so an agent can start without rereading all earlier material.
As the work changes, the brief can be replaced while the underlying source and historical records remain. Its usefulness depends on staying aligned with the live objective and evidence .
Example The Bridge Phase Continuity Runtime is a concrete place this appears: it is the component that carries phase working state across a continuity boundary and checks that the synthetic continuity between phases holds. See it live: Bridge Phase Continuity Runtime open the component that carries phase working state across a continuity boundary
Meaning scope System-coined term. Synth seed means the local phase whiteboard compiled from source material . It is not operator voice, a random seed, or source authority .
Scope The synth seed covers the planning and execution of one phase or subphase : its goal, success criteria, files, and wave. It is encountered where phase work and continuity across phases are described, alongside components that carry phase state forward.
Not this A synth seed is not the system's permanent statement of intent and not a finished specification . It is a disposable, phase -scoped working model that is replaced as the work advances.
Reader rule It describes the current phase rather than preserving the operator's original words.
Other names, related terms and sources
Also shown as synth_seed, synth_seed.json, synth_seed.md
Search handles phase whiteboard
Related terms derives_from raw_seed Synth seed compresses raw intent into a bounded whiteboard. contains wave Active waves live inside synth phase state.
Source refs standard std_synth_seed (standard) docs/synth_first_scaffold_contract.md (doc)
synth_seed · artifact Generated from the governed public vocabulary for Plectis.
synthetic General or domain usage Synthetic data is deliberately generated rather than directly observed from the real situation being studied.
It may model typical inputs, isolate an edge case, or contain a known fault. Plectis uses synthetic fixtures to make particular checks repeatable and their expected outcomes explicit.
A successful synthetic test establishes what happened under the constructed conditions. Extending that result to real use requires evidence that the relevant conditions and failure mechanisms have been represented adequately.
Example The public repositories contain components and synthetic fixtures; the real data is not published.
Scope Synthetic inputs establish behaviour on those inputs.
Reader rule Generated data is useful when its relationship to the intended behaviour is clear.
Other names, related terms and sources
Also shown as synthetic data, synthetic fixtures
synthetic · public projection Generated from the governed public vocabulary for Plectis.
T
tactic General or domain usage A proof tactic is an instruction that transforms proof goals or constructs part of a formal proof .
Meaning scope General or domain usage. The proof -assistant sense is intended. A tactic operates on formal goals rather than naming a general strategic move or certifying a result by itself.
Scope Success must culminate in an accepted proof of the stated goal. The tactic's name alone does not identify its assumptions or scope .
Other names, related terms and sources
Also shown as proof tactic, proof tactics, Lean tactic
Search handles Lean tactics
Source refs sites/microcosm/maths/documents/residual-progress.html (local_reader_surface)
tactic · mathematical concept Generated from the governed public vocabulary for Plectis.
Taylor series General or domain usage A Taylor series is the power series whose coefficients are determined by a function ’s derivatives at a chosen point.
For one variable , the coefficient of ( 𝑥 − 𝑐 ) 𝑛 ( x − c ) n is 𝑓 ( 𝑛 ) ( 𝑐 ) / 𝑛 ! f ( n ) ( c ) / n ! . The exponential has Taylor series 1 + 𝑥 + 𝑥 2 / 2 ! + … 1 + x + x 2 / 2 ! + … at zero. Its partial sums give polynomial approximations, with error controlled by a separate remainder estimate.
For example, e x p ( − 1 / 𝑥 2 ) exp ( − 1 / x 2 ) , extended by zero at 𝑥 = 0 x = 0 , is smooth and has every derivative zero there, yet it is positive elsewhere. Its Taylor series at zero therefore misses those values. Finite Taylor approximations and infinite series equality make different claims .
Sources
Source refs governed vocabulary term_registry (reading_context)
taylor_series · mathematical concept Generated from the governed public vocabulary for Plectis.
telemetry General or domain usage Telemetry is automatically collected operational data sent or stored for observing a system away from the point where events occur.
Request counts, error rates, timings, resource use, and selected event traces can be telemetry. It describes instrumented observations, not a complete or neutral record of everything the system did.
Telemetry can reveal failures, performance changes, and usage patterns across many machines, but instrumentation choices determine what remains invisible. Sampling can miss rare events; aggregation can hide individual cases; clock skew and dropped messages can distort sequences . Collection may also carry privacy , security, and cost constraints. A dashboard is a presentation of telemetry rather than the raw evidence itself. Interpreting a change requires checking definitions and collection changes before concluding that the underlying system or user behavior changed.
Scope Telemetry is defined by its events, sampling, fields, aggregation, retention, transmission, access controls, and relationship to the system state being inferred.
Other names, related terms and sources
Also shown as telemetry data, telemetry signal
Source refs sites/microcosm/docs/paper-module-agent-route-observability-runtime.html (reading_context) sites/microcosm/docs/architecture.html (reading_context)
telemetry · public projection Generated from the governed public vocabulary for Plectis.
telescoping identity General or domain usage A telescoping sum is one in which cancellations reduce a long sum to a few endpoint terms.
For example, ( 𝑏 1 − 𝑏 2 ) + ( 𝑏 2 − 𝑏 3 ) + ⋯ + ( 𝑏 𝑁 − 𝑏 𝑁 + 1 ) ( b 1 − b 2 ) + ( b 2 − b 3 ) + ⋯ + ( b N − b N + 1 ) equals 𝑏 1 − 𝑏 𝑁 + 1 b 1 − b N + 1 . The intermediate terms cancel in this finite identity.
This method turns certain factorial fractions or recurrence differences into exact formulas. Writing down the finite cancellation first prevents an infinite argument from assuming, without proof , that its final boundary term disappears.
Other names, related terms and sources
Also shown as telescoping sum, telescoping series, telescoping, telescopes, telescoped sum
Source refs sites/microcosm/papers/source/plectis-erdos/paper/68/erdos-68-factorial-denominator-irrationality.tex::line 165 (mathematical_source)
telescoping_identity · mathematical concept Generated from the governed public vocabulary for Plectis.
terminal General or domain usage A terminal provides a text interface for interacting with programs , commonly through a command-line shell .
A terminal displays text and passes keyboard input to the program using it. That program may be a shell with a command prompt, a text editor, or another interactive application. A terminal emulator supplies this interface in a desktop window.
The site's runnable instructions use this route so readers can repeat named operations. A command's exit status and saved outputs help establish what happened beyond the text displayed while it ran.
Example The quickstart lists each command in full, so a reader runs the same thing the author ran.
Scope A terminal command establishes what that command did on the machine it ran on.
Reader rule The terminal is the interface ; the shell interprets the command and starts the requested process.
Other names, related terms and sources
Also shown as terminal emulator, terminal window
terminal · public projection Generated from the governed public vocabulary for Plectis.
test System-local specialization A test examines whether something behaves as expected under specified conditions.
Software tests supply inputs or setup, execute code, and compare the result with an assertion or other expectation. Plectis publishes tests alongside components to make the advertised behaviour inspectable.
Formal proof checking is a different form of verification and can establish a quantified statement under explicit assumptions . Both are valuable, but their guarantees should be described according to what the underlying method actually checks .
Example The closeout -faithfulness component 's test module is part of the public CI floor .
Meaning scope System-local specialization. On this site, test means a procedure with specified setup or inputs and an expected condition, including software tests, Lean checks , release gates , and component fixtures . A test establishes only the behaviour and cases it actually exercises; it need not be shipped by a public component .
Scope Covers procedures that examine behaviour against a stated expectation, whether attached to a public component , a mathematical formalization , a build or release gate , or another bounded evaluation. Its evidential reach is limited to the tested inputs, conditions, and assertion.
Not this Running a program with no expected condition is an execution , not a test here.
Reader rule A passing test covers its particular conditions and assertions.
Other names, related terms and sources
Also shown as software test, test run
Search handles tests
test · public projection Generated from the governed public vocabulary for Plectis.
theorem General or domain usage A theorem is a mathematical statement established by proof within stated assumptions and definitions.
Its conclusion applies to every case covered by those assumptions . The word describes a proved result; importance, difficulty, and originality are separate questions.
In Lean , a declaration labelled theorem can still depend on admissions or added axioms unless these are audited . The keyword alone is therefore insufficient evidence that the intended result has been fully proved on the permitted foundations.
Example A theorem proving a denominator identity establishes that identity for every case covered by its hypotheses; whether it is admission-free must be checked from its dependencies and axioms , not inferred from the theorem keyword.
Scope A theorem establishes its own statement under its own hypotheses.
Reader rule Read the theorem together with its hypotheses and the evidence for its proof .
Other names, related terms and sources
Also shown as theorems
theorem · public projection Generated from the governed public vocabulary for Plectis.
threshold General or domain usage A threshold is a boundary value at which a classification, condition, or behavior changes.
A temperature may cross a physical threshold, a theorem may apply when x exceeds 10, or a score may trigger an alert above 0.8. The boundary can arise from nature, mathematics , convention, or policy.
Some thresholds are discovered properties, such as the value where a mathematical regime changes. Others are chosen decision rules that trade missed cases against false alarms, cost, delay, or risk. A threshold need not be selected by policy, and a policy threshold need not reveal a natural discontinuity in the underlying phenomenon. Units, calibration , population, and uncertainty affect interpretation. Crossing a noisy threshold once may not indicate a stable change, while hysteresis or repeated evidence can prevent rapid switching near the boundary.
Scope A threshold includes a measured quantity, comparison direction, boundary value, and consequence; equality at the boundary must be specified when it matters.
Other names, related terms and sources
Also shown as thresholds, decision threshold
Source refs sites/microcosm/docs/open-questions.html (reading_context) sites/microcosm/docs/paper-module-agent-sabotage-scheming-monitor-replay.html (reading_context)
threshold · public projection Generated from the governed public vocabulary for Plectis.
throughput General or domain usage Throughput is the amount of work a system completes per unit of time.
Throughput may count requests, records , tasks, tokens, or other units. It differs from latency , which measures how long one operation takes, and the two can change independently.
A system can increase throughput by parallelising work, batching operations, or reducing cost per item. Higher throughput may increase queueing, resource use, or error rates, so the measure needs conditions and quality bounds . Plectis research prose discusses agent throughput as completed work over time while warning that review and maintenance capacity must grow with it.
Example A service completes 600 validated records per minute under a stated load.
Meaning scope General or domain usage. Work completed per unit time under stated conditions, distinct from the elapsed time of one operation.
Scope State the work unit, time window, load, and success criteria when reporting throughput.
Not this One request finishing in 20 milliseconds is a latency measurement, not a throughput measurement.
Other names, related terms and sources
Also shown as processing rate
Source refs sites/microcosm/lean/experience/papers/open-source-mathematics-strategy.html (reading_context)
throughput · public projection Generated from the governed public vocabulary for Plectis.
timeout General or domain usage A timeout ends or changes waiting behavior when a defined time limit expires before the awaited event is observed.
A client may stop waiting after 30 seconds so one slow call cannot block forever. The server or background job may nevertheless continue and later produce a result.
Connection, read, idle, operation, and overall timeouts measure different intervals. Expiry means the waiting side did not observe completion in time; it does not prove that remote work failed, stopped, or had no side effects . Retrying after a timeout can therefore duplicate effects. Short limits improve responsiveness but may reject legitimate slow work, while long limits consume resources and delay recovery. Cancellation support , idempotency , status lookup, and late-result reconciliation determine whether timeout handling remains correct under uncertainty.
Scope Timeout semantics specify which clock starts, the duration, the event being awaited, whether underlying work is cancelled, and how late completion or repeated attempts are handled.
Other names, related terms and sources
Also shown as time-out, timed out, timeouts
Source refs sites/microcosm/docs/paper-module-bounded-autonomy-campaign-packet.html (reading_context) sites/microcosm/docs/paper-module-formal-math-lean-proof-witness.html (reading_context)
timeout · public projection Generated from the governed public vocabulary for Plectis.
TLS General or domain usage Transport Layer Security, or TLS, is a protocol that encrypts and authenticates a network connection.
Meaning scope General or domain usage. The protocol that protects network communication with encryption, integrity checks , and peer authentication ; encoding data is not equivalent protection.
Scope TLS protects transport between endpoints ; it does not make endpoint software , stored data, or response content trustworthy.
Not this Encoding a file as Base64 does not provide TLS encryption or authentication .
Other names, related terms and sources
Also shown as Transport Layer Security
Source refs sites/microcosm/index.html (prerequisite_context)
tls · public projection Generated from the governed public vocabulary for Plectis.
Tonelli theorem General or domain usage Tonelli’s theorem allows the order of integration of a nonnegative measurable function to be exchanged, even when the value is infinite .
On a product of 𝜎 σ -finite measure spaces, the product integral and both iterated integrals agree for nonnegative measurable functions . Counting measure gives the familiar equality of the two orders of a nonnegative double sum .
The #257 divisor -incidence identity expands 1 / ( 𝑏 𝑎 − 1 ) = ∑ 𝑗 ≥ 1 𝑏 − 𝑎 𝑗 1 / ( b a − 1 ) = ∑ j ≥ 1 b − a j and exchanges the nonnegative sums. Regrouping terms by 𝑛 = 𝑎 𝑗 n = a j then gives 𝑋 𝐴 ( 𝑏 ) = ∑ 𝑛 ≥ 1 𝑐 𝐴 ( 𝑛 ) 𝑏 − 𝑛 X A ( b ) = ∑ n ≥ 1 c A ( n ) b − n . The positivity makes the exchange legitimate before any separate estimate of the final sum ’s size.
Scope Nonnegativity is essential to this version. For signed or complex terms, exchanging summations usually requires an absolute-convergence or integrability argument instead.
Other names, related terms and sources
Also shown as Tonelli's theorem, Tonelli’s theorem, interchanging nonnegative sums
Source refs sites/microcosm/papers/source/plectis-erdos/paper/257/erdos-257-mersenne-support-subseries.tex::eq:incidence (mathematical_source)
tonelli_theorem · mathematical concept Generated from the governed public vocabulary for Plectis.
toolchain General or domain usage A toolchain is the collection of tools used to turn source material into a built, runnable , or checked result.
Scope A toolchain covers the declared tools, versions, configuration , and execution order for one build or check .
Not this Installing one compiler does not establish that the complete project toolchain is available.
Reader rule Reproducing a result often requires the same supported toolchain or a demonstrably compatible one.
Other names, related terms and sources
Also shown as build toolchain, proof toolchain
Search handles compiler toolchain
toolchain · public projection Generated from the governed public vocabulary for Plectis.
torus character General or domain usage A continuous homomorphism from a torus to the complex unit circle.
On ℝ 𝑑 / ℤ 𝑑 R d / Z d , every character has the form 𝜒 𝑘 ( 𝑥 ) = e x p ( 2 𝜋 𝑖 𝑘 ⋅ 𝑥 ) χ k ( x ) = exp ( 2 π i k ⋅ x ) for an integer vector k. Integer coordinates ensure that adding a lattice vector does not change the value. The zero vector gives the constant character one.
In #269, averaging every nonconstant character along the sampled crossing phases gives a geometric sum whose average tends to zero. Approximation by these Fourier functions then proves visits to every open phase region, providing late crossing interchanges.
Meaning scope General or domain usage. The character is a continuous circle-valued group homomorphism; frequencies must match the chosen quotient lattice .
Scope A character is a function on the torus, not a coordinate value or an orbit . Noninteger k generally fails to descend from Euclidean space to the quotient. The integer vector indexing convention depends on the torus coordinate periods.
Other names, related terms and sources
Also shown as integral character of a torus, integer torus character
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::line 1553 (mathematical_source)
torus_character · mathematical concept Generated from the governed public vocabulary for Plectis.
total variation distance General or domain usage Total variation distance is the supremum of the absolute difference between the probabilities two distributions assign to the same event.
For finite outcomes, total variation distance is half the sum of the absolute differences between two probability tables. It ranges from 0 for identical distributions to 1 when the distributions concentrate on disjoint events.
The prime -gap countermodel keeps short-block empirical laws close in total variation while altering the target denominator behavior. This demonstrates that strong statistical resemblance can coexist with decisive arithmetic difference. Total variation here compares probability measures , not the variation of a curve or function .
Meaning scope General or domain usage. Probability and statistics. Different from total variation of a real function or path.
Scope Equivalently, take the largest difference in probability assigned to the same measurable event. Any test valued between 0 and 1 changes in expectation by at most this distance , but arithmetic properties of particular outcomes need not be preserved.
Other names, related terms and sources
Also shown as total variation of distributions
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 111 (mathematical_source)
total_variation_distance · mathematical concept Generated from the governed public vocabulary for Plectis.
total variation of a curve General or domain usage The supremum of sums of successive distances along ordered samples of a parametrized curve.
For 𝛾 : [ 𝑎 , 𝑏 ] → 𝑋 γ : [ a , b ] → X in a metric space , take the supremum of ∑ 𝑑 ( 𝛾 ( 𝑡 𝑖 ) , 𝛾 ( 𝑡 𝑖 − 1 ) ) ∑ d ( γ ( t i ) , γ ( t i − 1 ) ) over all partitions 𝑎 = 𝑡 0 < ⋯ < 𝑡 𝑛 = 𝑏 a = t 0 < ⋯ < t n = b . For a continuous curve this is its metric length and counts every traversal, including retraced pieces.
The #1041 records distinguish a short parametrized path from a small one-dimensional set containing roots. Image-length lower bounds can exclude paths of small total variation, but identifying the two quantities requires controlling repeated traversal and the geometric setting.
Meaning scope General or domain usage. This row concerns variation of a parametrized metric curve; it does not redefine total variation of measures or distributions.
Scope A curve that goes along a segment and then returns has twice the segment length, while its image is only one segment. This quantity differs from Hausdorff measure of the image and from total variation distance between probability distributions .
Other names, related terms and sources
Also shown as path total variation, curve total variation, total variation length
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 123 (mathematical_source)
curve_total_variation · mathematical concept Generated from the governed public vocabulary for Plectis.
totient General or domain usage Euler's totient 𝜑 ( 𝑛 ) φ ( n ) counts the integers from 1 through n that are coprime to the positive integer n.
For example, 𝜑 ( 6 ) = 2 φ ( 6 ) = 2 because only 1 and 5 are coprime to 6 in that range. The definition gives 𝜑 ( 1 ) = 1 φ ( 1 ) = 1 ; for n greater than 1, the qualifying integers are all strictly smaller than n.
The papers use the totient in arithmetic series . Its values encode how prime factors restrict coprimality , linking multiplicative structure with questions about sums and digit expansions.
Example Erdős #249 asks whether the sum of the totient of n over two to the n is irrational .
Reader rule The input must be a positive integer in this definition.
Other names, related terms and sources
Also shown as Euler's totient
totient · public projection Generated from the governed public vocabulary for Plectis.
transaction General or domain usage A transaction groups related operations behind a stated validation and commitment boundary, with guarantees that depend on the system.
A database transaction may promise ACID properties at a documented isolation level. A user or workflow transaction may instead stage actions, validate them, obtain authorization , and commit or abandon selected changes. Those looser uses must not silently inherit strict database guarantees.
Transaction is a family of consistency patterns rather than a universal promise of database ACID behavior. A database transaction may provide atomicity, consistency constraints, isolation, and durability at a stated level. A user or workflow transaction may instead stage changes, validate them, request authorization , then commit or abandon the operation, with weaker recovery guarantees. External messages, network calls, files, and irreversible effects may sit outside the boundary. Readers should ask which actions participate, what validation precedes commitment, how concurrent activity is handled, and what rollback can truly restore.
Example A workflow stages candidate changes, validates them, obtains authorization , and then commits selected effects while recording any external actions outside rollback .
Scope Covers database and workflow commitment boundaries. Only a transaction that explicitly promises atomicity may be described as all-or-none.
Not this Calling a multi-file operation transactional does not guarantee that remote messages, deployments , or partially written files can all be reversed.
Reader rule Readers should ask which actions participate, when commitment occurs, what concurrent observers can see, and which effects rollback can actually reverse.
Other names, related terms and sources
Also shown as transactional, lands as a transaction
transaction · public projection Generated from the governed public vocabulary for Plectis.
transcendental General or domain usage A number is transcendental if it is not a root of any nonzero polynomial with integer coefficients .
Equivalently, it is not algebraic over the rational numbers . Familiar examples include 𝜋 π and e. Every real transcendental number is irrational , but some irrational numbers , such as √ 2 2 , are algebraic.
Proving irrationality alone therefore does not establish transcendence. A transcendence argument must rule out every nonzero integer -coefficient polynomial relation, which is a stronger requirement than ruling out fractions .
Example Pi and e are transcendental; the square root of two is not.
Scope Transcendence of one series says nothing about a related series until a proof connects them.
Reader rule The polynomial must be nonzero: the zero polynomial vanishes at every number.
Other names, related terms and sources
Also shown as transcendence
transcendental · public projection Generated from the governed public vocabulary for Plectis.
transcript General or domain usage A transcript is a textual record of speech or an interaction.
It can preserve what was said, typed, or reported during a session, sometimes with timings and speaker labels. Plectis uses transcripts as inspectable records and source material for later explanation.
Speech recognition can mishear words, and an interaction transcript may omit events outside the captured channel. Important quotations or claims should therefore be checked against the appropriate original recording or execution evidence .
Example An agent 's transcript is what the faithfulness audit reads.
Scope A transcript records one session. It carries no judgement about it.
Reader rule The recording method determines what the transcript captures and where errors may occur.
Other names, related terms and sources
Also shown as transcripts
transcript · public projection Generated from the governed public vocabulary for Plectis.
triangle inequality General or domain usage The distance directly between two points is at most the length of any route through a third.
For numbers, | 𝑥 + 𝑦 | ≤ | 𝑥 | + | 𝑦 | | x + y | ≤ | x | + | y | . Geometrically, traveling from A to C through B cannot be shorter than the direct distance from A to C. Equality needs the two steps to align without backtracking.
Path and polynomial estimates assemble local pieces using triangle inequalities. The step can lose crucial cancellation, so a proof needing a sharp constant may require additional angle, sign, orthogonality, or convexity information rather than repeated triangle bounds.
Meaning scope General or domain usage. Metrics , norms , and absolute values . Equality requires special alignment conditions.
Scope The triangle inequality combines upper bounds after decomposing a quantity. Its reverse form, | | 𝑥 | − | 𝑦 | | ≤ | 𝑥 − 𝑦 | | | x | − | y | | ≤ | x − y | , gives a lower bound on separation from differing sizes. Both depend on the relevant absolute value , norm , or metric .
Other names, related terms and sources
Also shown as triangle bound
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 651 (mathematical_source)
triangle_inequality · mathematical concept Generated from the governed public vocabulary for Plectis.
trinomial General or domain usage A trinomial is a polynomial written as the sum of three nonzero terms.
For example, 𝑧 5 + 2 𝑧 2 − 7 z 5 + 2 z 2 − 7 is a trinomial. The exponents need not be consecutive, and a missing power simply has coefficient zero. The paper studies the form 𝑧 𝑛 + 𝑎 𝑧 𝑚 + 𝑏 z n + a z m + b .
Trinomial describes presentation by three terms, not irreducibility, degree three, or possession of three roots. A cubic is classified by degree; a trinomial is classified by how many nonzero monomials appear.
Example For example, 𝑧 5 + 2 𝑧 2 − 7 z 5 + 2 z 2 − 7 is a trinomial.
Meaning scope General or domain usage. Terms are counted after equal powers have been combined and zero coefficients removed.
Scope Count nonzero terms after combining like powers. A nominal three-term expression can simplify to a binomial if coefficients cancel. “Monic trinomial” additionally says the coefficient of the highest-degree term is one.
Other names, related terms and sources
Also shown as three-term polynomial
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 39 (mathematical_source)
trinomial · mathematical concept Generated from the governed public vocabulary for Plectis.
truth maintenance System-coined term Truth maintenance tracks claims together with their reasons and dependencies so they can be reconsidered when evidence changes.
beliefs with reasons
In AI and knowledge systems, this concerns managing beliefs and justifications. Plectis applies the idea to source records , checks , uncertainty, and decisions that depend on particular claims .
The useful behaviour is responding to a failed assumption or contradictory observation: identify affected conclusions, change their status, and review actions that relied on them rather than preserving an unsupported conclusion unchanged.
Example The Belief-State Process Reward Replay component is one concrete instance: it tracks a belief across a sequence of steps, scoring each step against what the belief should have been at that point and replaying the trajectory to see where a belief was wrongly held or wrongly dropped. See it live: Belief State Process Reward Replay open one component that tracks and scores a belief across steps
Meaning scope System-coined term. Truth maintenance records each claim ’s evidence , dependencies , invalidators, and action consequences; it does not guarantee truth or replace the source that owns the claim .
Scope Truth maintenance covers how beliefs, evidence , and their dependencies are tracked across the system's control plane, separating receipts , model outputs, generated projections , and doctrine commitments so none borrows another's authority . A reader meets it wherever a claim is shown with its supporting evidence , its status, or the conditions under which it would be withdrawn.
Not this Truth maintenance is not a guarantee that the system's beliefs are correct, and it is not a single switch that marks something true or false. It is the ongoing record of why each belief is held and what would change it.
Reader rule Tracking a belief is not a guarantee that the belief is true.
Other names, related terms and sources
Also shown as truth-maintenance, truth_maintenance
Search handles truth-maintenance plane, belief maintenance
Source refs doctrine module workingness_instrument (paper_module) standard std_workingness_instrument (standard)
truth_maintenance · diagnostic Generated from the governed public vocabulary for Plectis.
trying General or domain usage Trying means attempting an action whose outcome is not yet established.
In research, an attempt can produce a proof , counterexample , useful failure, or no decisive result. Plectis keeps relevant evidence from attempts so later work can assess what was learned.
A failed route is useful when its failure is explained precisely enough to guide another decision. Merely recording that an agent spent time on a task does not establish progress on the mathematical or software question.
Example Publishing a remaining obligation next to the lemmas that did check is evidence of trying.
Scope Ordinary English for attempted work. Not a slogan and not a substitute for a check .
Not this Deleting failed routes until only green checks remain is not trying in this sense.
Reader rule The account should distinguish effort from the outcome actually obtained.
Other names, related terms and sources
Also shown as try, to try
Search handles tries, tried
trying · public projection Generated from the governed public vocabulary for Plectis.
Type A System-coined term Type A is the local name for an AI actor with live access and assigned authority over the working system.
substrate-native actor
A Type A actor can inspect current repository state and perform permitted operations. It may be a controller or delegated agent . Write access, test access, and task ownership depend on the tools and permissions assigned to its session.
An actor working from a packet may need Type A to collect evidence or apply a proposal. A delegated agent with live repository tools can already be Type A. A deterministic script is not an AI actor merely because it touches files.
Example A coding-agent session that opens the repository , reads its current files, runs checks , makes edits under the gates , and commits the result is a Type A actor; the "With a coding agent " page shows one in operation. See it live: With a coding agent see a Type A actor operating on the live system
Meaning scope System-coined term. Type A is ai_workflow's coined substrate -authority classification for an AI actor, not a personality type, intelligence ranking, controller-only role, or universal taxonomy.
Scope Classification concerns authority over this working system, independently of model tier or delegation role.
Not this A Type A is not a top capability tier or a mark of seniority, and it is not simply "the controller": a tool-using helper agent with live access to the repository is also Type A, while a capable actor that only reads prepared material without live private state or change authority is not.
Reader rule Classify the actor by access and authority for this substrate . Delegation, intelligence level, and seniority are separate axes.
Other names, related terms and sources
Also shown as type_a, type-a
Search handles substrate-native actor, live substrate actor, controller agent, tool-using controller, iterative controller, harness agent
Source refs doctrine module navigation_hologram_theory (paper_module)
type_a · actor Generated from the governed public vocabulary for Plectis.
Type A judgment System-coined term Type A judgement is the practical reasoning an agent uses when acting on the live system.
judgment grows from traits
It includes noticing a missing connection, checking current evidence , choosing the appropriate owner, and deciding the smallest useful change within the task. Plectis expects the agent to use context rather than wait for every routine step to be prescribed.
For example, an agent can repair a directly affected instruction while preserving unrelated edits. A broader rule change needs evidence that the local lesson actually generalises.
Example A coding agent working through this system pauses on a standard that no longer matches the code, notices the gap, and records where the correction belongs instead of carrying on regardless; that act of noticing and routing is Type A judgment. See it live: With a coding agent see an agent exercising this judgment over the system
Meaning scope System-coined term. Type A judgment is evidence - and doctrine -grounded discernment by an actor with live substrate access; it is not an intelligence rank, personality trait, or unrestricted license to change the system.
Scope Type A judgment covers the agent -side qualities of working over the system, such as common sense , care, and a critic's eye, and a reader meets it on the pages describing how agents operate over the system, particularly the coding-agent walkthrough.
Not this Type A judgment is not a fixed checklist of virtues an agent is graded against, and it is not a free-floating personal opinion; it is discernment that stays anchored to the system's own rules and records .
Reader rule That discretion remains bounded by permissions , source authority , and consequences.
Other names, related terms and sources
Also shown as type-a judgment, agent judgment
Search handles judgment traits, thinking traits, type a common sense, common sense care passion, care and passion, care + passion, karen passion
Source refs CODEX.md (adapter) CLAUDE.md (adapter) doctrine skill local_to_general_propagation (skill)
type_a_judgment · actor Generated from the governed public vocabulary for Plectis.
Type A metabolism System-coined term Type A metabolism names the maintenance work that requires judgement about the system's structure or rules.
judgment governs unsettled grammar
Meaning scope System-coined term. Type A metabolism is the open-ended governance lane that creates or repairs rules where no settled procedure exists; it is not biological metabolism or routine execution of an existing job.
Scope The term covers the governance -and-decision layer of the system's self-maintenance, as distinct from routine population work. A reader meets it on the architecture map and in the engine-room runtime where unsettled grammar is resolved before work is delegated downstream.
Not this Type A metabolism is not the routine maintenance lane that applies rules already in place, and it is not a biological process. It is the decision layer that sets new rules under validation when none exist yet.
Reader rule This is a workflow category rather than a measure of an actor's intelligence .
Other names, related terms and sources
Also shown as type_a_metabolism, Type-A metabolism
Search handles controller metabolism, judgment metabolism, grammar metabolism
Source refs doctrine module navigation_hologram_theory (paper_module)
type_a_metabolism · runtime Generated from the governed public vocabulary for Plectis.
Type A operating register System-coined term The Type A operating register describes the conduct expected of an agent working directly on the system.
care and judgment register
It includes understanding the user's aim, caring for the material touched, checking outcomes, preserving unrelated work, and recording useful lessons where future work will find them.
The named traits, such as care and common sense , should produce observable decisions and follow-through. They do not replace explicit instructions, permissions , or evidence that a task has actually been completed.
Example The conduct shown on the "With a coding agent " page is a concrete instance: an agent reads the substrate , makes a bounded change, records what it learned, and routes that finding into a durable plane rather than dropping it. See it live: With a coding agent see a capable controller working the substrate in this register
Meaning scope System-coined term. The Type A operating register is the expected conduct of an actor working on the live substrate ; it is not a personality profile, capability tier, or claim that every Type A actor behaves well.
Scope The term covers the conduct expected of capable controlling agents , the coding agents and operators that act on the system, and appears wherever the pages describe how such an agent stewarded the substrate , spotted findings, and propagated them. It is encountered most directly on the page describing work alongside a coding agent .
Not this A Type A operating register is not a personality, a tone of voice, or a marketing claim about enthusiasm. It is also not a passive end-user mode; it describes a controller acting on the system, with the duty to steward what it touches and to route what it finds.
Reader rule “Register” here means a style of working, not a database or processor register.
Other names, related terms and sources
Also shown as type_a_operating_register, operational register type a care passion
Search handles type-a operating register, type a useful findings, useful findings register, care passion common sense judgment packet, care and passion, care + passion, karen passion
Source refs CODEX.md::PRIME DIRECTIVE (companion 2) (adapter) CLAUDE.md::PRIME DIRECTIVE (companion 3) (adapter) doctrine skill local_to_general_propagation (skill)
type_a_operating_register · actor Generated from the governed public vocabulary for Plectis.
Type B System-coined term Type B is the local name for an AI actor reasoning without direct authority over the working system.
external or injected-context cognition
Type B works from supplied context or externally available evidence . It may research, criticise, or propose a proof or patch using its own tools, but cannot inspect or change private live state it has not been given access to.
The distinction measures neither intelligence nor delegation. Web tools and a separate execution environment can enrich evidence without granting repository authority . If an actor receives live substrate access, classify it by the authority it actually has.
Example A general assistant in a chat or browser window, asked a framing or research question and given a pasted block of context to work from, is acting as a Type B actor: it reasons over what it was shown and returns an answer, without reaching into the live repository itself. See it live: With a coding agent see where an external agent works over handed-in context rather than the live repository
Meaning scope System-coined term. Type B is ai_workflow's coined counterpart to Type A , naming a relation to a particular substrate rather than an intrinsic capability limit or every helper agent .
Scope External tools can supply evidence without granting direct authority over this repository .
Not this A Type B is not a lower intelligence tier and not simply any delegated worker. An agent that has direct, live access to the repository 's files and commands is Type A , even when it has been delegated a task.
Reader rule Treat its output as candidate material until an authorised actor checks it against the relevant source and applies any required change.
Other names, related terms and sources
Also shown as type_b, type-b
Search handles external cognition lane, operator HUD, operator-hud type b, chatgpt web, bridge actor
Source refs docs/bridge_operating_system.md (bridge_os)
type_b · actor Generated from the governed public vocabulary for Plectis.
Type B metabolism System-coined term Type B metabolism names the routine upkeep of structures whose rules, inputs, and expected outputs have already been defined.
bounded workers populate rows
Meaning scope System-coined term. Type B metabolism is repeatable upkeep after the target shape and checks are fixed; it is not the Type B actor classification itself, creative rule-setting, or final promotion authority .
Scope The term covers the system's maintenance and population runtime : sync, projection refresh, compression -band filling, duplicate detection, evidence -pointer checks , and draft row patches. A reader meets it wherever the architecture or a paper module explains how surfaces are generated and kept up to date.
Not this Type B metabolism is not the creative work of designing how a thing should be structured in the first place, and it is not the moment a result is finally approved or made public. It is the bounded , validated , repeatable work that runs once the shape is already known.
Reader rule This workflow label should be distinguished from the Type B actor-access label.
Other names, related terms and sources
Also shown as type_b_metabolism, Type-B metabolism
Search handles bounded metabolism, deterministic metabolism, worker metabolism, population metabolism
Source refs doctrine module continuous_runtime_layer (paper_module)
type_b_metabolism · runtime Generated from the governed public vocabulary for Plectis.
type checker General or domain usage A type checker checks whether an expression obeys a formal language's typing rules.
Other names, related terms and sources
Also shown as type checkers, type checking, type-checking
Source refs sites/microcosm/papers/source/plectis-erdos/paper/systems/claim-faithful-publication-systems-paper.tex (local_manuscript)
type_checker · proof infrastructure Generated from the governed public vocabulary for Plectis.
type class General or domain usage A type class specifies operations or properties that can be supplied by instances for particular types.
It supports using common notation or generic code with different implementations . A mathematical class can bundle algebraic operations and laws; another can provide finite enumeration or a method for deciding a predicate.
Lean 's finite -family arguments use Fintype information for bounded index types. Class-based resolution supplies it where required, so the theorem can use generic finite sums without manually passing every supporting implementation .
Meaning scope General or domain usage. The type-class mechanism from typed programming and proof assistants is intended, with Lean as the local implementation . It is distinct from an object-oriented class or a capability category for agents .
Scope A class states what must be provided. An instance supplies those data or proofs ; declaring a requirement is different from finding a suitable instance.
Other names, related terms and sources
Also shown as type classes, typeclass, typeclasses
type_class · proof infrastructure Generated from the governed public vocabulary for Plectis.
type theory General or domain usage Type theory studies formal systems in which expressions have types governing how they can be combined.
Meaning scope General or domain usage. The logical and programming-language discipline is intended. Lean is one implementation with specific rules, rather than the definition of every type theory.
Scope The rules and available axioms depend on the particular type theory; sharing the word type does not make different systems interchangeable.
Other names, related terms and sources
Also shown as type theories
Source refs sites/microcosm/maths/documents/methodology.html (local_reader_surface)
type_theory · mathematical concept Generated from the governed public vocabulary for Plectis.
typed refusal System-coined term A typed refusal is a structured result saying that an operation could not proceed, with a specific reason.
It distinguishes cases such as missing evidence , unsupported input, failed validation , or timeout . Plectis uses these categories so later work can choose a suitable response instead of receiving a plausible-looking invented value.
A timeout , for example, means the check did not finish within its budget. It is different from the checker finding a counterexample or completing with a failure verdict.
Example The operating loop requires a typed refusal with reason and evidence when a value cannot be produced. See it live: Doctrine operating loop where typed refusal is required
Meaning scope System-coined term. A typed refusal is a local construct: an explicit, reason-carrying no-result when a computation cannot honestly produce a value. It is not a generic HTTP error.
Scope Doctrine copy about honest failure.
Not this An empty page or a crash log is not yet a typed refusal.
Reader rule The refusal reports the operation's limitation; it need not refute the underlying claim .
Other names, related terms and sources
Also shown as typed_refusal, honest no-result
typed_refusal · public projection Generated from the governed public vocabulary for Plectis.
typed relation General or domain usage A typed relation is a connection that states how two identified items are related.
Scope A typed relation records an authored judgement about two statements.
Reader rule The relation type and direction are part of the information being recorded.
Other names, related terms and sources
Also shown as typed relations
typed_relation · public projection Generated from the governed public vocabulary for Plectis.
U
unconditional result General or domain usage An unconditional result needs no additional unresolved hypothesis beyond its stated mathematical setting.
It still has definitions, domain restrictions, and logical foundations. The word distinguishes it from a result whose intended application depends on an open conjecture or other unestablished condition.
A proved equivalence or a theorem about a special case can be unconditional while the broader question remains open . The papers should say both what the result establishes and how it relates to the original target.
Scope Unconditional does not mean assumption -free or that the original research problem is fully solved.
Other names, related terms and sources
Also shown as unconditional theorem, unconditional statement
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex::line 1038 (mathematical_source)
unconditional_result · mathematical concept Generated from the governed public vocabulary for Plectis.
uniform convergence General or domain usage Functions converge uniformly when one sufficiently late stage makes the error small simultaneously at every point of the stated domain.
For every positive tolerance 𝜀 ε , there must be an N such that | 𝑓 𝑛 ( 𝑥 ) − 𝑓 ( 𝑥 ) | < 𝜀 | f n ( x ) − f ( x ) | < ε for all 𝑛 ≥ 𝑁 n ≥ N and all x in the domain. The same N works for every x.
Uniform convergence preserves continuity of continuous functions in the usual metric setting. Passing strict inequalities or derivative bounds to a limit needs additional care; uniform convergence alone does not preserve every property.
Other names, related terms and sources
Also shown as converges uniformly, uniform limit
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos-1041-lemniscate-newton-flow.tex::line 1076 (mathematical_source)
uniform_convergence · mathematical concept Generated from the governed public vocabulary for Plectis.
uninterpretable General or domain usage Here, uninterpretable describes work for which readers do not yet have an adequate account of what it says or why it works.
A formal proof can check while its main idea, relationship to prior work, or intended meaning remains poorly explained. The missing task is to make that content understandable at an appropriate level of expertise.
Useful exposition states the exact result, exposes the decisive argument, and preserves attribution and limits . Community understanding and use require further engagement beyond a machine's acceptance.
Example A long kernel -accepted proof whose authors cannot say where the hard step was is uninterpretable in this sense.
Reader rule The term describes a current gap in understanding, not a proof that understanding is impossible.
Sources
uninterpretable · public projection Generated from the governed public vocabulary for Plectis.
unit disc General or domain usage The open unit disc is the set of complex numbers z with | 𝑧 | < 1 | z | < 1 .
It consists of points at distance less than one from the origin in the complex plane . The closed unit disc uses | 𝑧 | ≤ 1 | z | ≤ 1 and includes its boundary, the unit circle | 𝑧 | = 1 | z | = 1 .
The lemniscate papers use conditions such as | 𝑝 ( 𝑧 ) | < 1 | p ( z ) | < 1 . That says the polynomial 's value lies in the open unit disc; it does not necessarily say the input point z lies there.
Example 0 and 1 / 2 1 / 2 are in the open unit disc; 1 and i are on the unit circle, so not inside it.
Scope Open unit disc in the complex plane unless a page specifies the closed disc.
Not this A disc of radius 1 centred somewhere other than 0 is a different set.
Reader rule Open and closed versions differ precisely at that boundary.
Other names, related terms and sources
Also shown as open unit disc, unit disk
Search handles open unit disk
unit_disc · public projection Generated from the governed public vocabulary for Plectis.
univalent function General or domain usage A univalent function is a holomorphic function that is one-to-one on its domain.
The function 𝑧 ↦ 𝑧 2 z ↦ z 2 is not univalent on the whole complex plane because z and -z have the same image, but it is univalent on a suitably chosen half-plane. A univalent map has no self-overlap on its stated domain.
The paper needs the continued inverse branch to remain injective throughout a disc. That permits distortion and area estimates for its image; a many-to-one analytic map would count overlaps and invalidate that geometric reading.
Example The function 𝑧 ↦ 𝑧 2 z ↦ z 2 is not univalent on the whole complex plane because z and -z have the same image, but it is univalent on a suitably chosen half-plane.
Meaning scope General or domain usage. Univalence means one-to-one on the whole specified domain, not merely near each point.
Scope Univalence is domain-relative and stronger than having nonzero derivative at one point. A holomorphic function with nonzero derivative is locally one-to-one , yet may still take the same value at distant points.
Other names, related terms and sources
Also shown as univalent, schlicht function
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 62 (mathematical_source)
univalent_function · mathematical concept Generated from the governed public vocabulary for Plectis.
universal quantifier General or domain usage A universal quantifier states that a property holds for every element of a specified domain.
The symbol ∀ ∀ means “for every.” For example, ∀ 𝑛 ∈ ℕ , 𝑛 + 1 > 𝑛 ∀ n ∈ N , n + 1 > n says that adding one increases every natural number . One counterexample would refute the statement; a finite sample usually cannot prove it.
“For every n, there exists m greater than n” permits a different m for each n. “There exists m greater than every n” asks for one choice working for all n. These statements have different truth values over the natural numbers .
Scope The domain and the order of quantifiers determine the claim , including whether later choices can depend on earlier inputs.
Other names, related terms and sources
Also shown as universal quantification
Source refs governed vocabulary term_registry (reading_context)
universal_quantifier · mathematical concept Generated from the governed public vocabulary for Plectis.
unramified prime General or domain usage A prime is unramified in a number-field extension when its factorization upstairs contains no repeated prime -ideal power, equivalently every ramification index is one.
Meaning scope General or domain usage. Unramified means no multiplicity in the prime factorization upstairs. A prime can be unramified and still split into several primes .
Scope For a base prime p, “unramified in L” means that every prime ideal P above p has ramification index 𝑒 ( 𝑃 / 𝑝 ) = 1 e ( P / p ) = 1 . This does not mean there is only one P above p. In the number-field setting the residue extensions are finite -field extensions and hence separable.
Other names, related terms and sources
Also shown as unramified rational prime
Source refs sites/microcosm/papers/source/plectis-erdos/paper/243/erdos243-reciprocal-tail-reasoning-surface.tex::line 283 (mathematical_source)
unramified_prime · mathematical concept Generated from the governed public vocabulary for Plectis.
up-propagate System-coined term To up-propagate is to place a reusable lesson in the shared source that should guide future relevant work.
move learning upward
Plectis uses the move when a local correction reveals a missing rule, instruction, or relationship. The lesson is expressed with its evidence and limits , then attached to an existing owner such as a skill or standard .
This prevents repeated rediscovery without converting every local fix into a system-wide rule. The changed source should be discoverable through the workflow that needs it.
Example The axiom on provenance propagation and non-interference, AX-8, is a concrete instance: it states how a local lesson may be carried into a higher artifact while preserving where it came from and without disturbing the artifact it joins. See it live: Provenance propagation and non-interference open the axiom that governs carrying a local lesson upward
Meaning scope System-coined term. Up-propagate means moving a reusable local lesson into the least-authoritative durable artifact that can honestly carry it; it does not promote every observation into doctrine .
Scope The term covers the upward movement of learning across the system's layers, from local tasks and signals up to skills , standards , paper modules , seeds, and axioms . A reader meets it in the doctrine and rules pages, particularly around the axiom on provenance propagation, and wherever the system explains how a local case improved a shared artifact .
Not this Up-propagation is not a promotion of every observation into formal doctrine , and it is not a one-way push that overwrites the artifact it joins. It is the routing of a single local lesson into the most modest durable layer that can hold it.
Reader rule The appropriate destination is the narrowest one that can carry the supported lesson.
Other names, related terms and sources
Also shown as uppropagate, up propagate
Search handles up propagation, uppropagation
Source refs doctrine module local_to_general_propagation (paper_module) doctrine skill local_to_general_propagation (skill)
up_propagate · propagation Generated from the governed public vocabulary for Plectis.
upper asymptotic density General or domain usage Upper asymptotic density is the limit superior of the fraction of positive integers up to N belonging to a set.
For 𝐴 ⊆ { 1 , 2 , … } A ⊆ { 1 , 2 , … } , it is l i m s u p 𝑁 → ∞ | 𝐴 ∩ { 1 , … , 𝑁 } | / 𝑁 lim sup N → ∞ | A ∩ { 1 , … , N } | / N . It exists even when the fractions oscillate and ordinary density does not.
An infinite set can have upper density zero, as the squares do. Density describes frequency, not the size of a weighted series : a density-zero set can still have a divergent reciprocal sum . The #251 paper uses the stronger upper Banach density zero for its correction support .
Scope Upper density zero forces ordinary density zero. This uses intervals starting at 1; upper Banach density also controls translated intervals and is a stronger sparsity condition.
Other names, related terms and sources
Also shown as upper density, upper natural density
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex (mathematical_source)
upper_asymptotic_density · mathematical concept Generated from the governed public vocabulary for Plectis.
upper Banach density General or domain usage Upper Banach density measures the largest asymptotic proportion of a set inside long intervals, wherever those intervals start.
For 𝑆 ⊆ ℕ S ⊆ N , it is l i m 𝐻 → ∞ s u p 𝑢 ≥ 0 | 𝑆 ∩ { 𝑢 , … , 𝑢 + 𝐻 − 1 } | / 𝐻 lim H → ∞ sup u ≥ 0 | S ∩ { u , … , u + H − 1 } | / H . Density zero means every sufficiently long interval has a small proportion of points in S, uniformly in its starting position.
The #251 correction theorem puts every correction support inside one set of upper Banach density zero. This uniform sparsity helps control how often a fixed-length block can encounter a changed index , even when the observation window moves.
Other names, related terms and sources
Also shown as upper Banach density zero
Source refs sites/microcosm/papers/source/plectis-erdos/paper/251/erdos-251-prime-gap-dyadic-series.tex (mathematical_source)
upper_banach_density · mathematical concept Generated from the governed public vocabulary for Plectis.
upstream General or domain usage Upstream describes a source or earlier stage whose output, changes, or decisions flow into a specified consumer.
An upstream repository can supply imported code, an upstream service can answer requests, and an upstream pipeline stage can produce input for later stages. The direction is always relative to a named flow.
Upstream names direction in a flow of code, data, work, or authority . A fork receives changes from its upstream repository ; a processing stage receives records from an earlier producer ; a service may depend on an upstream service for responses. Changes or failures can propagate to downstream consumers even when their local files or configuration remain untouched. The word does not identify ownership or superiority, and it has no absolute direction outside a stated relationship. In physical geography it retains its river meaning, while technical prose usually supplies repository , service, dependency , or pipeline context.
Scope An object is upstream only with respect to a particular dependency or data path, and the same object may be downstream in another relationship.
Other names, related terms and sources
Also shown as upstream source, upstream dependency
Source refs sites/microcosm/docs/doctrine.html (reading_context) sites/microcosm/docs/rules-and-ideas.html (reading_context)
upstream · public projection Generated from the governed public vocabulary for Plectis.
URL General or domain usage A URL is a structured identifier for a resource, commonly giving a network address and a way to access it.
A web URL can contain a scheme such as https, a host, a path, a query, and a fragment. Not every URL names a remote file: a data: URL carries content directly, and a relative URL gets part of its meaning from a base URL.
An absolute URL includes a scheme; a relative reference is resolved against a base, usually the current page. Queries can select a response, while fragments identify a part or view of the resource and are not included in an HTTP request. Plectis uses stable URLs and fragments so a link can return to the same guide, theorem , or glossary entry after the source files are reorganized.
Example https://example.org/docs/guide.html#setup locates the setup section of a web document.
Meaning scope General or domain usage. URLs can address network resources, local files, or inline data. Keeping the same URL does not guarantee unchanged content.
Scope Treat a stable URL as a route to a resource, not proof that its current content is unchanged or trustworthy.
Not this A filesystem path without a URL scheme or web base is not automatically a public URL.
Other names, related terms and sources
Also shown as URLs, Uniform Resource Locator, web address
Source refs sites/microcosm/SOURCE_CONTRACT.md (reading_context)
url · public projection Generated from the governed public vocabulary for Plectis.
V
validation General or domain usage Validation checks fitness for an intended use; data validation also checks records against declared constraints.
Systems engineering validation asks whether a result serves its intended purpose under relevant conditions. A JSON validator uses the same word for checking data against a schema. Local tools perform both structural and behavioural checks .
A generated glossary can have valid row shapes while explaining a term badly. A source -faithful page can also fail the reader 's task. Structural checks , behavioural checks , and intended-use review therefore complement one another rather than contributing interchangeable passes.
Example The term-layer validation checks that every glossary definition is well formed and that its generated links resolve.
Meaning scope General or domain usage. The word has an engineering intended-use sense and an established data-constraint sense. Local claims must name their criteria; neither sense implies universal correctness.
Scope A run establishes only its declared criteria for the recorded object and conditions.
Not this A validation pass is not proof of claims the validator was never designed to check .
Reader rule Identify which sense and acceptance criteria a run uses. Schema acceptance does not establish that data are true or a result meets the user's intended need.
Other names, related terms and sources
Also shown as validation run, validation result
Search handles validate, validated
Source refs standard std_system_term (standard)
validation · public projection Generated from the governed public vocabulary for Plectis.
validator General or domain usage A validator checks whether supplied material satisfies a declared set of requirements.
It can examine a schema, input constraints, relationships, or other properties and report a pass, failure, warning, or inability to complete. Plectis connects these outcomes to the rules being applied.
A file may be structurally valid while containing a false claim , and a blocked validation may simply lack a dependency . Clear result categories help distinguish these situations and identify the next appropriate action.
Example The glossary validator rejects a row with a missing definition or an unresolved relationship target.
Scope A validator covers the input fields, rules, and environment implemented by its declared version.
Not this A script that always prints pass is not a meaningful validator even if its output has the right schema.
Reader rule Validation is only as broad as those rules and the evidence examined.
Other names, related terms and sources
Also shown as validation tool, contract checker
Search handles checking component
validator · public projection Generated from the governed public vocabulary for Plectis.
Vandermonde determinant General or domain usage A Vandermonde determinant is formed from successive powers of specified nodes and equals a product of their pairwise differences.
For nodes 𝑥 0 , … , 𝑥 𝑛 − 1 x 0 , … , x n − 1 , the matrix 𝑉 𝑖 𝑗 = 𝑥 𝑗 𝑖 V i j = x i j has determinant ∏ 𝑖 < 𝑗 ( 𝑥 𝑗 − 𝑥 𝑖 ) ∏ i < j ( x j − x i ) . With two nodes, the rows are ( 1 , 𝑥 0 ) ( 1 , x 0 ) and ( 1 , 𝑥 1 ) ( 1 , x 1 ) , giving 𝑥 1 − 𝑥 0 x 1 − x 0 .
The #1049 moment expansion contains ∏ 𝑖 < 𝑗 ( 𝑞 𝑘 𝑖 − 𝑞 𝑘 𝑗 ) 2 ∏ i < j ( q k i − q k j ) 2 . This factor excludes repeated nodes and makes each positive-weight contribution nonnegative, while its exact size influences the determinant asymptotic.
Scope Over a field, it is nonzero exactly when the nodes are distinct. Swapping two nodes changes the sign; squaring the determinant removes that sign.
Other names, related terms and sources
Also shown as Vandermonde factor
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos-1049-rational-base-lambert.tex (mathematical_source)
vandermonde_determinant · mathematical concept Generated from the governed public vocabulary for Plectis.
variable General or domain usage A variable is a symbol or name whose value is supplied, quantified, or allowed to vary within a stated setting.
Reader rule The name alone does not determine its meaning or permitted values.
Other names, related terms and sources
Also shown as variables, parameter variable
variable · mathematical concept Generated from the governed public vocabulary for Plectis.
vector space General or domain usage A vector space allows vector addition and multiplication by scalars from a field, with operations obeying the linear-algebra axioms .
A vector space has a zero vector and an additive inverse for every vector. Addition is associative and commutative; scalar multiplication distributes over addition, respects multiplication of scalars , and leaves vectors unchanged when multiplied by 1. Plane vectors over the reals and rational sequences with termwise operations are examples.
Plectis uses vector spaces to measure how many independent arithmetic functions or Lambert-series expressions coexist.
Meaning scope General or domain usage. Linear algebra. The chosen scalar field is part of the definition.
Scope The 'vectors' need not be arrows; they can be functions , sequences , or series .
Other names, related terms and sources
Also shown as linear space
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1049/erdos1049-rational-base-lambert-reasoning-surface.tex::line 2667 (mathematical_source)
vector_space · mathematical concept Generated from the governed public vocabulary for Plectis.
verification General or domain usage Verification checks a named object against a stated property, requirement, or reference .
A hash comparison checks file identity; a test checks observed behaviour in selected cases; a Lean kernel check checks a formal derivation . These methods share a status word but support different conclusions.
Systems engineering distinguishes specified-requirement conformance from validation of intended use. Local tools also call narrow comparisons and audits verification. A file can match its expected hash while containing a mathematical error, because identity and mathematical correctness are different properties.
Example A live-site verification compares the served file hash with the locally generated file hash.
Meaning scope General or domain usage. Ordinary technical verification includes several kinds of checking. The engineering distinction from validation is useful, but the actual command and claim determine what a local record establishes.
Scope Verification covers the named object, property or source comparison, checker , and recorded version.
Not this Verified does not mean reviewed for every possible error, use, or broader claim .
Reader rule Ask what was checked , against which criterion, on which version, by which method. Interpret the result within that method's assumptions and coverage .
Other names, related terms and sources
Also shown as verification check, verification result
Search handles verify, verified
Source refs standard std_operator_action_receipt (standard)
verification · public projection Generated from the governed public vocabulary for Plectis.
vibe-mathing System-coined term “Vibe-mathing” is this project's informal name for accepting AI-generated mathematical reasoning on plausibility without adequate independent checking.
Intuition and conversation can help generate useful ideas, but a fluent argument may hide an invalid step. The failure occurs when generating a candidate is treated as establishing it.
The project's response is to keep claims , evidence , explanations, and unresolved steps distinct. Formal checking helps with encoded inference; it does not replace understanding the intended result or explaining its significance.
Example The earliest attempts at the Erdős problems here were vibe-mathing: long chats, confident arguments, and no kernel to refuse a bad step.
Meaning scope System-coined term. Vibe-mathing is a coined phrase, by analogy with vibe coding: doing mathematics with an AI by steering on intuition and letting the model supply the working. No generally accepted external meaning is claimed .
Scope A coined local name for an informal way of working with an AI on maths . It is not a name for Lean-checked results.
Not this A Lean -accepted theorem with a named remaining obligation is not vibe-mathing, even if an AI drafted the proof .
Reader rule A proof needs verification appropriate to its statement, whether formal or carefully examined mathematical reasoning.
Other names, related terms and sources
Also shown as vibe mathing, vibe maths
Search handles vibe math
vibe_mathing · public projection Generated from the governed public vocabulary for Plectis.
vulnerability General or domain usage A vulnerability is a weakness that could be exploited to violate a security requirement.
The weakness may lie in code, configuration , design, dependencies , or operating practice. Severity depends on exploitability, required access, and impact to confidentiality, integrity, or availability. A suspected vulnerability differs from a confirmed exploitable path.
A vulnerability is a weakness that could be exploited, under some preconditions, to violate confidentiality, integrity, availability, authorization , or another security requirement. The definition does not imply that exploitation has occurred, that a working exploit is public, or that every bug creates security impact. Evidence may progress from suspected weakness to reproducible exploitability and observed incident. Severity depends on affected versions, attacker access, complexity, privileges, user interaction, scope , and consequence. Responsible reporting separates those facts from remediation status and ordinary correctness defects.
Example Accepting untrusted instructions as authority can create an agent -control vulnerability.
Scope The term covers software , information-flow, and agent -control weaknesses discussed by the site.
Not this An inconvenient interface is not a security vulnerability unless it enables a protected property to be violated.
Reader rule A vulnerability does not imply that exploitation occurred; distinguish suspected weakness, demonstrated exploitability, and observed incident.
Other names, related terms and sources
Also shown as vulnerabilities, security vulnerability, weakness
vulnerability · public projection Generated from the governed public vocabulary for Plectis.
W
wave System-local specialization A wave is one bounded pass of work within a larger phase .
one bounded execution pass
It has a stated objective, execution approach, permitted scope , and expected result. Plectis uses waves to organise progress into units that can be inspected and incorporated into the continuing programme.
A wave's closeout should say what changed, what was checked , and what remains. The organisational label does not itself establish progress; the useful outcome and its evidence do.
Example The Bridge Phase Continuity Runtime is a concrete place waves appear: it carries execution across passes within a phase so that one wave's outcome can be resumed by the next rather than lost. See it live: Bridge Phase Continuity Runtime open the component that carries waves across passes within a phase
Meaning scope System-local specialization. Wave means a bounded execution grouping inside an ai_workflow phase . It is not a physical wave, market wave, social trend, or universal planning unit.
Scope The term covers the runtime unit of phase work and the lifecycle of planning, executing , recording, and assimilating one pass. A reader meets it wherever the site describes how a phase progresses, how execution continues across passes, and how outcomes are kept as durable records .
Not this A wave is not a whole phase , a project milestone, or a vague burst of activity. It is one bounded execution pass with a defined objective, allowed paths, and a recorded outcome.
Reader rule The live work record determines which wave is active or complete.
Other names, related terms and sources
Also shown as execution wave, phase wave, bounded wave
Source refs doctrine skill wave_conductor (skill) doctrine skill wave_assimilation (skill)
wave · runtime Generated from the governed public vocabulary for Plectis.
web browser General or domain usage A web browser is an application that retrieves, interprets, and presents web resources.
Browsers request URLs , parse HTML into a document tree , apply CSS , run permitted JavaScript , and expose accessibility information and user controls. Security boundaries limit page access to devices, files, and other origins.
Modern browsers combine an HTTP client , rendering engine, JavaScript runtime , storage, navigation history, and security policy. Different browsers and assistive technologies can expose small behavioural differences, so public interfaces need standards -based markup and testing. Plectis has no browser path into private state: generated public files and explicitly permitted network resources define what page code can reach.
Example A browser downloads HTML and CSS , then opens a glossary card when the reader focuses a linked term.
Meaning scope General or domain usage. User software that retrieves, interprets, and presents web content, distinct from the server that supplies it.
Scope Browser presentation is a view of retrieved content and local runtime state; inspect source records when the page says they are authoritative .
Not this A web server that stores and returns the page is not the browser displaying it.
Other names, related terms and sources
Also shown as browser, browsers
Source refs sites/microcosm/SOURCE_CONTRACT.md (reading_context)
web_browser · public projection Generated from the governed public vocabulary for Plectis.
webhook General or domain usage A webhook is an HTTP request one system sends to another when a configured event occurs.
Webhooks provide event notifications without requiring the receiver to poll repeatedly. The sender targets a registered URL and usually includes a structured payload that the receiver must authenticate and validate .
A webhook connects an event producer to a receiving endpoint . Delivery can be delayed, duplicated, reordered, or retried, so handlers should be idempotent where possible and retain enough information to detect replays . Redirects can send sensitive payloads to an unintended host, which is why the Plectis security example uses a redirect allowlist. Receiving a webhook reports an event; it does not by itself authorize every downstream action.
Example A repository service posts a signed event payload when a pull request opens.
Meaning scope General or domain usage. An automated HTTP notification sent to a registered receiver when an event occurs, rather than a link opened by a reader .
Scope Treat webhook input as untrusted network input; verify its sender, integrity, permitted destination, and replay policy before acting.
Not this A browser link that a reader chooses to open is not a webhook.
Other names, related terms and sources
Also shown as webhooks, webhook request
Source refs sites/microcosm/docs/paper-module-agentic-vulnerability-discovery-patch-proof-replay.html (reading_context)
webhook · public projection Generated from the governed public vocabulary for Plectis.
Weyl criterion General or domain usage A test for uniform distribution that checks the averages of all nonconstant exponential characters.
Meaning scope General or domain usage. This is the equidistribution criterion on the stated torus and averaging sequence ; checking only a finite set of frequencies is insufficient.
Scope Every nonzero integer frequency must be checked . The criterion proves proportions of visits, a stronger statement than topological density. It is qualitative unless explicit bounds on the exponential averages are supplied.
Other names, related terms and sources
Also shown as Weyl equidistribution criterion, Weyl criterion for uniform distribution
Source refs sites/microcosm/papers/source/plectis-erdos/paper/269/erdos269-running-lcm-reasoning-surface.tex::line 1553 (mathematical_source)
weyl_criterion · mathematical concept Generated from the governed public vocabulary for Plectis.
Whisper Externally anchored Whisper is OpenAI's speech-recognition model family for converting audio speech into text.
It can support transcription and related language tasks through suitable software . The surrounding recording workflow determines which timestamps, speaker information, or other metadata are supplied with the text.
Recognition can make errors, especially with unfamiliar names, technical notation, or unclear audio. Plectis should preserve the source recording where exact wording matters and check important passages before treating them as authoritative quotations.
Example A demonstration recording can use a Whisper transcript to locate spoken passages while retaining the original audio for checking exact wording.
Scope Whisper is made by OpenAI and is external to this work.
Reader rule Do not assume that every transcript has accurate word-level timings or speaker labels.
Sources
whisper · public projection Generated from the governed public vocabulary for Plectis.
whole-system correctness System-local specialization Whole-system correctness means satisfying a complete, stated specification for an entire system.
Such a claim must cover the relevant components , interactions, inputs, and environment . A collection of correct parts can still interact incorrectly or omit a requirement the overall task needs.
Plectis uses the phrase to mark that evidence boundary. Its public examples establish particular behaviours or properties; any claim about the whole system would need a suitable specification and evidence covering the composition as well.
Example A component 's scope limit records that a passing fixture case does not establish whole-system correctness.
Meaning scope System-local specialization. Whole-system correctness is the global guarantee that Plectis explicitly refuses to infer from local checks ; no component , page, or collection of green fixtures establishes it.
Scope The specification determines the scope of a whole-system correctness claim . The public component checks do not establish such a claim for the larger system.
Reader rule Individual component checks do not automatically establish this broader property.
Other names, related terms and sources
Also shown as whole system correctness
Source refs standard std_microcosm (source_authority) src/microcosm_core/validators/research_claim_assurance.py (source_authority)
whole_system_correctness · public projection Generated from the governed public vocabulary for Plectis.
winding number General or domain usage The winding number of a closed plane curve around a point outside the curve counts, with sign, how many net turns the curve makes around that point.
A counterclockwise circle around the origin has winding number 1; traversing it twice gives 2, and a clockwise traversal gives -1. A loop that can be contracted without crossing the point has winding number 0.
The paper notes that level curves can carry an integer winding quantity. Cutting an annulus turns closed loops into arcs and can erase precisely this invariant , so the cut model may lose information essential to the original topology.
Example A counterclockwise circle around the origin has winding number 1; traversing it twice gives 2, and a clockwise traversal gives -1.
Meaning scope General or domain usage. Winding number depends on orientation and a reference point off the curve. Overlapping turns are counted with signs, not by enclosed area.
Scope The curve must avoid the reference point, and orientation matters. The number is invariant under deformations that continue to avoid that point. For nonsimple curves, overlapping turns contribute algebraically rather than by enclosed area.
Other names, related terms and sources
Also shown as index of a curve
Source refs sites/microcosm/papers/source/plectis-erdos/paper/1041/erdos1041-lemniscate-reasoning-surface.tex::line 2330 (mathematical_source)
winding_number · mathematical concept Generated from the governed public vocabulary for Plectis.
work landing System-coined term Work landing is the point at which an attempted change becomes a recorded, accepted part of the system.
durable work acceptance
Meaning scope System-coined term. Work landing is a local ai_workflow construct for accepting one bounded change into durable substrate . It does not imply that unrelated follow-up work is complete or that the phrase is generally standardized.
Scope The term covers acceptance of one bounded unit of work into its owning files, records , and status surfaces. It does not imply that unrelated follow-up work is complete.
Not this Describing a proposed patch or leaving an unvalidated edit in a transient session is not work landing.
Reader rule Acceptance concerns the stated scope and criteria, not every possible use of the change.
Other names, related terms and sources
Also shown as durable work landing, landing work
Search handles work-landing, land work
Related terms completes work Landing distinguishes durable completed work from attempted activity. preserves continuity A landed result leaves enough state for the next actor to resume safely. records record Landing binds changes and validation into a durable record . checked_by validation Focused validation is part of the landing boundary.
Source refs doctrine module operational_work_item_spine (work_spine_theory) tool microcosm_public_narratives (public_narrative_owner)
work_landing · public projection Generated from the governed public vocabulary for Plectis.
working record System-local specialization A working record is the detailed account of research on one problem, preserving results, attempts, evidence , and unresolved questions .
Meaning scope System-local specialization. In Plectis, a working record is a long rendered reasoning-surface PDF for one mathematical problem; it is not an ordinary worklog, a complete private agent trace , or the shorter problem note .
Scope A working record covers the selected reasoning, checked premises , failed routes , and surviving obligation presented in that rendered version. It is not proof authority , a complete private search history, or a generic contemporaneous project log.
Reader rule Different passages can have different evidence status, so the record should identify what is proved, computed, cited, or open.
Other names, related terms and sources
Also shown as long working record
Search handles long working records, reasoning surface, reasoning surfaces, long record, long records
Source refs tool build_microcosm_public_site (source_authority) tool build_short_human_outreach_batch (source_authority)
working_record · public projection Generated from the governed public vocabulary for Plectis.
workingness System-coined term Workingness is Plectis's term for whether its evidence , beliefs, uncertainty, and permitted actions remain coherently connected.
safe useful self-knowledge
It asks what the system currently claims , what supports those claims , what could invalidate them, and how decisions respond to missing or contradictory evidence . Passing tests are one input to that assessment.
Its value depends on concrete records and behaviour: an unsupported claim should change status, and an action depending on it should be reconsidered rather than silently proceeding.
Example The evidence page, "What the pass proves", is a concrete instance: it lays out exactly what a given pass does and does not establish, which is the workingness question made visible for one result. See it live: What the pass proves (evidence) see what a single pass actually establishes
Meaning scope System-coined term. Workingness is a local diagnostic posture about observed operation. It is not a standardized reliability metric and does not imply whole-system correctness .
Scope Workingness covers the system's epistemic health as a whole, distinct from ordinary event logging. A reader meets it wherever a result is being interpreted before a change is made: an evidence page showing what a pass proves, a drift check , or a live receipt . The owning module is the Workingness Instrument , and any dossier is a readable projection of that state.
Not this Workingness is not a green test suite or a build-passing badge. A run can be entirely green and still have low workingness if the system cannot say what remains unknown, what would change its mind, or which actions it is allowed to take.
Reader rule The term names a proposed evaluative idea, not a universal measure of reliability .
Other names, related terms and sources
Also shown as working, actually working, system workingness
Search handles workingness state, workingness dossier
Source refs doctrine module workingness_instrument (paper_module) standard std_workingness_instrument (standard)
workingness · diagnostic Generated from the governed public vocabulary for Plectis.
Workingness Instrument System-coined term A Workingness Instrument is a proposed structured record connecting one outcome to its evidence , dependencies , and permitted next actions.
truth-state action boundary
Meaning scope System-coined term. A workingness instrument binds one live result to evidence , invalidators, and allowed or blocked actions; it is not a monitoring dashboard, a correctness verdict, or an authority writer.
Scope The term covers the governing record that binds evidence , judgment, appeals, repairs, and mutation permissions for a single live claim . A reader meets it where the site shows how a passing or failing result is allowed to act on the system, and a summary dossier may stand in front of it.
Not this A workingness instrument is not a verdict that the whole system is working, and not a tool that edits the system on its own. It is the record of what one result permits, with no power to change doctrine , routes, or standards by itself.
Reader rule The record 's existence does not establish that every described control has been implemented .
Other names, related terms and sources
Also shown as workingness_instrument, workingness dossier
Search handles system workingness instrument, truth-maintaining instrument
Source refs doctrine module workingness_instrument (paper_module) standard std_workingness_instrument (standard)
workingness_instrument · artifact Generated from the governed public vocabulary for Plectis.
The glossary explains reader-facing words. It does not rename source paths, package ids, old URLs, compatibility handles, or authority records by itself.